Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2311.17047 · Quantum

Tight bounds for antidistinguishability and circulant sets of pure quantum states

Nathaniel Johnston, Vincent Russo, Jamie Sikora

Published Feb 4, 2025• 10 citations
arXivHTMLPDF

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 n pure states is equivalent to a property of its Gram matrix called ( n − 1 ) -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 ( n − 2 ) / ( 2 n − 2 ) then the set must be antidistinguishable, and we show that this bound is tight when n ≤ 4 . We also give a simpler proof that if all the inner products are strictly larger than ( n − 2 ) / ( n − 1 ) , then the set cannot be antidistinguishable, and we show that this bound is tight for all n .

DOI
10.22331/q-2025-02-04-1622

Related papers

Sharp bounds for perfect quantum state classification beyond antidistinguishability

Nathaniel Johnston, Benjamin Lovitz, Vincent Russo +1 more

A multiset of pure quantum states is said to be k-learnable if there is a measurement strategy that always narrows an unknown sample drawn from the list down to one of at most k candidates. The parameter k interpolates between distinguishability and antidistinguishability, and provides a unified framework for partial state identification. We prove two universal, and optimal, Gram-matrix criteria for k-learnability: a Frobenius-norm sufficient condition and an entrywise-$\ell_1$ necessary condition. We apply them to derive explicit learnability and copy-complexity guarantees for several well-known sets of states including SIC-POVMs, mutually unbiased bases, and stabilizer states. We further apply our results to zero-error mutation detection problems such as anomaly detection and changepoint detection.

quant-pharXiv:2609.17411•Sep 16, 2026•0 citations

Inner products of pure states and their antidistinguishability

Vincent Russo, Jamie Sikora

A set of d quantum states is said to be antidistinguishable if there exists a d-outcome POVM that can perfectly identify which state was not measured. A conjecture by Havlíček and Barrett states that if a set of d pure states has small pair-wise inner products, then the set must be antidistinguishable. In this note we provide a certificate of antidistinguishability via semidefinite programming duality and use it to provide a counterexample to this conjecture when d = 4.

arXiv:2206.08313•Physical Review A•Mar 27, 2023•8 citations

Antidistinguishability of states in General Probabilistic Theories

Satyaki Manna, Anandamay Das Bhowmik

We investigate antidistinguishability of states within the framework of general probabilistic theories (GPTs). We formulate antidistinguishability, strong and equal antidistinguishability as refined notions that imposed additional constraint on the measurement effects. We establish general results relating these notions of antidistinguishability and derive an upper bound on the cardinality of equally antidistinguishable sets in terms of the affine dimension of the state space. We then study antidistinguishability in polygonal theories, obtaining conditions for antidistinguishability of a set of states. In consequence, we show that the set of all pure states in a polygon model is antidistinguishable. Additionally, we identify broad families of strongly and equally antidistinguishable states. Finally, using Random Exclusion Codes, whose success probability is governed by the antidistinguishability of different sets of encoding states, we probe the nonclassicality of polygon theories. We find that certain polygon models can outperform the optimal quantum value, while their optimal performance converges to the quantum limit in the large-polygon limit.

quant-pharXiv:2609.17498•Sep 16, 2026•0 citations

Antidistinguishability of pure quantum states

Teiko Heinosaari, Oskari Kerppo

Abstract The Pusey–Barrett–Rudolph theorem has recently provoked a lot of discussion regarding the reality of the quantum state. In this article we focus on a property called antidistinguishability, which is a main component in constructing the proof for the PBR theorem. In particular we study algebraic conditions for a set of pure quantum states to be antidistinguishable, and a novel sufficient condition is presented. We also discuss a more general criterion which can be used to show that the sufficient condition is not necessary. Lastly, we consider how many quantum states needs to be added into a set of pure quantum states in order to make the set antidistinguishable. It is shown that in the case of qubit states the answer is one, while in the general but finite dimensional case the answer is at most n , where n is the size of the original set.

arXiv:1804.10457•Journal of Physics A Mathematical and Theoretical•Jul 9, 2018•29 citations

Local state antimarking : Nonlocality without entanglement

Biswadeep Chatterjee, Tathagata Gupta, Pratik Ghosal +1 more

A set of quantum states is said to be antidistinguishable if, upon being given a randomly chosen state from the set, it is possible to exclude with certainty a state that was definitely not prepared. We study quantum nonlocality within the framework of local state exclusion and prove that any set of multipartite pure states containing a state that is orthogonal to all the others is locally antidistinguishable. Next, we introduce the task of $\textit{local state antimarking}$, where, instead of a single state, a non-repetitive sequence of states from a known set of multipartite states is randomly selected and distributed to spatially separated parties, whose objective is to identify, using LOCC, at least one sequence that was not supplied. We present an ensemble of product states that is not globally antidistinguishable; yet, by choosing states from it without replacement, one can construct sequences that can be perfectly excluded globally but, importantly, not locally. This reveals a hitherto unexplored form of `nonlocality without entanglement'. Finally, for a given ensemble, we compare its local antidistinguishability and antimarkability with its conclusive local distinguishability and markability. We demonstrate that no strict hierarchy exists between these paradigms: there exist product-state ensembles that permit one task while strictly forbidding the other, and vice versa.

quant-pharXiv:2605.09710•May 12, 2026•0 citations

How Contextuality and Antidistinguishability Are Related

Maiyuren Srikumar, Stephen D. Bartlett, Angela Karanjai

Contextuality is a key characteristic that separates quantum from classical phenomena and an important tool in understanding the potential advantage of quantum computation. However, when assessing the quantum resources available for quantum information processing, there is no formalism to determine whether a set of states can exhibit contextuality and whether such proofs of contextuality indicate anything about the resourcefulness of that set. Introducing a well-motivated notion of what it means for a set of states to be contextual, we establish a relationship between contextuality and antidistinguishability of sets of states. We go beyond the traditional notions of contextuality and antidistinguishability and treat both properties as resources, demonstrating that the degree of contextuality within a set of states has a direct connection to its level of antidistinguishability. If a set of states is contextual, then it must be weakly antidistinguishable and vice versa. However, critical contextuality emerges as a stronger property than traditional antidistinguishability.

arXiv:2411.09919•Physical Review Letters•Feb 2, 2026•1 citation
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 n pure states is equivalent to a property of its Gram matrix called ( n − 1 ) -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 ( n − 2 ) / ( 2 n − 2 ) then the set must be antidistinguishable, and we show that this bound is tight when n ≤ 4 . We also give a simpler proof that if all the inner products are strictly larger than ( n − 2 ) / ( n − 1 ) , then the set cannot be antidistinguishable, and we show that this bound is tight for all n .
A multiset of pure quantum states is said to be k-learnable if there is a measurement strategy that always narrows an unknown sample drawn from the list down to one of at most k candidates. The parameter k interpolates between distinguishability and antidistinguishability, and provides a unified framework for partial state identification. We prove two universal, and optimal, Gram-matrix criteria for k-learnability: a Frobenius-norm sufficient condition and an entrywise-ℓ1\ell_1ℓ1​ necessary condition. We apply them to derive explicit learnability and copy-complexity guarantees for several well-known sets of states including SIC-POVMs, mutually unbiased bases, and stabilizer states. We further apply our results to zero-error mutation detection problems such as anomaly detection and changepoint detection.
We investigate antidistinguishability of states within the framework of general probabilistic theories (GPTs). We formulate antidistinguishability, strong and equal antidistinguishability as refined notions that imposed additional constraint on the measurement effects. We establish general results relating these notions of antidistinguishability and derive an upper bound on the cardinality of equally antidistinguishable sets in terms of the affine dimension of the state space. We then study antidistinguishability in polygonal theories, obtaining conditions for antidistinguishability of a set of states. In consequence, we show that the set of all pure states in a polygon model is antidistinguishable. Additionally, we identify broad families of strongly and equally antidistinguishable states. Finally, using Random Exclusion Codes, whose success probability is governed by the antidistinguishability of different sets of encoding states, we probe the nonclassicality of polygon theories. We find that certain polygon models can outperform the optimal quantum value, while their optimal performance converges to the quantum limit in the large-polygon limit.
Abstract The Pusey–Barrett–Rudolph theorem has recently provoked a lot of discussion regarding the reality of the quantum state. In this article we focus on a property called antidistinguishability, which is a main component in constructing the proof for the PBR theorem. In particular we study algebraic conditions for a set of pure quantum states to be antidistinguishable, and a novel sufficient condition is presented. We also discuss a more general criterion which can be used to show that the sufficient condition is not necessary. Lastly, we consider how many quantum states needs to be added into a set of pure quantum states in order to make the set antidistinguishable. It is shown that in the case of qubit states the answer is one, while in the general but finite dimensional case the answer is at most n , where n is the size of the original set.
A set of quantum states is said to be antidistinguishable if, upon being given a randomly chosen state from the set, it is possible to exclude with certainty a state that was definitely not prepared. We study quantum nonlocality within the framework of local state exclusion and prove that any set of multipartite pure states containing a state that is orthogonal to all the others is locally antidistinguishable. Next, we introduce the task of local state antimarking\textit{local state antimarking}local state antimarking, where, instead of a single state, a non-repetitive sequence of states from a known set of multipartite states is randomly selected and distributed to spatially separated parties, whose objective is to identify, using LOCC, at least one sequence that was not supplied. We present an ensemble of product states that is not globally antidistinguishable; yet, by choosing states from it without replacement, one can construct sequences that can be perfectly excluded globally but, importantly, not locally. This reveals a hitherto unexplored form of `nonlocality without entanglement'. Finally, for a given ensemble, we compare its local antidistinguishability and antimarkability with its conclusive local distinguishability and markability. We demonstrate that no strict hierarchy exists between these paradigms: there exist product-state ensembles that permit one task while strictly forbidding the other, and vice versa.
Contextuality is a key characteristic that separates quantum from classical phenomena and an important tool in understanding the potential advantage of quantum computation. However, when assessing the quantum resources available for quantum information processing, there is no formalism to determine whether a set of states can exhibit contextuality and whether such proofs of contextuality indicate anything about the resourcefulness of that set. Introducing a well-motivated notion of what it means for a set of states to be contextual, we establish a relationship between contextuality and antidistinguishability of sets of states. We go beyond the traditional notions of contextuality and antidistinguishability and treat both properties as resources, demonstrating that the degree of contextuality within a set of states has a direct connection to its level of antidistinguishability. If a set of states is contextual, then it must be weakly antidistinguishable and vice versa. However, critical contextuality emerges as a stronger property than traditional antidistinguishability.