SearcharxivSearch

arXiv subjects

Mark Carney

Publications and source records attributed to Mark Carney.

10 recordsLinked to original sources

Tracing the Loop: Non-Causal Computation, Partial Traces, & Postselected Entanglement

This paper gives a categorical interpretation of Baumeler \& Wolf's logically consistent non-causal circuits, connecting them to postselected quantum teleportation. Looped feedback is represented by a trace in the category of non-negative matrices, and it is shown that the traced process is stochastic precisely when the induced loop transition matrix has trace $1$ for every external input, a condition shown to be equivalent to a unique fixed point for the loop for each input to a deterministic circuit. A classical non-causal circuit is represented by a measure-and-prepare quantum channel with an internal register utilising a maximally entangled Bell-state with postselection. The main result is that classical logical consistency is equivalent to the postselected Bell outcome having, for loop dimension $d$, probability exactly $1/d^2$ for each classical input distribution. The subsequent normalised conditional output then agrees exactly with the classical categorical trace. This work identifies a class of quantum Bell-postselection constructions whose conditional evolution maintains linear dependence on classical input distributions.

quant-ph

Inexpressibility in Exp-Minus-Log

Odrzywo\l{}ek defined a system Exp-Minus-Log (EML) that reduces all elementary functions over complex numbers down to a constant `$1$', and a single two place function $E(\alpha, \beta) = \exp(\alpha) - \log(\beta)$. This paper shows that in this system, equivalent to Chow's EL numbers, every EML-expressible number is computable. We go on to prove that the canonical example of a non-computable real, Chaitin's $\Omega_U$, is inexpressible in EML. This gives a formal inexpressibility theorem for this system.

math.LO

The Manipulate-and-Observe Attack on Quantum Key Distribution

Quantum key distribution is often regarded as an unconditionally secure method to exchange a secret key by harnessing fundamental aspects of quantum mechanics. Despite the robustness of key exchange, classical post-processing reveals vulnerabilities that an eavesdropper could target. In particular, many reconciliation protocols correct errors by comparing the parities of subsets between both parties. These communications occur over insecure channels, leaking information that an eavesdropper could exploit. Currently there is no holistic threat model that addresses how parity-leakage during reconciliation might be actively manipulated. In this paper we introduce a new form of attack, namely the Manipulate-and-Observe attack in which the adversary (1) partially intercepts a fraction $\rho$ of the qubits during key exchange, injecting the maximally tolerated amount of errors up to the 11 percent error threshold whilst remaining undetected and (2) probes the maximum amount of parity-leakage during reconciliation, and exploits it using a vectorised, parallel brute force filter to shrink the search space from 2n down to as few as a single candidate, for an n-bit reconciled key. We perform simulations of the attack, deploying it on the most widely used protocol, BB84, andthe benchmark reconciliation protocol, Cascade. Our simulation results demonstrate that the attack can significantly reduce the security below the theoretical bound and, in the worst case, fully recover the reconciled key material. The principles of the attack could threaten other parity-based reconciliation schemes, like Low Density Parity Check, which underscores the need for urgent consideration of the combined security of key exchange and post-processing.

quant-ph

Uncut Gem -- An Open-Source Hackable Quantum Sensor

This work presents an overview of our fully open-source, hackable quantum sensor platform based on nitrogen-vacancy (NV) center diamond magnetometry. This initiative aims to democratize access to quantum sensing by providing a comprehensive, modular, and cost-effective system. The design leverages consumer off-the-shelf (COTS) components in a novel hardware configuration, complemented by open-source firmware written in the Arduino IDE, facilitating portability, ease of customization, and future-proofing the design. By lowering the barriers to entry, our sensor serves as a compact platform for education, research, and innovation in quantum technologies, embodying the ethos of open science and community-driven development.

quant-ph

Qubit Instrumentation of Entanglement

This chapter and the experiments described within explore how `human entanglement' might be represented and even emulated by physical entanglement. To achieve this, a notion of `tonal centrality' between two musicians is captured via MIDI and passed as a parameter into a quantum simulation taking place on an embedded device (a Raspberry Pi Pico). The results of these simulations are then coded back into MIDI and sent to the players' instruments. The closer the musicians' tonality is, the more their instruments will be entangled in a $|\Phi^+ \rangle$ state, and the further away they are the more their instruments will be entangled in a $|\Psi^+ \rangle$ state. The intention is to create random parameters that are correlative - \emph{i.e.} the same on both instruments - or anti-correlative - \emph{i.e.} the bit-wise opposite of each other, influenced by the tonal relationship from the players. These random parameters sharing these particular properties add a new dimension for quantum-musical expression. This concept was realised experimentally, and the full code and sample outputs are provided. This work aims to pave the way for musicians to explore and experience quantum emulations of their own musical experiences, adding a new nuance and possibilities for the future of \emph{entangled ensembles.}

quant-ph

Quid Manumit -- Freeing the Qubit for Art

