arXiv:1306.4683 · Physical Review A

Conclusive exclusion of quantum states

Somshubhro Bandyopadhyay, Rahul Jain, Jonathan Oppenheim, Christopher Perry

Published Feb 25, 2014• 75 citations

Abstract

In the task of quantum state exclusion, we consider a quantum system prepared in a state chosen from a known set. The aim is to perform a measurement on the system which can conclusively rule that a subset of the possible preparation procedures cannot have taken place. We ask what conditions the set of states must obey in order for this to be possible and how well we can complete the task when it is not. The task of quantum state discrimination forms a subclass of this set of problems. Within this paper, we formulate the general problem as a semidefinite program (SDP), enabling us to derive sufficient and necessary conditions for a measurement to be optimal. Furthermore, we obtain a necessary condition on the set of states for exclusion to be achievable with certainty, and we give a construction for a lower bound on the probability of error. This task of conclusively excluding states has gained importance in the context of the foundations of quantum mechanics due to a result from Pusey, Barrett, and Rudolph (PBR). Motivated by this, we use our SDP to derive a bound on how well a class of hidden variable models can perform at a particular task, proving an analog of Tsirelson's bound for the PBR experiment and the optimality of a measurement given by PBR in the process. We also introduce variations of conclusive exclusion, including unambiguous state exclusion, and state exclusion with worst-case error.

DOI: 10.1103/physreva.89.022336

Related papers

Relations Between State Discrimination and State Exclusion

Jun Chen, Xiaoyan Qiao

Abstract Consider a quantum system prepared in a state chosen from a known set, the aim of quantum state discrimination is to perform a measurement on the system which can determine that a subset of the possible preparation procedures have been prepared. However, the aim of quantum state exclusion is to perform a measurement on the system which can conclusively rule that a subset of the possible preparation procedures have not taken place. For classical states, probabilities of error in discrimination and exclusion are always equal. For quantum states, we point out that probabilities of error in discrimination and exclusion are still equal in two-state ensembles, however they are no longer equal in multiple-state ensembles. More specifically, the error-probability of discrimination is not less than the error-probability of exclusion. We also show that the error-probability of exclusion is continuous which is similar with the error-probability of discrimination.

International Journal of Theoretical PhysicsAug 4, 20230 citations

A semidefinite programming approach to optimal unambiguous discrimination of quantum states

Yonina C. Eldar

We consider the problem of unambiguous discrimination between a set of linearly independent pure quantum states. We show that the design of the optimal measurement that minimizes the probability of an inconclusive result can be formulated as a semidefinite programming problem. Based on this formulation, we develop a set of necessary and sufficient conditions for an optimal quantum measurement. We show that the optimal measurement can be computed very efficiently in polynomial time by exploiting the many well-known algorithms for solving semidefinite programs, which are guaranteed to converge to the global optimum. Using the general conditions for optimality, we derive necessary and sufficient conditions so that the measurement that results in an equal probability of an inconclusive result for each one of the quantum states is optimal. We refer to this measurement as the equal-probability measurement (EPM). We then show that for any state set, the prior probabilities of the states can be chosen such that the EPM is optimal. Finally, we consider state sets with strong symmetry properties and equal prior probabilities for which the EPM is optimal. We first consider geometrically uniform (GU) state sets that are defined over a group of unitary matrices and are generated by a single generating vector. We then consider compound GU state sets which are generated by a group of unitary matrices using multiple generating vectors, where the generating vectors satisfy a certain (weighted) norm constraint.

arXiv:quant-ph/0206093IEEE Transactions on Information TheoryFeb 1, 2003120 citations

Conclusive exclusion of quantum states with group action

Hongshun Yao, Xin Wang

