Online identification of symmetric pure states

Abstract

We consider online strategies for discriminating between symmetric pure states with zero error when $n$ copies of the states are provided. Optimized online strategies involve local, possibly adaptive measurements on each copy and are optimal at each step, which makes them robust in front of particle losses or an abrupt termination of the discrimination process. We first review previous results on binary minimum and zero error discrimination with local measurements that achieve the maximum success probability set by optimizing over global measurements, highlighting their online features. We then extend these results to the case of zero error identification of three symmetric states with constant overlap. We provide optimal online schemes that attain global performance for any $n$ if the state overlaps are positive, and for odd $n$ if overlaps have a negative value. For arbitrary complex overlaps, we show compelling evidence that online schemes fail to reach optimal global performance. The online schemes that we describe only require to store the last outcome obtained in a classical memory, and adaptiveness of the measurements reduce to at most two changes, regardless of the value of $n$.

arXiv comment12 pages, 1 figure

References in corpus (36)

• Quantum Cryptography
• Quantum Communication
• Quantum Nonlocality without Entanglement
• Local Distinguishability of Multipartite Orthogonal Quantum States
• Probabilistic cloning and identification of linearly independent quantum states
• Quantum State Discrimination
• Unambiguous Discrimination Between Linearly-Independent Quantum States
• Quantum state discrimination and its applications
• General Resource Theories in Quantum Mechanics and Beyond: Operational Characterization via Discrimination Tasks
• Hiding classical data in multi-partite quantum states
• Optimal local discrimination of two multipartite pure states
• Quantifying quantum resources with conic programming
• From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
• A Semidefinite Programming Approach to Optimal Unambiguous Discrimination of Quantum States
• Conditions for compatibility of quantum state assignments
• Multiple copy 2-state discrimination with individual measurements
• Operational relevance of resource theories of quantum measurements
• Optimally Conclusive Discrimination of Non-orthogonal Entangled States Locally
• Unambiguous Discrimination Between Linearly Dependent States with Multiple Copies
• Minimum Decision Cost for Quantum Ensembles
• On the Optimality of Square Root Measurements in Quantum State Discrimination
• A Return to the Optimal Detection of Quantum Information
• Optimal Conclusive Discrimination of Two Non-orthogonal Pure Product Multipartite States Locally
• When do Local Operations and Classical Communication Suffice for Two-Qubit State Discrimination?
• Optimal conclusive discrimination of two states can be achieved locally
• No-signaling Principle Can Determine Optimal Quantum State Discrimination
• Quantum Sequential Hypothesis Testing
• Secrecy content of two-qubit states
• Exact Identification of a Quantum Change Point
• Nonlocality Without Entanglement: Quantum Theory and Beyond
• Optimal Measurements for Symmetric Quantum States with Applications to Optical Communication
• Optimal sequential measurements for bi-partite state discrimination
• Online optimal exact identification of a quantum change point
• Optimal discrimination of optical coherent states cannot always be realized by interfering with coherent light, photon counting, and feedback
• Local unambiguous discrimination of symmetric ternary states
• Certified answers for ordered quantum discrimination problems