This paper describes how to `Free the Qubit' for art, by creating standalone quantum musical effects and instruments. Previously released quantum simulator code for an ARM-based Raspberry Pi Pico embedded microcontroller is utilised here, and several examples are built demonstrating different methods of utilising embedded resources: The first is a Quantum MIDI processor that generates additional notes for accompaniment and unique quantum generated instruments based on the input notes, decoded and passed through a quantum circuit in an embedded simulator. The second is a Quantum Distortion module that changes an instrument's raw sound according to a quantum circuit, which is presented in two forms; a self-contained Quantum Stylophone, and an effect module plugin called 'QubitCrusher' for the Korg Nu:Tekt NTS-1. This paper also discusses future work and directions for quantum instruments, and provides all examples as open source. This is, to the author's knowledge, the first example of embedded Quantum Simulators for Instruments of Music (another QSIM).

quant-ph

Computability and Tiling Problems

In this thesis we will present and discuss various results pertaining to tiling problems and mathematical logic, specifically computability theory. We focus on Wang prototiles, as defined in [32]. We begin by studying Domino Problems, and do not restrict ourselves to the usual problems concerning finite sets of prototiles. We first consider two domino problems: whether a given set of prototiles $S$ has total planar tilings, which we denote $TILE$, or whether it has infinite connected but not necessarily total tilings, $WTILE$ (short for `weakly tile'). We show that both $TILE \equiv_m ILL \equiv_m WTILE$, and thereby both $TILE$ and $WTILE$ are $\Sigma^1_1$-complete. We also show that the opposite problems, $\neg TILE$ and $SNT$ (short for `Strongly Not Tile') are such that $\neg TILE \equiv_m WELL \equiv_m SNT$ and so both $\neg TILE$ and $SNT$ are both $\Pi^1_1$-complete. Next we give some consideration to the problem of whether a given (infinite) set of prototiles is periodic or aperiodic. We study the sets $PTile$ of periodic tilings, and $ATile$ of aperiodic tilings. We then show that both of these sets are complete for the class of problems of the form $(\Sigma^1_1 \wedge \Pi^1_1)$. We also present results for finite versions of these tiling problems. We then move on to consider the Weihrauch reducibility for a general total tiling principle $CT$ as well as weaker principles of tiling, and show that there exist Weihrauch equivalences to closed choice on Baire space, $C_{\omega^\omega}$. We also show that all Domino Problems that tile some infinite connected region are Weihrauch reducible to $C_{\omega^\omega}$. Finally, we give a prototile set of 15 prototiles that can encode any Elementary Cellular Automaton (ECA). We make use of an unusual tile set, based on hexagons and lozenges that we have not see in the literature before, in order to achieve this.

math.LO

On Zero-Knowledge Proofs over the Quantum Internet

This paper presents a new method for quantum identity authentication (QIA) protocols. The logic of classical zero-knowledge proofs (ZKPs) due to Schnorr is applied in quantum circuits and algorithms. This novel approach gives an exact way with which a prover $P$ can prove they know some secret by encapsulating it in a quantum state before sending to a verifier $V$ by means of a quantum channel - allowing for a ZKP wherein an eavesdropper or manipulation can be detected with a fail-safe design. This is achieved by moving away from the hardness of the Discrete Logarithm Problem towards the hardness of estimating quantum states. This paper presents a method with which this can be achieved and some bounds for the security of the protocol provided. With the anticipated advent of a `quantum internet', such protocols and ideas may soon have utility and execution in the real world.

quant-ph

Cutting Medusa's Path -- Tackling Kill-Chains with Quantum Computing

This paper embarks upon exploration of quantum vulnerability analysis. By introducing vulnerability graphs, related to attack graphs, this paper provides background theory and a subsequent method for solving significant cybersecurity problems with quantum computing. The example given is to prioritize patches by expressing the connectivity of various vulnerabilities on a network with a QUBO and then solving this with quantum annealing. Such a solution is then proved to remove all kill-chains (paths to security compromise) on a network. The results demonstrate that the quantum computer's solve time is almost constant compared to the exponential increase in classical solve time for vulnerability graphs of expected real world density. As such, this paper presents a novel example of advantageous quantum vulnerability analysis.

quant-ph

Universal Statistical Simulator

The Quantum Fourier Transform is a famous example in quantum computing for being the first demonstration of a useful algorithm in which a quantum computer is exponentially faster than a classical computer. However when giving an explanation of the speed up, understanding computational complexity of a classical calculation has to be taken on faith. Moreover, the explanation also comes with the caveat that the current classical calculations might be improved. In this paper we present a quantum computer code for a Galton Board Simulator that is exponentially faster than a classical calculation using an example that can be intuitively understood without requiring an understanding of computational complexity. We demonstrate a straight forward implementation on a quantum computer, using only three types of quantum gate, which calculates $2^n$ trajectories using $\mathcal{O} (n^2)$ resources. The circuit presented here also benefits from having a lower depth than previous Quantum Galton Boards, and in addition, we show that it can be extended to a universal statistical simulator which is achieved by removing pegs and altering the left-right ratio for each peg.

quant-ph