Dealing with ignorance: universal discrimination, learning and quantum correlations
arXiv:1407.4690
Abstract
The problem of discriminating the state of a quantum system among a number of hypothetical states is usually addressed under the assumption that one has perfect knowledge of the possible states of the system. In this thesis, I analyze the role of the prior information available in facing such problems, and consider scenarios where the information regarding the possible states is incomplete. In front of a complete ignorance of the possible states' identity, I discuss a quantum "programmable" discrimination machine for qubit states that accepts this information as input programs using a quantum encoding, rather than as a classical description. The optimal performance of these machines is studied for general qubit states when several copies are provided, in the schemes of unambiguous, minimum-error, and error-margin discrimination. Then, this type of automation in discrimination tasks is taken further. By realizing a programmable machine as a device that is trained through quantum information to perform a specific task, I propose a quantum "learning" machine for classifying qubit states that does not require a quantum memory to store the qubit programs and, nevertheless, performs as good as quantum mechanics permits. Such learning machine thus allows for several optimal uses with no need for retraining. A similar learning scheme is also discussed for coherent states of light. I present it in the context of the readout of a classical memory by means of classically correlated coherent signals, when these are produced by an imperfect source. I show that, in this case, the retrieval of information stored in the memory can be carried out more accurately when fully general quantum measurements are used. Finally, as a transversal topic, I propose an efficient algorithmic way of decomposing any quantum measurement into convex combinations of simpler (extremal) measurements.
arXiv commentPh.D. Thesis, Universitat Autònoma de Barcelona, 200 pages, 23 figures
References in corpus (61)
- Quantum information with continuous variables
- Quantum key distribution using gaussian-modulated coherent states
- On the reality of the quantum state
- Quantum Illumination with Gaussian States
- Quantum Theory of Probability and Decisions
- The characterization of Gaussian operations and Distillation of Gaussian States
- Quantum probabilities as Bayesian probabilities
- Quantum Dense Coding Exploiting Bright EPR Beam
- Programmable quantum gate arrays
- Optimum Unambiguous Discrimination Between Linearly Independent Symmetric States
- Universal Algorithm for Optimal Estimation of Quantum States from Finite Ensembles
- QBism, the Perimeter of Quantum Bayesianism
- Quantum Reading of a Classical Digital Memory
- Machine Learning for Precise Quantum Measurement
- Discrimination of the binary coherent signal: Gaussian-operation limit and simple non-Gaussian near-optimal receivers
- The quantum Chernoff bound as a measure of distinguishability between density matrices: application to qubit and Gaussian states
- Maximum Confidence Quantum Measurements
- Unambiguous discrimination of mixed states
- Random quantum correlations and density operator distributions
- Average fidelity between random quantum states
- Optimum unambiguous discrimination of two mixed quantum states
- Optimal discrimination of mixed quantum states involving inconclusive results
- Quantum learning and universal quantum matching machine
- A universal programmable quantum state discriminator that is optimal for unambiguously distinguishing between unknown states
- Optimal full estimation of qubit mixed states
- Multiple copy 2-state discrimination with individual measurements
- Local discrimination of mixed states
- Mixed quantum state detection with inconclusive results
- Discriminating quantum-optical beam-splitter channels with number-diagonal signal states: Applications to quantum reading and target detection
- Aligning Reference Frames Using Quantum States
- General Strategies for Discrimination of Quantum States
- Unambiguous Discrimination Between Linearly Dependent States with Multiple Copies
- Universal measurement apparatus controlled by quantum software
- Optimal discrimination of quantum states with a fixed rate of inconclusive outcomes
- Training a Large Scale Classifier with the Quantum Adiabatic Algorithm
- State discrimination with error margin and its locality
- How continuous quantum measurements in finite dimension are actually discrete
- Quantum pure-state identification
- Optimal unambiguous discrimination of two subspaces as a case in mixed state discrimination
- Unambiguous pure state identification without classical knowledge
- Programmable quantum state discriminators with simple programs
- Discrimination with error margin between two states - Case of general occurrence probabilities -
- Optimal bounded-error strategies for projective measurements in non-orthogonal state discrimination
- Multiple-copy state discrimination: Thinking globally, acting locally
- Quantum Metrology Assisted with Abstention
- Unambiguous coherent state identification: Searching a quantum database
- Changepoint Problem in Quantumn Setting
- Comparing the states of many quantum systems
- Experimental Proof of Quantum Nonlocality without Squeezing
- Programmable unknown quantum-state discriminators with multiple copies of program and data: A Jordan basis approach
- Optimal universal programmable detectors for unambiguous discrimination
- Quantum reading of digital memory with non-Gaussian entangled light
- Unambiguous comparison of ensembles of quantum states
- Optimum unambiguous identification of d unknown pure qudit states
- Unambiguous discrimination between two unknown qudit states
- Beating noise with abstention in state estimation
- Locality and nonlocality in quantum pure-state identification problems
- Programmable discrimination with an error margin
- Success probabilities for universal unambiguous discriminators between unknown pure states
- Unambiguous identification of coherent states II: Multiple resources
- A bound for the number of vertices of a polytope with applications