Conclusive Exclusion of Quantum States
Somshubhro Bandyopadhyay, Rahul Jain, Jonathan Oppenheim and, Christopher Perry

TL;DR
This paper formulates the quantum state exclusion problem as a Semidefinite Program, deriving conditions for optimal measurements, and explores implications for quantum foundations and hidden variable models.
Contribution
It introduces a general SDP framework for quantum state exclusion, providing necessary and sufficient conditions for optimality and bounds on error probabilities.
Findings
Derived conditions for optimal measurements in quantum state exclusion
Established bounds on the performance of hidden variable models in PBR-related tasks
Proved an analogue of Tsirelson's bound for the PBR experiment
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 can not 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 give a construction for a lower bound on the probability of error. This task of conclusively excluding states has…
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.
