Petal-shape probability areas: complete quantum state discrimination
Luis Roa, Carla Hermann-Avigliano, Roberto Salazar, A. B. Klimov, B., Burgos, A. Delgado

TL;DR
This paper explores the geometric representation of quantum state inner products as petal-shaped areas and analyzes the optimal discrimination strategies for sets of equally separated pure quantum states, considering both unambiguous and ambiguous protocols.
Contribution
It introduces the petal-shaped allowed areas for inner products of quantum states and studies their impact on the complete discrimination of equi-separated states using combined strategies.
Findings
Success probabilities depend on the inner product's magnitude and phase.
Maximal unambiguous discrimination occurs when the second protocol yields no ambiguous information.
The geometric petal shape characterizes the linear independence of quantum state sets.
Abstract
We find the allowed complex numbers associated with the inner product of N equally separated pure quantum states. The allowed areas on the unitary complex plane have the form of petals. A point inside the petal-shape represents a set of N linearly independent (LI) pure states, and a point on the edge of that area represents a set of N linearly dependent (LD) pure states. For each one of those LI sets we study the complete discrimination of its N equi-separated states combining sequentially the two known strategies: first the unambiguous identification protocol for LI states, followed, if necessary, by the error-minimizing measurement scheme for LD states. We find that the probabilities of success for both unambiguous and ambiguous discrimination procedures depend on both the module and the phase of the involved inner product complex number. We show that, with respect to the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
