In this article, we consider a network of quantum sensors, where each sensor is a qubit detector that “fires,” i.e., its state changes when an event occurs close by. The change in state due to the firing of a detector is given by a unitary operator, which is the same for all sensors in the network. Such a network of detectors can be used to localize an event, using a protocol to determine the firing sensor, presumably the one closest to the event. The determination of the firing sensor can be posed as a Quantum State Discrimination problem, which incurs a probability of error depending on the initial state and the measurement operators used. In this article, we address the problem of determining the optimal initial global state of a network of detectors that incur a minimum probability of error in determining the firing sensor. For this problem, we derive necessary and sufficient conditions for the existence of an initial state that allows for perfect discrimination, i.e., zero probability of error. Using insights from this result, we derive a conjectured optimal solution for the initial state, provide a pathway to prove the conjecture, and validate the conjecture empirically using multiple search heuristics that seem to perform near-optimally.
Optimal Average Success Probabilities of Binary (n,n−1) and (n,n−2) Quantum Random Access Codes
A binary (n,m) quantum random access code (QRAC) compresses an n-bit classical string into an m-qubit quantum state, from which a decoder attempts to recover a randomly selected target bit. Of particular interest is the optimal average probability of success, Pn,mQ,avg,opt, which was numerically conjectured to satisfy the bound Pn,mQ,avg,opt≤21+21nm. Recent constructions of (n,n−1) QRACs by Suzuki and (n,n−2) QRACs by Akibue et al. meet this bound exactly, raising the question of their strict optimality. In this work, we settle this question by proving the conjectured upper bound for m∈{n−1,n−2}, thereby precisely determining Pn,n−1Q,avg,opt and Pn,n−2Q,avg,opt. The proof utilizes a translation recently studied by Lin and de Wolf from local to global reconstruction via pretty good measurement, along with dimensional and positive-semidefinite constraints on an induced channel.
We survey the state of the art for the proof of the quantum Gaussian optimizer conjectures of quantum information theory. These fundamental conjectures state that quantum Gaussian input states are the solution to several optimization problems involving quantum Gaussian channels. These problems are the quantum counterpart of three fundamental results of functional analysis and probability: the Entropy Power Inequality, the sharp Young’s inequality for convolutions, and the theorem “Gaussian kernels have only Gaussian maximizers.” Quantum Gaussian channels play a key role in quantum communication theory: they are the quantum counterpart of Gaussian integral kernels and provide the mathematical model for the propagation of electromagnetic waves in the quantum regime. The quantum Gaussian optimizer conjectures are needed to determine the maximum communication rates over optical fibers and free space. The restriction of the quantum-limited Gaussian attenuator to input states diagonal in the Fock basis coincides with the thinning, which is the analog of the rescaling for positive integer random variables. Quantum Gaussian channels provide then a bridge between functional analysis and discrete probability.