The Quantum Chernoff Bound
K. M. R. Audenaert, J. Calsamiglia, Ll. Masanes, R. Munoz-Tapia, A. Acin, E. Bagan, F. Verstraete
Abstract
We consider the problem of discriminating two different quantum states in the setting of asymptotically many copies, and determine the optimal strategy that minimizes the total 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 of the fact that it does not seem to share the undesirable features of other distance measures like the fidelity, the trace norm and the relative entropy.
Create a lesson
Related papers
Towards unsupervised representation learning for quantum data: quantum models with inference and generation
Robin Lorenz, Eric Brunner, Marcello Benedetti
Spatial correlations of photons interacting via transverse Rydberg blockade
Bankim Chandra Das, Daniil Svirskiy, Matthias Metternich et al.
Generation of multicomponent Schrödinger cat states in schemes with measurement of Gaussian states
E. A. Nesterova, S. B. Korolev
Which Otto Engine Is the Fastest?
Idriss Hank Nkouatchoua Ngueya, Marcin Łobejko
Optimization Landscape Geometry in VQE for Frustrated Quantum Spin Models
Vojtěch Novák, Ivan Zelinka, Swagatam Das et al.
Codes for Quantum Secret Sharing with a Helper
Eric Chitambar, Sarah Hagen, David W. Kribs et al.