Retrieving classical information from quantum systems is central to quantum information processing. As a more general task than quantum state discrimination, which focuses on identifying the exact state, quantum state exclusion only requires ruling out options, revealing fundamental limits of information extraction from quantum systems. In this work, we study the conclusive exclusion of quantum states generated by group actions, establishing explicit criteria for when such exclusion is possible. For systems with complex symmetries, including finite and compact Lie groups, we derive a sufficient condition for conclusive exclusion based on the initial state's amplitudes and the group's structure. As applications to special groups such as Abelian groups, we establish necessary and sufficient conditions for conclusive state exclusion and generalize the Pusey-Barrett-Rudolph result to a wider range of scenarios. Finally, we explore zero-error communication via conclusive exclusion of quantum states and derive a lower bound on the feedback-assisted and non-signalling-assisted zero-error capacity of classical-quantum channels generated by group actions.

arXiv:2503.04605Physical Review ANov 14, 20250 citations

A contextual advantage for conclusive exclusion: repurposing the Pusey-Barrett-Rudolph construction

Yìlè Yīng, David Schmid, Robert W. Spekkens

The task of conclusive exclusion for a set of quantum states is to find a measurement such that for each state in the set, there is an outcome that allows one to conclude with certainty that the state in question was not prepared. Defining classicality of statistics as realizability by a generalized-noncontextual ontological model, we show that there is a quantum-over-classical advantage for how well one can achieve conclusive exclusion. This is achieved in an experimental scenario motivated by the construction appearing in the Pusey-Barrett-Rudolph theorem. We derive noise-robust noncontextuality inequalities bounding the conclusiveness of exclusion, and describe a quantum violation of these. Finally, we show that this bound also constitutes a classical causal compatibility inequality within the bilocality scenario, and that its violation in quantum theory yields a novel possibilistic proof of a quantum-classical gap in that scenario.

quant-pharXiv:2512.04173Dec 5, 20250 citations

Quantum state exclusion for group-generated ensembles of pure states

A. Diebra, S. Llorens, E. Bagán +2 more

Quantum state exclusion is the task of determining which states from a given set a system was not prepared in. We provide a complete solution to optimal quantum state exclusion for arbitrary sets of pure states generated by finite groups, establishing necessary and sufficient conditions for perfect (zero-error conclusive) exclusion. When perfect exclusion is impossible, we introduce two natural extensions: minimum-error and unambiguous exclusion. For both, we derive the optimal protocols and present analytical expressions for the corresponding failure probabilities and measurements, providing additional insight into how quantum states encode information.

arXiv:2503.02568Physical Review ResearchNov 23, 20251 citation

A Semidefinite Programming Approach to Optimal Unambiguous Discrimination of Quantum States

Yonina C. Eldar

Abstract—In this paper, we consider the problem of unambiguous discrimination between a set of linearly independent pure quantum states. We show that the design of the optimal measurement that minimizes the probability of an inconclusive result can be formulated as a semidefinite programming problem. Based on this formulation, we develop a set of necessary and sufficient conditions for an optimal quantum measurement. We show that the optimal measurement can be computed very efficiently in polynomial time by exploiting the many well-known algorithms for solving semidefinite programs, which are guaranteed to converge to the global optimum. Using the general conditions for optimality, we derive necessary and sufficient conditions so that the measurement that results in an equal probability of an inconclusive result for each one of the quantum states is optimal. We refer to this measurement as the equal-probability measurement (EPM). We then show that for any state set, the prior probabilities of the states can be chosen such that the EPM is optimal. Finally, we consider state sets with strong symmetry properties and equal prior probabilities for which the EPM is optimal. We first consider geometrically uniform (GU) state sets that are defined over a group of unitary matrices and are generated by a single generating vector. We then consider compound GU state sets which are generated by a group of unitary matrices using multiple generating vectors, where the generating vectors satisfy a certain (weighted) norm constraint. Index Terms—Compound geometrically uniform (CGU) quantum states, equal-probability measurement (EPM), geometrically uniform (GU) quantum states, quantum detection, semidefinite programming, unambiguous discrimination. I.

Jun 14, 200283 citations