{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T01:05:33Z","timestamp":1774659933987,"version":"3.50.1"},"reference-count":14,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T00:00:00Z","timestamp":1666224000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"<jats:p>This paper proposes a new factorization algorithm for computing the phase factors of quantum signal processing. The proposed algorithm avoids root finding of high degree polynomials by using a key step of Prony&amp;apos;s method and is numerically stable in the double precision arithmetics. Experimental results are reported for Hamiltonian simulation, eigenstate filtering, matrix inversion, and Fermi-Dirac operator.<\/jats:p>","DOI":"10.22331\/q-2022-10-20-842","type":"journal-article","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T13:48:36Z","timestamp":1666273716000},"page":"842","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":21,"title":["Stable factorization for phase factors of quantum signal processing"],"prefix":"10.22331","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1547-1457","authenticated-orcid":false,"given":"Lexing","family":"Ying","sequence":"first","affiliation":[{"name":"Department of Mathematics, Stanford University, Stanford, CA 94305, USA"}]}],"member":"9598","published-online":{"date-parts":[[2022,10,20]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"R. Chao, D. Ding, A. Gilyen, C. Huang, and M. Szegedy. Finding angles for quantum signal processing with machine precision. arXiv preprint arXiv:2003.02831, 2020. doi:10.48550\/ARXIV.2003.02831.","DOI":"10.48550\/ARXIV.2003.02831"},{"key":"1","doi-asserted-by":"publisher","unstructured":"A. M. Childs, R. Kothari, and R. D. Somma. Quantum algorithm for systems of linear equations with exponentially improved dependence on precision. SIAM Journal on Computing, 46(6):1920\u20131950, 2017. doi:10.1137\/16M1087072.","DOI":"10.1137\/16M1087072"},{"key":"2","doi-asserted-by":"publisher","unstructured":"A. M. Childs, D. Maslov, Y. Nam, N. J. Ross, and Y. Su. Toward the first quantum simulation with quantum speedup. Proceedings of the National Academy of Sciences, 115(38):9456\u20139461, 2018. doi:10.1073\/pnas.1801723115.","DOI":"10.1073\/pnas.1801723115"},{"key":"3","doi-asserted-by":"publisher","unstructured":"Y. Dong, X. Meng, K. B. Whaley, and L. Lin. Efficient phase-factor evaluation in quantum signal processing. Physical Review A, 103(4):042419, 2021. doi:10.1103\/PhysRevA.103.042419.","DOI":"10.1103\/PhysRevA.103.042419"},{"key":"4","doi-asserted-by":"publisher","unstructured":"A. Gily\u00e9n, Y. Su, G. H. Low, and N. Wiebe. Quantum singular value transformation and beyond: Exponential improvements for quantum matrix arithmetics. arXiv preprint arXiv:1806.01838, 2018. doi:10.48550\/arXiv.1806.01838.","DOI":"10.48550\/arXiv.1806.01838"},{"key":"5","doi-asserted-by":"publisher","unstructured":"A. Gily\u00e9n, 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, pages 193\u2013204, 2019. doi:10.1145\/3313276.3316366.","DOI":"10.1145\/3313276.3316366"},{"key":"6","doi-asserted-by":"publisher","unstructured":"J. Haah. Product decomposition of periodic functions in quantum signal processing. Quantum, 3:190, 2019. doi:10.22331\/q-2019-10-07-190.","DOI":"10.22331\/q-2019-10-07-190"},{"key":"7","doi-asserted-by":"publisher","unstructured":"L. Lin. Lecture notes on quantum algorithms for scientific computation. arXiv preprint arXiv:2201.08309, 2022. doi:10.48550\/arXiv.2201.08309.","DOI":"10.48550\/arXiv.2201.08309"},{"key":"8","doi-asserted-by":"publisher","unstructured":"G. H. Low and I. L. Chuang. Optimal hamiltonian simulation by quantum signal processing. Physical review letters, 118(1):010501, 2017. doi:10.1103\/PhysRevLett.118.010501.","DOI":"10.1103\/PhysRevLett.118.010501"},{"key":"9","doi-asserted-by":"publisher","unstructured":"J. M. Martyn, Z. M. Rossi, A. K. Tan, and I. L. Chuang. Grand unification of quantum algorithms. PRX Quantum, 2(4):040203, 2021. doi:10.1103\/PRXQuantum.2.040203.","DOI":"10.1103\/PRXQuantum.2.040203"},{"key":"10","doi-asserted-by":"publisher","unstructured":"D. Potts and M. Tasche. Parameter estimation for nonincreasing exponential sums by Prony-like methods. Linear Algebra and its Applications, 439(4):1024\u20131039, 2013. doi:10.1016\/j.laa.2012.10.036.","DOI":"10.1016\/j.laa.2012.10.036"},{"key":"11","unstructured":"R. Prony. Essai experimental et analytique. J. Ecole Polytechnique, pages 24\u201376, 1795."},{"key":"12","doi-asserted-by":"publisher","unstructured":"J. Van Apeldoorn, A. Gily\u00e9n, S. Gribling, and R. de Wolf. Quantum SDP-solvers: Better upper and lower bounds. Quantum, 4:230, 2020. doi:10.22331\/q-2020-02-14-230.","DOI":"10.22331\/q-2020-02-14-230"},{"key":"13","doi-asserted-by":"publisher","unstructured":"J. Wang, Y. Dong, and L. Lin. On the energy landscape of symmetric quantum signal processing. arXiv preprint arXiv:2110.04993, 2021. doi:10.48550\/arXiv.2110.04993.","DOI":"10.48550\/arXiv.2110.04993"}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2022-10-20-842\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T13:48:40Z","timestamp":1666273720000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2022-10-20-842\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,20]]},"references-count":14,"URL":"https:\/\/doi.org\/10.22331\/q-2022-10-20-842","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,20]]},"article-number":"842"}}