Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo–Curlander bounds

We prove a concise factor-of-2 estimate for the failure rate of optimally distinguishing an arbitrary ensemble of mixed quantum states, generalizing work of Holevo [Theor. Probab. Appl. 23, 411 (1978)] and Curlander [Ph.D. Thesis, MIT, 1979]. A modification to the minimal principle of Cocha and Poor [Proceedings of the 6th International Conference on Quantum Communication, Measurement, and Computing (Rinton, Princeton, NJ, 2003)] is used to derive a suboptimal measurement which has an error rate within a factor of 2 of the optimal by construction. This measurement is quadratically weighted and has appeared as the first iterate of a sequence of measurements proposed by Ježek et al. [Phys. Rev. A 65, 060301 (2002)]. Unlike the so-called pretty good measurement, it coincides with Holevo’s asymptotically optimal measurement in the case of nonequiprobable pure states. A quadratically weighted version of the measurement bound by Barnum and Knill [J. Math. Phys. 43, 2097 (2002)] is proven. Bounds on the distingu...

[1]  C. Helstrom.  Quantum detection and estimation theory , 1969 .

[2]  A. Holevo.  Statistical decision theory for quantum systems , 1973 .

[3]  V. Belavkin.  Optimal multiple quantum statistical hypothesis testing , 1975 .

[4]  V. P. Belavkin,et al.  Optimum distinction of non-orthogonal quantum signals , 1975 .

[5]  Robert S. Kennedy,et al.  Optimum testing of multiple hypotheses in quantum detection theory , 1975, IEEE Trans. Inf. Theory.

[6]  A. S. Kholevo.  On Asymptotically Optimal Hypothesis Testing in Quantum Statistics , 1979 .

[7]  Carl W. Helstrom,et al.  Bayes-cost reduction algorithm in quantum hypothesis testing , 1982, IEEE Trans. Inf. Theory.

[8]  V. P. Maslov,et al.  MATHEMATICAL ASPECTS OF COMPUTER ENGINEERING Advances in Science and Technology in the USSR Design of Optimal Dynamic Analyzers: Mathematical Aspects of Wave Pattern Recognition , 1988 .

[9]  Victor Pavlovich Maslov,et al.  Mathematical aspects of computer engineering , 1988 .

[10]  William K. Wootters,et al.  A ‘Pretty Good’ Measurement for Distinguishing Quantum States , 1994 .

[11]  Schumacher,et al.  Classical information capacity of a quantum channel. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[12]  Michael D. Westmoreland,et al.  Sending classical information via noisy quantum channels , 1997 .

[13]  Alexander S. Holevo,et al.  The Capacity of the Quantum Channel with General Signal States , 1996, IEEE Trans. Inf. Theory.

[14]  Tomohiro Ogawa,et al.  Strong converse to the quantum channel coding theorem , 1999, IEEE Trans. Inf. Theory.

[15]  E. Knill,et al.  Reversing quantum dynamics with near-optimal quantum and classical fidelity , 2000, quant-ph/0004088.

[16]  Yonina C. Eldar,et al.  On quantum detection and the square-root measurement , 2001, IEEE Trans. Inf. Theory.

[17]  J. Fiurášek,et al.  Finding optimal strategies for minimum-error quantum-state discrimination , 2002, quant-ph/0201109.

[18]  広田 修,et al.  Proceedings of the sixth International Conference on Quantum Communication, Measurement and Computing , 2003 .

[19]  Yonina C. Eldar,et al.  Designing optimal quantum detectors via semidefinite programming , 2003, IEEE Trans. Inf. Theory.

[20]  Lawrence Ip.  Shor ’ s Algorithm is Optimal , 2003 .

[21]  H. Vincent Poor,et al.  Advances in Quantum Detection , 2003 .

[22]  F. Hansen,et al.  Jensen's Operator Inequality , 2002, math/0204049.

[23]  Jaroslav Rehacek,et al.  Maximum-likelihood methods in quantum mechanics , 2004 .

[24]  A. Kebo.  Quantum Detection and Finite Frames , 2005 .

[25]  Patrick Hayden,et al.  Multiparty data hiding of quantum information , 2005 .

[26]  Dave Bacon,et al.  From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[27]  C. Mochon.  Family of generalized 'pretty good' measurements and the minimal-error pure-state discrimination problems for which they are optimal , 2005, quant-ph/0506061.

[28]  Dave Bacon,et al.  Optimal measurements for the dihedral hidden subgroup problem , 2005, Chic. J. Theor. Comput. Sci..

[29]  Moe Z. Win,et al.  Optimum quantum error recovery using semidefinite programming , 2007 .

[30]  Alexander Russell,et al.  For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets , 2007, Quantum Inf. Comput..

[31]  Andrew S. Fletcher,et al.  Channel-adapted quantum error correction , 2007 .

[32]  Ashley Montanaro.  On the Distinguishability of Random Quantum States , 2007 .

[33]  Andrew M. Childs,et al.  Quantum algorithm for a generalized hidden shift problem , 2005, SODA '07.

[34]  Dave Bacon,et al.  Optimal single-copy measurement for the hidden-subgroup problem , 2007, 0706.4478.

[35]  Moe Z. Win,et al.  Structured near-optimal channel-adapted quantum error correction , 2007, 0708.3658.

[36]  Masahito Hayashi,et al.  Quantum measurements for hidden subgroup problems with optimal sample complexity , 2006, Quantum Inf. Comput..

[37]  Stephen M. Barnett,et al.  On the conditions for discrimination between quantum states with minimum error , 2008, 0810.1919.

[38]  Ashley Montanaro,et al.  A lower bound on the probability of error in quantum state discrimination , 2007, 2008 IEEE Information Theory Workshop.

[39]  Stephanie Wehner,et al.  Cryptography in a quantum world , 2008, 0806.3483.

[40]  Andreas J. Winter,et al.  State Discrimination With Post-Measurement Information , 2008, IEEE Transactions on Information Theory.

[41]  Moe Z. Win,et al.  Channel-Adapted Quantum Error Correction for the Amplitude Damping Channel , 2007, IEEE Transactions on Information Theory.

[42]  Daowen Qiu,et al.  Bounds on the minimum-error discrimination between mixed quantum states , 2008 .

[43]  Daowen Qiu.  Minimum-error discrimination between mixed quantum states , 2007, 0707.3970.

[44]  Robert König,et al.  The Operational Meaning of Min- and Max-Entropy , 2008, IEEE Transactions on Information Theory.

[45]  Jon Tyson.  Estimates of non-optimality of quantum measurements and a simple iterative method for computing optimal measurements , 2009, 0902.0395.

[46]  Jon Tyson.  Error rates of Belavkin weighted quantum measurements and a converse to Holevo's asymptotic optimality theorem , 2009, 0907.1884.

[47]  Minimum-error quantum distinguishability bounds from matrix monotone functions: A comment on “Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo–Curlander bounds” [J. Math. Phys. 50, 032106 (2009)] , 2009 .

[48]  Vijay K. Bhargava.  Communications, Information and Network Security , 2010 .

[49]  Robert L. Kosut,et al.  Channel-Optimized Quantum Error Correction , 2008, IEEE Transactions on Information Theory.