A case study against QSVT: assessment of quantum phase estimation improved by signal processing techniques
Abstract: In recent years, quantum algorithms have been proposed which use quantum phase estimation (QPE) coherently as a subroutine without measurement. In order to do this effectively, the routine must be able to distinguish eigenstates with success probability close to unity. In this paper, we provide the first systematic comparison between two approaches towards maximizing this success probability, one using the quantum singular value transform and the other leveraging window functions, which have been previously studied as priors of the phase value distribution. We find that the quantum singular value transform is significantly outclassed by the window function approach, with the latter able to achieve between 3 and 5 orders of magnitude improvement in the success probability with approximately 1/4 the query cost. Our circuit simulation results indicate that QPE is not a domain which benefits from the integration of QSVT and we show that the use of the Kaiser window function is currently the most practical choice for realizing QPE with high success probability.
- R. P. Feynman, Int. J. Theor. Phys. 21, 467–488 (1982).
- P. Shor, in Proceedings 35th Annual Symposium on Foundations of Computer Science (1994) pp. 124–134.
- P. W. Shor, SIAM Journal on Computing 26, 1484 (1997), https://doi.org/10.1137/S0097539795293172 .
- A. Y. Kitaev, “Quantum measurements and the abelian stabilizer problem,” (1995), arXiv:quant-ph/9511026 [quant-ph] .
- D. S. Abrams and S. Lloyd, Phys. Rev. Lett. 83, 5162 (1999).
- C. Gidney, “Factoring with n+2 clean qubits and n-1 dirty qubits,” (2018a), arXiv:1706.07884 [quant-ph] .
- D. Litinski, “How to compute a 256-bit elliptic curve private key with only 50 million toffoli gates,” (2023), arXiv:2306.08585 [quant-ph] .
- P. Rall, Quantum 5, 566 (2021), 2103.09717 .
- M.-H. Yung and A. Aspuru-Guzik, Proceedings of the National Academy of Sciences 109, 754 (2012).
- A. Montanaro, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471, 20150301 (2015).
- A. W. Harrow and A. Y. Wei, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SIAM, 2020) pp. 193–212.
- A. Luis and J. Perina, Physical Review A 54, 4564 (1996).
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, 2010).
- F. Harris, Proceedings of the IEEE 66, 51 (1978).
- J. Haah, Quantum 3, 190 (2019), 1806.10236 .
- L. Ying, Quantum 6, 842 (2022), 2202.02671 .
- Y. Dong, J. Wang, X. Meng, H. Ni, and L. Lin, “QSP Phase Factor Solvers,” https://github.com/qsppack/QSPPACK (2013).
- D. Motlagh and N. Wiebe, “Generalized quantum signal processing,” (2023), arXiv:2308.01501 [quant-ph] .
- G. H. Low and I. L. Chuang, Quantum 3, 163 (2019).
- G. H. Low and I. L. Chuang, Phys. Rev. Lett. 118, 010501 (2017).
- C. Gidney, Quantum 2, 74 (2018b), 1709.06648 .
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.