Unambiguous pure state identification without classical knowledge
arXiv:quant-ph/0510015 · doi:10.1103/PhysRevA.73.012328
Abstract
We study how to unambiguously identify a given quantum pure state with one of the two reference pure states when no classical knowledge on the reference states is given but a certain number of copies of each reference quantum state are presented. By the unambiguous identification, we mean that we are not allowed to make a mistake but our measurement can produce an inconclusive result. Assuming the two reference states are independently distributed over the whole pure state space in a unitary invariant way, we determine the optimal mean success probability for an arbitrary number of copies of the reference states and a general dimension of the state space. It is explicitly shown that the obtained optimal mean success probability asymptotically approaches that of the unambiguous discrimination as the number of the copies of the reference states increases.
v3: 8 pages, minor corrections, journal version
References in corpus (7)
- Quantum learning and universal quantum matching machine
- A universal programmable quantum state discriminator that is optimal for unambiguously distinguishing between unknown states
- Comparison of two unknown pure quantum states
- Reexamination of optimal quantum state estimation of pure states
- Quantum Template Matching
- Quantum pure-state identification
- Unambiguous comparison of the states of multiple quantum systems
Cited by in corpus (28)
- State discrimination with error margin and its locality
- Programmable quantum state discriminators with simple programs
- Quantum learning: optimal classification of qubit states
- Machine learning \& artificial intelligence in the quantum domain
- Optimum unambiguous discrimination of two mixed states and application to a class of similar states
- Unambiguous coherent state identification: Searching a quantum database
- Universal discriminator for completely unknown optical qubits
- Multi-copy programmable discrimination of general qubit states
- Changepoint Problem in Quantumn Setting
- A general approach to physical realization of unambiguous quantum-state discrimination
- Programmable unknown quantum-state discriminators with multiple copies of program and data: A Jordan basis approach
- Optimal universal programmable detectors for unambiguous discrimination
- Quantum state matching of qubits via measurement-induced nonlinear transformations
- Optimal universal learning machines for quantum state discrimination
- Optimum unambiguous identification of d unknown pure qudit states
- Unambiguous comparison of unitary channels
- Locality and nonlocality in quantum pure-state identification problems
- Success probabilities for universal unambiguous discriminators between unknown pure states
- Designing the unambiguous discriminator from the one -photon interferometer
- An agnostic-Dolinar receiver for coherent states classification
- Optimal quantum discrimination of single-qubit unitary gates between two candidates
- Optimal quantum state identification with qudit-encoded unknown states
- Decision problems with quantum black boxes
- Optimal programmable unambiguous discriminator between two unknown latitudinal states
- Application of quantum algorithms to the study of permutations and group automorphisms
- Quantum-state comparison and discrimination
- Quantum state identification of qutrits via a nonlinear protocol
- Dealing with ignorance: universal discrimination, learning and quantum correlations