- Physical Review Journals
All JournalsPhysics Magazine

Physical Review Research

Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Letter
  • Open Access

Recursive quantum eigenvalue and singular-value transformation: Analytic construction of matrix sign function by Newton iteration

Kaoru Mizuta1,2,* and Keisuke Fujii3,4,1,5

  • 1RIKEN Center for Quantum Computing (RQC), Hirosawa 2-1, Wako, Saitama 351-0198, Japan
  • 2Department of Applied Physics, The University of Tokyo, Hongo 7-3-1, Bunkyo, Tokyo 113-8656, Japan
  • 3Graduate School of Engineering Science, Osaka University, 1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan
  • 4Center for Quantum Information and Quantum Biology, Osaka University, 1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan
  • 5Fujitsu Quantum Computing Joint Research Division at QIQB, Osaka University, 1-2 Machikaneyama, Toyonaka 560-0043, Japan

  • *mizuta@qi.t.u-tokyo.ac.jp
PDF

Phys. Rev. Research 6, L012007 – Published 12 January, 2024

DOI: https://doi.org/10.1103/PhysRevResearch.6.L012007

Abstract

Quantum eigenvalue transformation (QET) and its generalization, quantum singular value transformation (QSVT), are versatile quantum algorithms that allow us to apply broad matrix functions to quantum states, which cover many significant quantum algorithms such as Hamiltonian simulation. However, finding a parameter set which realizes preferable matrix functions in these techniques is difficult for large-scale quantum systems: there is no analytical result other than trivial cases as far as we know and we often suffer also from numerical instability. In this Letter, we propose recursive QET or QSVT (R-QET or R-QSVT) in which we can execute complicated matrix functions by recursively organizing block-encoding by low-degree QET or QSVT. Owing to the simplicity of recursive relations, it works only with a few parameters with exactly determining the parameters, while its iteration results in complicated matrix functions. In particular, by exploiting the recursive relation of Newton iteration, we construct the matrix sign function, which can be applied for eigenstate filtering for example, in a tractable way. We show that an analytically obtained parameter set composed of only eight different values is sufficient for executing QET of the matrix sign function with an arbitrarily small error ɛ. Our protocol will serve as an alternative protocol for constructing QET or QSVT for some useful matrix functions without numerical instability.

View figure in article

Physics Subject Headings (PhySH)

Article Text

Supplemental Material

References (27)

  1. 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 2019 (Association for Computing Machinery, New York, NY, USA, 2019), pp. 193–204.
  2. G. H. Low and I. L. Chuang, Optimal Hamiltonian simulation by quantum signal processing, Phys. Rev. Lett. 118, 010501 (2017).
  3. G. H. Low and I. L. Chuang, Hamiltonian simulation by qubitization, Quantum 3, 163 (2019).
  4. L. K. Grover, Quantum mechanics helps in searching for a needle in a Haystack, Phys. Rev. Lett. 79, 325 (1997).
  5. J. M. Martyn, Z. M. Rossi, A. K. Tan, and I. L. Chuang, Grand unification of quantum algorithms, PRX Quantum 2, 040203 (2021).
  6. J. Haah, Product decomposition of periodic functions in quantum signal processing, Quantum 3, 190 (2019).
  7. R. Chao, D. Ding, A. Gilyen, C. Huang, and M. Szegedy, Finding Angles for Quantum Signal Processing with Machine Precision, arXiv:2003.02831 [quant-ph] (2020).
  8. Y. Dong, X. Meng, K. B. Whaley, and L. Lin, Efficient phase-factor evaluation in quantum signal processing, Phys. Rev. A 103, 042419 (2021).
  9. J. Wang, Y. Dong, and L. Lin, On the energy landscape of symmetric quantum signal processing, Quantum 6, 850 (2022).
  10. P. Høyer, Arbitrary phases in quantum amplitude amplification, Phys. Rev. A 62, 052304 (2000).
  11. G. L. Long, Grover algorithm with zero theoretical failure rate, Phys. Rev. A 64, 022307 (2001).
  12. N. J. Higham, Functions of Matrices (Society for Industrial and Applied Mathematics, 2008).
  13. G. H. Low and I. L. Chuang, Hamiltonian simulation by uniform spectral amplification, arXiv:1707.05391 [quant-ph] (2017).
  14. L. Lin and Y. Tong, Near-optimal ground state preparation, Quantum 4, 372 (2020).
  15. A. K. Tan, Y. Liu, M. C. Tran, and I. L. Chuang, Error Correction of Quantum Algorithms: Arbitrarily Accurate Recovery of Noisy Quantum Signal Processing, arXiv:2301.08542 [quant-ph] (2023).
  16. Z. Navickas, R. Smidtaite, A. Vainoras, and M. Ragulskis, The logistic map of matrices, Discrete Continuous Dyn. Syst. Ser. B 16, 927 (2011).
  17. Łukasz Pawela and K. Życzkowski, Matrix logistic map: fractal spectral distributions and transfer of chaos (2023), arXiv:2303.06176.
  18. A. M. Childs, R. Kothari, and R. D. Somma, Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision, SIAM J. Comput. 46, 1920 (2017).
  19. Z. M. Rossi and I. L. Chuang, Multivariable quantum signal processing (m-QSP): Prophecies of the two-headed oracle, Quantum 6, 811 (2022).
  20. Y. Borns-Weil, T. Saffat, and Z. Stier, A Quantum Algorithm for Functions of Multiple Commuting Hermitian Matrices, arXiv:2302.11139 [quant-ph] (2023).
  21. L. Lin and Y. Tong, Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems, Quantum 4, 361 (2020).
  22. C. Kenney and A. J. Laub, Rational Iterative Methods for the Matrix Sign Function, SIAM J. Matrix Anal. Appl. 12, 273 (1991).
  23. See Supplemental Materials at http://link.aps.org/supplemental/10.1103/PhysRevResearch.6.L012007. It includes the detailed way of computing the parameters in QET/QSVT (S1) and the detailed construction of the R-QSVT (S2). We also discuss some potential applications of the marix sign function by R-QET (S3) and some other recursive relations available in R-QET/R-QSVT (S4).
  24. Exactly speaking, we were not able to find proof of the latter part of the condition (ii) for generic even l, |pl(x)|≥1 for any x∉[−1,1], although it seems to be correct from their graphs. By computing the derivatives of pl(x) at x=±1, we have proven that pl(x) is compatible with the standard QET at least up to l=103. While we believe that the exponent νl [See Eq. (19)] can be arbitrarily small under l→∞, it is ensured to reach ν103≃0.100 at the present stage.
  25. Y. Dong, L. Lin, and Y. Tong, Ground-State Preparation and Energy Estimation on Early Fault-Tolerant Quantum Computers via Quantum Eigenvalue Transformation of Unitary Matrices, PRX Quantum 3, 040305 (2022).
  26. T. de Lima Silva, L. Borges, and L. Aolita, Fourier-based quantum signal processing, arXiv:2206.02826 [quant-ph] (2022).
  27. X. Wang, Y. Wang, Z. Yu, and L. Zhang, Quantum Phase Processing: Transform and Extract Eigen-Information of Quantum Systems, arXiv:2209.14278 [quant-ph] (2022).

Outline

Information

Phys. Rev. Research 6, L012007– Published 12 January, 2024
  • Received 12 May 2023
  • Accepted 6 November 2023
Crossmark - Check for updates button
Creative Commons Logo

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Published by the American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation