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:1804.10457 · Journal of Physics A Mathematical and Theoretical

Antidistinguishability of pure quantum states

Teiko Heinosaari, Oskari Kerppo

Published Jul 9, 2018• 37 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/1751-8121/aad1fc

Related papers

Simpler proof of the theorem by Pusey, Barrett, and Rudolph on the reality of the quantum state

Christopher G. Moseley

The theorem of Pusey, Barrett, and Rudolph proves that different quantum states describe different physical realities. Their proof is based on the construction of entanglement measurement bases of two, and more than two qbits. In this note, I show that a two-qubit entanglement base is sufficient for a general proof.

arXiv:1401.0026•Dec 30, 2013•5 citations

Ontology without states: PBR as an argument for dynamics-first realism

Nick Ormrod

The Pusey--Barrett--Rudolph (PBR) theorem is commonly taken to establish that a pure quantum state represents a physical property of the system to which it is assigned, rather than merely encoding knowledge. In this work, I distinguish between state-first and dynamics-first physical theories, and argue that this reading presupposes the former. These two types of theories support different approaches to causal explanation, and one of PBR's stated assumptions depends on the state-first approach. Using a recent interpretation of quantum theory as a concrete example, I show how a dynamics-first theory can explain the PBR correlations while maintaining a broadly epistemic reading of quantum states. I conclude that the PBR theorem supports a dilemma: either the quantum state is part of reality, or reality is not fundamentally built out of states.

quant-pharXiv:2610.37948•Oct 29, 2026•0 citations

Ontological Models and Contextuality

Oskari Kerppo

The main question under investigation in this thesis was the reality of the quantum state. We approached this problem by studying a recent no-go result by Pusey, Barrett and Rudolph, namely the PBR theorem. In Section 1 we provided a short introduction to quantum theory. A few relevant examples were covered, namely decompositions of quantum states, impossibility of the ignorance interpretation and the distinguishability of pure quantum states. Section 2 developed measure theoretic tools needed in the framework of ontological models. The Radon-Nikodym theorem was proven in order to justify the use of an alternative expression of the variational distance of probability measures. In Section 3 we developed a general framework for ontological models. In short, the ontological models framework can be considered the most general framework currently available for hidden variable theories and no-go results. We used the measure theoretic tools of Section 2 to make the formalism rigorous. Original research included in Section 3 was the characterization of a property called antidistinguishability for qubit states. A necessary and sufficient condition for antidistinguishability was given. It was then proven that any set of pure qubit states that is not antidistinguishable can be made antidistinguishable by adding a single carefully chosen state into the set. In the end of Section 3, some original observations were presented. Namely, a specific connection with contextuality was proven for sometimes ψ-ontic and never ψ-ontic ontological models. However, it was then noted that these observations were not enough to exclude never ψ-ontic ontological models, a feat that would have provided a new no-go theorem on its own. Contextuality in the ontological models framework was studied in Section 4. The main results were establishing preparation contextuality from the failure of maximal ψ-epistemicity and a proof of Bell's theorem based on preparation contextuality established this way. We concluded that ψ-ontic models cannot be Bell local based on these results. Finally in Section 5 the implications of ψ-ontology were discussed. By careful analysis of the results, it was noted that accepting the reality of the quantum state exposes explanatory gaps in the formalism. Possible solutions to the challenges introduced by these explanatory gaps were discussed through interpretations of quantum mechanics and the so-called measurement problem.

•Oct 17, 2017•0 citations

Tight bounds for antidistinguishability and circulant sets of pure quantum states

Nathaniel Johnston, Vincent Russo, Jamie Sikora

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 .

arXiv:2311.17047•Quantum•Feb 4, 2025•22 citations

The measure of PBR's reality

Natalia Sánchez-Kuntz, Eduardo Nahmad-Achar

We review the Pusey-Barret-Rudolph (PBR) theorem\cite{PBR} and their setup, and arrive to the conclusion that the reality of a quantum state $ψ$ is intrinsically attached to the measurement the system described by $ψ$ has undergone. We show that a state that has not been measured can be regarded as pure information, while a state that has been measured has to be regarded as a physical property of a certain system, having a counterpart in reality. This demonstration implies that the statement of PBR's theorem changes in a meaningful way.

arXiv:1810.11072•Oct 25, 2018•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•17 citations
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.
The Pusey--Barrett--Rudolph (PBR) theorem is commonly taken to establish that a pure quantum state represents a physical property of the system to which it is assigned, rather than merely encoding knowledge. In this work, I distinguish between state-first and dynamics-first physical theories, and argue that this reading presupposes the former. These two types of theories support different approaches to causal explanation, and one of PBR's stated assumptions depends on the state-first approach. Using a recent interpretation of quantum theory as a concrete example, I show how a dynamics-first theory can explain the PBR correlations while maintaining a broadly epistemic reading of quantum states. I conclude that the PBR theorem supports a dilemma: either the quantum state is part of reality, or reality is not fundamentally built out of states.
The main question under investigation in this thesis was the reality of the quantum state. We approached this problem by studying a recent no-go result by Pusey, Barrett and Rudolph, namely the PBR theorem. In Section 1 we provided a short introduction to quantum theory. A few relevant examples were covered, namely decompositions of quantum states, impossibility of the ignorance interpretation and the distinguishability of pure quantum states. Section 2 developed measure theoretic tools needed in the framework of ontological models. The Radon-Nikodym theorem was proven in order to justify the use of an alternative expression of the variational distance of probability measures. In Section 3 we developed a general framework for ontological models. In short, the ontological models framework can be considered the most general framework currently available for hidden variable theories and no-go results. We used the measure theoretic tools of Section 2 to make the formalism rigorous. Original research included in Section 3 was the characterization of a property called antidistinguishability for qubit states. A necessary and sufficient condition for antidistinguishability was given. It was then proven that any set of pure qubit states that is not antidistinguishable can be made antidistinguishable by adding a single carefully chosen state into the set. In the end of Section 3, some original observations were presented. Namely, a specific connection with contextuality was proven for sometimes ψ-ontic and never ψ-ontic ontological models. However, it was then noted that these observations were not enough to exclude never ψ-ontic ontological models, a feat that would have provided a new no-go theorem on its own. Contextuality in the ontological models framework was studied in Section 4. The main results were establishing preparation contextuality from the failure of maximal ψ-epistemicity and a proof of Bell's theorem based on preparation contextuality established this way. We concluded that ψ-ontic models cannot be Bell local based on these results. Finally in Section 5 the implications of ψ-ontology were discussed. By careful analysis of the results, it was noted that accepting the reality of the quantum state exposes explanatory gaps in the formalism. Possible solutions to the challenges introduced by these explanatory gaps were discussed through interpretations of quantum mechanics and the so-called measurement problem.
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 .
We review the Pusey-Barret-Rudolph (PBR) theorem\cite{PBR} and their setup, and arrive to the conclusion that the reality of a quantum state ψψψ is intrinsically attached to the measurement the system described by ψψψ has undergone. We show that a state that has not been measured can be regarded as pure information, while a state that has been measured has to be regarded as a physical property of a certain system, having a counterpart in reality. This demonstration implies that the statement of PBR's theorem changes in a meaningful way.