Abstract
We study the antidistinguishability problem, which is a fundamental task in quantum computing. A set of quantum states is said to be antidistinguishable if there exists a -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 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 . Our work thus opens up again the investigation into which sets of pure states are antidistinguishable.
- Received 12 September 2022
- Accepted 6 March 2023
DOI:https://doi.org/10.1103/PhysRevA.107.L030202
©2023 American Physical Society