Entropic lower bound for distinguishability of quantum states
Seungho Yang, Jinhyoung Lee, Hyunseok Jeong

TL;DR
This paper introduces an entropic lower bound on the success probability of distinguishing quantum states, linking von Neumann entropy to state distinguishability, and requires only the density operator for pure states.
Contribution
It provides a new entropy-based lower bound for quantum state distinguishability that is easy to compute for pure states.
Findings
The bound relates von Neumann entropy to distinguishability success probability.
For pure states, only the density operator and number of states are needed.
The bound offers a fundamental limit on quantum state discrimination.
Abstract
For a system randomly prepared in a number of quantum states, we present a lower bound for the distinguishability of the quantum states, that is, the success probability of determining the states in the form of entropy. When the states are all pure, acquiring the entropic lower bound requires only the density operator and the number of the possible states. This entropic bound shows a relation between the von Neumann entropy and the distinguishability.
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.
