Tight bounds for antidistinguishability and circulant sets of pure quantum states
arXiv:2311.17047 · doi:10.22331/q-2025-02-04-1622
Abstract
A set of pure quantum states is said to be antidistinguishable if upon sampling one at random, there exists a measurement to perfectly determine some state that was not sampled. We show that antidistinguishability of a set of pure states is equivalent to a property of its Gram matrix called -incoherence, thus establishing a connection with quantum resource theories that lets us apply a wide variety of new tools to antidistinguishability. As a particular application of our result, we present an explicit formula (not involving any semidefinite programming) that determines whether or not a set with a circulant Gram matrix is antidistinguishable. We also show that if all inner products are smaller than then the set must be antidistinguishable, and we show that this bound is tight when . We also give a simpler proof that if all the inner products are strictly larger than , then the set cannot be antidistinguishable, and we show that this bound is tight for all .
arXiv comment21 pages, 3 figures. Comments welcome
References in corpus (36)
- Quantum Nonlocality without Entanglement
- On the reality of the quantum state
- Local Distinguishability of Multipartite Orthogonal Quantum States
- Quantum State Discrimination
- Quantum state discrimination and its applications
- Is the quantum state real? An extended review of -ontology theorems
- Nonlocality, Asymmetry, and Distinguishing Bipartite States
- Distinguishability of the Bell states
- A quantitative theory of coherent delocalization
- Local indistinguishability and LOCC monotones
- Local indistinguishability: more nonlocality with less entanglement
- Optimal local discrimination of two multipartite pure states
- Quantum Digital Signatures without quantum memory
- Bipartite subspaces having no LOCC-distinguishable bases
- Qudit versions of the qubit "pi-over-eight" gate
- Conditions for compatibility of quantum state assignments
- One-Shot Operational Quantum Resource Theory
- Certification and Quantification of Multilevel Quantum Coherence
- Conclusive Exclusion of Quantum States
- Convex ordering and quantification of quantumness
- On the Optimality of Square Root Measurements in Quantum State Discrimination
- Exact Identification of a Quantum Change Point
- Communication tasks with infinite quantum-classical separation
- Imperfect 1-out-of-2 quantum oblivious transfer: bounds, a protocol, and its experimental implementation
- Antidistinguishability of Pure Quantum States
- Quantum Advantage in Information Retrieval
- Communication of partial ignorance with qubits
- Noncontextuality Inequalities from Antidistinguishability
- Simple Communication Complexity Separation from Quantum State Antidistinguishability
- On the optimal error exponents for classical and quantum antidistinguishability
- Deterministic transformations of multilevel coherent states under incoherence-preserving operations
- Necessary and sufficient optimality conditions for classical simulations of quantum communication processes
- Transformations between symmetric sets of quantum states
- A note on the inner products of pure states and their antidistinguishability
- The minimum rank problem for circulants
- Absolutely -Incoherent Quantum States and Spectral Inequalities for Factor Width of a Matrix
Cited by in corpus (8)
- Single-shot Distinguishability and Anti-distinguishability of Quantum Measurements
- How contextuality and antidistinguishability are related
- Failure of epistemic models to explain the antidistinguishability of quantum mixed preparations
- Quantum state exclusion for group-generated ensembles of pure states
- Quantum description of reality is epistemically incomplete
- Limits of Classical correlations and Quantum advantages under (Anti-)Distinguishability constraints in Multipartite Communication
- Random Exclusion Codes: Quantum Advantages of Single-Shot Communication
- Single-shot antidistinguishability of unitary operations