Multi-copy programmable discrimination of general qubit states

Abstract

Quantum state discrimination is a fundamental primitive in quantum statistics where one has to correctly identify the state of a system that is in one of two possible known states. A programmable discrimination machine performs this task when the pair of possible states is not a priori known, but instead the two possible states are provided through two respective program ports. We study optimal programmable discrimination machines for general qubit states when several copies of states are available in the data or program ports. Two scenarios are considered: one in which the purity of the possible states is a priori known, and the fully universal one where the machine operates over generic mixed states of unknown purity. We find analytical results for both, the unambiguous and minimum error, discrimination strategies. This allows us to calculate the asymptotic performance of programmable discrimination machines when a large number of copies is provided, and to recover the standard state discrimination and state comparison values as different limiting cases.

Based on version published in Physical Review A, some errors in appendix A corrected. 13 pages, 4 figures

References in corpus (15)

• The Quantum Chernoff Bound
• The Chernoff lower bound for symmetric quantum hypothesis testing
• Machine Learning for Precise Quantum Measurement
• The quantum Chernoff bound as a measure of distinguishability between density matrices: application to qubit and Gaussian states
• Unambiguous discrimination of mixed states
• Local discrimination of mixed states
• State discrimination with error margin and its locality
• Optimal unambiguous discrimination of two subspaces as a case in mixed state discrimination
• Programmable quantum state discriminators with simple programs
• Discrimination with error margin between two states - Case of general occurrence probabilities -
• Programmable discriminator of coherent states - experimental realization
• Unambiguous coherent state identification: Searching a quantum database
• Unambiguous comparison of ensembles of quantum states
• Optimum unambiguous identification of d unknown pure qudit states
• Unambiguous identification of coherent states II: Multiple resources

Cited by in corpus (18)

• Quantum State Tomography of a Single Qubit: Comparison of Methods
• Quantum change point
• Inductive supervised quantum learning
• Quantum learning of coherent states
• Changepoint Problem in Quantumn Setting
• Resource Quantification for the No-Programming Theorem
• Real-time calibration of coherent-state receivers: learning by trial and error
• Optimal universal learning machines for quantum state discrimination
• Unambiguous discrimination between two unknown qudit states
• Programmable discrimination with an error margin
• Success probabilities for universal unambiguous discriminators between unknown pure states
• 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
• Universal algorithms for quantum data learning
• Optimal programmable unambiguous discriminator between two unknown latitudinal states
• Quantum Edge Detection
• Quantum Advantage in Storage and Retrieval of Isometry Channels