Minimum-error discrimination of quantum states: New bounds and comparison
Daowen Qiu, Lvjun Li

TL;DR
This paper introduces a new lower bound for the minimum-error probability in quantum state discrimination, compares it with existing bounds, and explores the differences between two-state and multi-state discrimination.
Contribution
It derives a novel lower bound for ambiguous discrimination among multiple quantum states and analyzes its optimality and relation to unambiguous discrimination.
Findings
The new bound can be optimal in some cases.
The relationship between unambiguous and ambiguous discrimination does not extend beyond two states.
Examples illustrate the theoretical results.
Abstract
The minimum-error probability of ambiguous discrimination for two quantum states is the well-known {\it Helstrom limit} presented in 1976. Since then, it has been thought of as an intractable problem to obtain the minimum-error probability for ambiguously discriminating arbitrary quantum states. In this paper, we obtain a new lower bound on the minimum-error probability for ambiguous discrimination and compare this bound with six other bounds in the literature. Moreover, we show that the bound between ambiguous and unambiguous discrimination does not extend to ensembles of more than two states. Specifically, the main technical contributions are described as follows: (1) We derive a new lower bound on the minimum-error probability for ambiguous discrimination among arbitrary mixed quantum states with given prior probabilities, and we present a necessary and sufficient condition…
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.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
