- Open Access
Quantum estimation of Chernoff bound and Hoeffding bound
Phys. Rev. Research 7, 033245 – Published 12 September, 2025
DOI: https://doi.org/10.1103/blvt-zrww
Abstract
Determining the closeness of two quantum states with minimal error probability is a central problem in quantum information theory. The optimal exponents characterizing the error probability in the symmetric and asymmetric settings are given by the quantum Chernoff bound (QCB) and the quantum Hoeffding bound (QHB), respectively. In this work, we introduce the first algorithms for estimating the QCB and QHB of two unknown states. We propose a unitary encoding for diagonal density matrix based on the copy matrix, which enables unbiased estimation of nonlinear matrix functions via quantum singular value transformation (QSVT). For general density matrices, we combine QSVT with the Hadamard test to estimate both QCB and QHB. Numerical simulations demonstrate that the algorithm converges to the optimal value within a limited number of iterations. Furthermore, we establish the first integration of QSVT with convex optimization, yielding a hybrid quantum-classical framework for quantum estimation.
Physics Subject Headings (PhySH)
Article Text
References (26)
- H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Stat. 23, 493 (1952).
- K. M. Audenaert, J. Calsamiglia, R. Munoz-Tapia, E. Bagan, L. Masanes, A. Acin, and F. Verstraete, Discriminating states: The quantum Chernoff bound, Phys. Rev. Lett. 98, 160501 (2007).
- M. Nussbaum and A. Szkoła, The Chernoff lower bound for symmetric quantum hypothesis testing, Ann. Stat. 37, 1040 (2009).
- J. J. Meyer, S. Khatri, D. S. França, J. Eisert, and P. Faist, Quantum metrology in the finite-sample regime, PRX Quantum 6, 030336 (2025).
- A. Gilyén and A. Poremba, Improved quantum algorithms for fidelity estimation, arXiv:2203.15993.
- M. Cerezo, A. Poremba, L. Cincio, and P. J. Coles, Variational quantum fidelity estimation, Quantum 4, 248 (2020).
- Q. Wang, Z. Zhang, K. Chen, J. Guan, W. Fang, J. Liu, and M. Ying, Quantum algorithm for fidelity estimation, IEEE Trans. Inf. Theory 69, 273 (2022).
- X. Zhang, M. Luo, Z. Wen, Q. Feng, S. Pang, W. Luo, and X. Zhou, Direct fidelity estimation of quantum states using machine learning, Phys. Rev. Lett. 127, 130503 (2021).
- Q. Wang, J. Guan, J. Liu, Z. Zhang, and M. Ying, New quantum algorithms for computing quantum entropies and distances, IEEE Trans. Inf. Theory 70, 5653 (2024).
- Y. Wang, L. Zhang, Z. Yu, and X. Wang, Quantum phase processing and its applications in estimating phase and entropies, Phys. Rev. A 108, 062413 (2023).
- S. Subramanian and M.-H. Hsieh, Quantum algorithm for estimating -Renyi entropies of quantum states, Phys. Rev. A 104, 022428 (2021).
- T. Gur, M.-H. Hsieh, and S. Subramanian, Sublinear quantum algorithms for estimating von Neumann entropy, arXiv:2111.11139.
- Y. Lu and K. Fang, Estimating quantum relative entropies on quantum computers, arXiv:2501.07292.
- R. Chen, Z. Song, X. Zhao, and X. Wang, Variational quantum algorithms for trace distance and fidelity estimation, Quantum Sci. Technol. 7, 015019 (2021).
- Q. Wang and Z. Zhang, Fast quantum algorithms for trace distance estimation, IEEE Trans. Inf. Theory 70, 2720 (2023).
- A. Gilyén, Quantum singular value transformation & its algorithmic applications, Ph.D. thesis, University of Amsterdam, 2019.
- R. S. Dembo, S. C. Eisenstat, and T. Steihaug, Inexact Newton methods, SIAM J. Numer. Anal. 19, 400 (1982).
- V. Vedral, The role of relative entropy in quantum information theory, Rev. Mod. Phys. 74, 197 (2002).
- T. M. Cover, Elements of Information Theory (John Wiley & Sons, Hoboken, NJ, USA, 1999).
- H. Nagaoka, The converse part of the theorem for quantum Hoeffding bound, arXiv:quant-ph/0611289.
- J. van Apeldoorn, A. Cornelissen, A. Gilyén, and G. Nannicini, Quantum tomography using state-preparation unitaries, in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (SIAM, Philadelphia, PA, USA, 2023), pp. 1265–1318.
- G. Brassard, P. Hoyer, M. Mosca, and A. Tapp, Quantum amplitude amplification and estimation, Contemp. Math. 305, 53 (2002).
- A. Gilyén, Y. Su, G. H. Low, and N. Wiebe, Quantum singular value transformation and beyond: Exponential improvements for quantum matrix arithmetics, in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC) (Association for Computing Machinery,New York, NY, USA, 2019), pp. 193–204.
- J. Luo, Q. Wang, and L. Li, Succinct quantum testers for closeness and -wise uniformity of probability distributions, IEEE Trans. Inf. Theory 70, 5092 (2024).
- A. Gilyén and T. Li, Distributional property testing in a quantum world, in 11th Innovations in Theoretical Computer Science Conference (ITCS 2020)(Schloss Dagstuhl–Leibniz-Zentrum für Informatik,Wadern, Germany, 2020), pp. 25:1–25:20.
- R. Bhatia, Matrix Analysis in Graduate Texts in Mathematics (Springer Science & Business Media, New York, NY, USA, 2013), Vol. 169.