Error rates of Belavkin weighted quantum measurements and a converse to Holevo's asymptotic optimality theorem
arXiv:0907.1884 · doi:10.1103/PhysRevA.79.032343
Abstract
We compare several instances of pure-state Belavkin weighted square-root measurements from the standpoint of minimum-error discrimination of quantum states. The quadratically weighted measurement is proven superior to the so-called "pretty good measurement" (PGM) in a number of respects: (1) Holevo's quadratic weighting unconditionally outperforms the PGM in the case of two-state ensembles, with equality only in trivial cases. (2) A converse of a theorem of Holevo is proven, showing that a weighted measurement is asymptotically optimal only if it is quadratically weighted. Counterexamples for three states are constructed. The cube-weighted measurement of Ballester, Wehner, and Winter is also considered. Sufficient optimality conditions for various weights are compared.
References in corpus (22)
- The operational meaning of min- and max-entropy
- Reversing quantum dynamics with near-optimal quantum and classical fidelity
- Designing Optimal Quantum Detectors Via Semidefinite Programming
- From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
- Optimum Quantum Error Recovery using Semidefinite Programming
- Finding optimal strategies for minimum-error quantum-state discrimination
- Minimum-error discrimination between mixed quantum states
- Structured Near-Optimal Channel-Adapted Quantum Error Correction
- On the conditions for discrimination between quantum states with minimum error
- Multiparty data hiding of quantum information
- On the distinguishability of random quantum states
- A family of generalized `pretty good' measurements and the minimal-error pure-state discrimination problems for which they are optimal
- State Discrimination with Post-Measurement Information
- Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds
- A lower bound on the probability of error in quantum state discrimination
- Channel-Optimized Quantum Error Correction
- Channel-Adapted Quantum Error Correction
- Cryptography in a Quantum World
- The Optimal Single Copy Measurement for the Hidden Subgroup Problem
- Design of Optimal Dynamic Analyzers: Mathematical Aspects of Wave Pattern Recognition
- Estimates of non-optimality of quantum measurements and a simple iterative method for computing optimal measurements
- Minimum-error discrimination of quantum states: New bounds and comparison
Cited by in corpus (11)
- Sample-optimal tomography of quantum states
- Optimum Unambiguous Discrimination of Linearly Independent Pure States
- Sequential projective measurements for channel decoding
- Achieving the Holevo bound via sequential measurements
- Two-sided bounds on minimum-error quantum measurement, on the reversibility of quantum dynamics, and on the maximum overlap problem using directional iterates
- Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds
- Qubit State Discrimination
- Using post-measurement information in state discrimination
- Simple upper and lower bounds on the ultimate success probability for discriminating arbitrary finite-dimensional quantum processes
- A time-dependent Tsirelson's bound from limits on the rate of information gain in quantum systems
- On the distinguishability of geometrically uniform quantum states