Attainability of quantum state discrimination bounds with collective measurements on finite copies
Lorcan Conlon, Jin Ming Koh, Biveen Shajilal, Jasminder Sidhu, Ping, Koy Lam, and Syed M. Assad

TL;DR
This paper explores the limits of quantum state discrimination using collective measurements on finite copies, providing analytic bounds and conditions for optimal error rates in quantum hypothesis testing.
Contribution
It derives analytic expressions for the Helstrom bound on multiple copies and investigates when finite collective measurements can attain optimal error probabilities.
Findings
Analytic formulas for Helstrom bounds in simple qubit cases.
Finite collective measurements often require all copies to reach optimal error.
Conditions identified for when partial measurements suffice to saturate bounds.
Abstract
One of the fundamental tenets of quantum mechanics is that non-orthogonal states cannot be distinguished perfectly. When distinguishing multiple copies of a mixed quantum state, a collective measurement, which generates entanglement between the different copies of the unknown state, can achieve a lower error probability than non-entangling measurements. The error probability that can be attained using a collective measurement on a finite number of copies of the unknown state is given by the Helstrom bound. In the limit where we can perform a collective measurement on asymptotically many copies of the quantum state, the quantum Chernoff bound gives the attainable error probability. It is natural to ask at what rate does the error tend to this asymptotic limit, and whether the asymptotic limit can be attained for any finite number of copies. In this paper we address these questions. We…
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 Mechanics and Applications · Quantum Information and Cryptography · Quantum Computing Algorithms and Architecture
