Answers are grounded in this paper and cite their sources.
We study the antidistinguishability problem, which is a fundamental task in quantum computing. A set of d quantum states is said to be antidistinguishable if there exists a d-outcome positive-operator-valued measure that can perfectly identify which state was not measured. We revisit a conjecture by Havlíçek and Barrett which states that if a set of d pure states has small pairwise inner products, then the set must be antidistinguishable. We develop a certificate of antidistinguishability via semidefinite programming duality and use it to provide a counterexample to this conjecture when d=4. Our work thus opens up again the investigation into which sets of pure states are antidistinguishable.Received 12 September 2022Accepted 6 March 2023DOI:https://doi.org/10.1103/PhysRevA.107.
No takes yet. Share an insight, caveat, or question.
Russo et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: