Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0609136

Optimal discrimination of mixed states: the quantum Chernoff bound

John Calsamiglia, Lluís Masanes, R. Muñoz-Tapia, Antonio Acín, E. Bagán

Published Sep 18, 2006• 1 citation
arXivHTMLPDF

Abstract

This paper has been withdrawn by the authors, due to a flaw in the proof of Theorem 1. This preprint is superseded by quant-ph/0610027, where a correct proof can be found. Thanks to Rainer Siegmund-Schultze for spotting the error.
DOI
10.48550/arxiv.quant-ph/0609136

Related papers

Discriminating States: The Quantum Chernoff Bound

K. M. R. Audenaert, John Calsamiglia, R. Muñoz-Tapia +4 more

We consider the problem of discriminating two different quantum states in the setting of asymptotically many copies, and determine the minimal probability of error. This leads to the identification of the quantum Chernoff bound, thereby solving a long-standing open problem. The bound reduces to the classical Chernoff bound when the quantum states under consideration commute. The quantum Chernoff bound is the natural symmetric distance measure between quantum states because of its clear operational meaning and because it does not seem to share some of the undesirable features of other distance measures.

arXiv:quant-ph/0610027•Physical Review Letters•Apr 17, 2007•561 citations

Optimality of the Heisenberg limit for continuous-variable quantum metrology

Marcin Zwierz, Carlos A. Pérez-Delgado, Pieter Kok

This paper has been withdrawn by the authors due to a fatal flaw in the central proof.

arXiv:1004.1990•Apr 12, 2010•2 citations

Computable bounds for the discrimination of Gaussian states

Stefano Pirandola, Seth Lloyd

By combining the Minkowski inequality and the quantum Chernoff bound, we derive easy-to-compute upper bounds for the error probability affecting the optimal discrimination of Gaussian states. In particular, these bounds are useful when the Gaussian states are unitarily inequivalent, i.e., they differ in their symplectic invariants.

arXiv:0806.1625•Physical Review A•Jul 17, 2008•146 citations

The space of local equivalence classes of mixed two-qubit states

Anthony Sudbery

This paper is withdrawn by the author. It is superseded by Makhlin's paper quant-ph/0002045.

arXiv:quant-ph/0001115•Jan 31, 2000•2 citations

MINIMUM-ERROR DISCRIMINATION AMONG MIXED QUANTUM STATES

Chih‐Lung Chou

We review the problem of discriminating with minimum error among mixed quantum states, with emphasize on the analytically solved quantum ensembles.

•Oct 1, 2005•0 citations

MINIMUM-ERROR DISCRIMINATION AMONG MIXED QUANTUM STATES

Chih‐Lung Chou

We review the problem of discriminating with minimum error among mixed quantum states, with emphasize on the analytically solved quantum ensembles.

International Journal of Quantum Information•Nov 1, 2005•0 citations
We consider the problem of discriminating two different quantum states in the setting of asymptotically many copies, and determine the minimal probability of error. This leads to the identification of the quantum Chernoff bound, thereby solving a long-standing open problem. The bound reduces to the classical Chernoff bound when the quantum states under consideration commute. The quantum Chernoff bound is the natural symmetric distance measure between quantum states because of its clear operational meaning and because it does not seem to share some of the undesirable features of other distance measures.