Quantum linear system algorithm with optimal queries to initial state preparation
1Azure Quantum, Microsoft, Redmond, WA 98052, USA
2Google Quantum AI, Venice, CA 90291, USA
3AWS Center for Quantum Computing, Pasadena, CA 91106, USA
| Published: | 2026-03-23, volume 10, page 2041 |
| Editor: | Jin-Peng Liu |
| Eprint: | arXiv:2410.18178v2 |
| Doi: | https://doi.org/10.22331/q-2026-03-23-2041 |
| Citation: | Quantum 10, 2041 (2026). |
Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.
Abstract
Quantum algorithms for linear systems produce the solution state $A^{-1}|b\rangle$ by querying two oracles: $O_A$ that block encodes the coefficient matrix and $O_b$ that prepares the initial state. We present a quantum linear system algorithm making $\mathbf{\Theta}\left(1/\sqrt{p}\right)$ queries to $O_b$, which is optimal in the success probability, and $\mathbf{O}\left(\kappa\log\left(1/p\right)\left(\log\log\left(1/p\right)+\log\left({1}/{\epsilon}\right)\right)\right)$ queries to $O_A$, nearly optimal in all parameters including the condition number and accuracy. Notably, our complexity scaling of initial state preparation holds even when $p$ is not known $\textit{a priori}$. This contrasts with recent results achieving $\mathbf{O}\left(\kappa\log\left({1}/{\epsilon}\right)\right)$ complexity to both oracles, which, while optimal in $O_A$, is highly suboptimal in $O_b$ as $\kappa$ can be arbitrarily larger than $1/\sqrt{p}$. In various applications such as solving differential equations, preparing ground states of operators with real spectra, and estimating and transforming eigenvalues of non-normal matrices, we can further improve the dependence on $p$ using a block preconditioning scheme to nearly match or outperform best previous results based on other methods, which also furnishes an extremely simple quantum linear system algorithm with an optimal query complexity to $O_A$. Underlying our results is a new Variable Time Amplitude Amplification algorithm with Tunable thresholds (Tunable VTAA), which fully characterizes generic nested amplitude amplifications, improves the $\ell_1$-norm input cost scaling of Ambainis to an $\ell_{\frac{2}{3}}$-quasinorm scaling, and admits a deterministic amplification schedule for the quantum linear system problem.
Featured image: Illustration of the transition of amplitudes in a variable time amplitude amplification.
Popular summary
In this work, we present two new quantum linear system solvers, the first achieving an optimal number of queries to initial state preparation using a deterministic amplification schedule, and the second reaching optimal dependence on the coefficient block encoding via a block preconditioning technique.
Together, these results offer a remarkably simple approach to the quantum linear system problem, sharpening applications to differential equations and eigenvalue processing.
► BibTeX data
► References
[1] Abhijeet Alase and Salini Karuvade, Resolvent-based quantum phase estimation: Towards estimation of parametrized eigenvalues, 2024, arXiv:2410.04837, DOI: 10.48550/arXiv.2410.04837.
https://doi.org/10.48550/arXiv.2410.04837
arXiv:arXiv:2410.04837
[2] Andris Ambainis, Variable time amplitude amplification and quantum algorithms for linear algebra problems, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012), vol. 14, pp. 636–647, 2012, arXiv:1010.4458, DOI: 10.4230/LIPIcs.STACS.2012.636.
https://doi.org/10.4230/LIPIcs.STACS.2012.636
arXiv:arXiv:1010.4458
[3] Andris Ambainis, Martins Kokainis, and Jevgēnijs Vihrovs, Improved algorithm and lower bound for variable time quantum search, 18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023), vol. 266, pp. 7:1–7:18, 2023, arXiv:2302.06749, DOI: 10.4230/LIPIcs.TQC.2023.7.
https://doi.org/10.4230/LIPIcs.TQC.2023.7
arXiv:arXiv:2302.06749
[4] Dong An, Andrew M. Childs, and Lin Lin, Quantum algorithm for linear non-unitary dynamics with near-optimal dependence on all parameters, Communications in Mathematical Physics 407 (2025), no. 1, 19, arXiv:2312.03916, DOI: 10.1007/s00220-025-05509-w.
https://doi.org/10.1007/s00220-025-05509-w
arXiv:arXiv:2312.03916
[5] Dong An and Lin Lin, Quantum linear system solver based on time-optimal adiabatic quantum computing and quantum approximate optimization algorithm, ACM Transactions on Quantum Computing 3 (2022), 1–28, arXiv:1909.05500, DOI: 10.1145/3498331.
https://doi.org/10.1145/3498331
arXiv:arXiv:1909.05500
[6] Yuto Ashida, Zongping Gong, and Masahito Ueda, Non-Hermitian physics, Advances in Physics 69 (2020), no. 3, 249–435, arXiv:2006.01837, DOI: 10.1080/00018732.2021.1876991.
https://doi.org/10.1080/00018732.2021.1876991
arXiv:arXiv:2006.01837
[7] Carl M. Bender, Dorje C. Brody, Hugh F. Jones, and Bernhard K. Meister, Faster than Hermitian quantum mechanics, Physical Review Letters 98 (2007), 040403, arXiv:quant-ph/0609032, DOI: 10.1103/PhysRevLett.98.040403.
https://doi.org/10.1103/PhysRevLett.98.040403
arXiv:arXiv:quant-ph/0609032
[8] Dominic W. Berry and Pedro C. S. Costa, Quantum algorithm for time-dependent differential equations using Dyson series, Quantum 8 (2024), 1369, arXiv:2212.03544, DOI: 10.22331/q-2024-06-13-1369.
https://doi.org/10.22331/q-2024-06-13-1369
arXiv:arXiv:2212.03544
[9] Dominic W. Berry, Andrew M. Childs, Aaron Ostrander, and Guoming Wang, Quantum algorithm for linear differential equations with exponentially improved dependence on precision, Communications in Mathematical Physics 356 (2017), 1057–1081, arXiv:1701.03684, DOI: 10.1007/s00220-017-3002-y.
https://doi.org/10.1007/s00220-017-3002-y
arXiv:arXiv:1701.03684
[10] Dominic W. Berry, Yu Tong, Tanuj Khattar, Alec White, Tae In Kim, Guang Hao Low, Sergio Boixo, Zhiyan Ding, Lin Lin, Seunghoon Lee, Garnet Kin-Lic Chan, Ryan Babbush, and Nicholas C. Rubin, Rapid initial-state preparation for the quantum simulation of strongly correlated molecules, PRX Quantum 6 (2025), 020327, arXiv:2409.11748, DOI: 10.1103/PRXQuantum.6.020327.
https://doi.org/10.1103/PRXQuantum.6.020327
arXiv:arXiv:2409.11748
[11] Gilles Brassard, Peter Hoyer, Michele Mosca, and Alain Tapp, Quantum amplitude amplification and estimation, Contemporary Mathematics 305 (2002), 53–74, arXiv:quant-ph/0005055, DOI: 10.1090/conm/305/05215.
https://doi.org/10.1090/conm/305/05215
arXiv:arXiv:quant-ph/0005055
[12] Shantanav Chakraborty, András Gilyén, and Stacey Jeffery, The power of block-encoded matrix powers: Improved regression techniques via faster Hamiltonian simulation, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), vol. 132, pp. 33:1–33:14, 2019, arXiv:1804.01973, DOI: 10.4230/LIPIcs.ICALP.2019.33.
https://doi.org/10.4230/LIPIcs.ICALP.2019.33
arXiv:arXiv:1804.01973
[13] Shantanav Chakraborty, Aditya Morolia, and Anurudh Peduri, Quantum regularized least squares, Quantum 7 (2023), 988, arXiv:2206.13143, DOI: 10.22331/q-2023-04-27-988.
https://doi.org/10.22331/q-2023-04-27-988
arXiv:arXiv:2206.13143
[14] Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, and Ronald de Wolf, Symmetry and quantum query-to-communication simulation, 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), vol. 219, pp. 20:1–20:23, 2022, arXiv:2012.05233, DOI: 10.4230/LIPIcs.STACS.2022.20.
https://doi.org/10.4230/LIPIcs.STACS.2022.20
arXiv:arXiv:2012.05233
[15] Andrew M. Childs, Robin Kothari, and Rolando D. Somma, Quantum algorithm for systems of linear equations with exponentially improved dependence on precision, SIAM Journal on Computing 46 (2017), 1920–1950, arXiv:1511.02306, DOI: 10.1137/16M1087072.
https://doi.org/10.1137/16M1087072
arXiv:arXiv:1511.02306
[16] B. D. Clader, B. C. Jacobs, and C. R. Sprouse, Preconditioned quantum linear system algorithm, Physical Review Letters 110 (2013), 250504, arXiv:1301.2340, DOI: 10.1103/PhysRevLett.110.250504.
https://doi.org/10.1103/PhysRevLett.110.250504
arXiv:arXiv:1301.2340
[17] Keith Conrad, $L^p$-spaces for $0<p<1$, 2019, https://kconrad.math.uconn.edu/blurbs/analysis/lpspace.pdf, Last accessed on 2024-10-14.
https://kconrad.math.uconn.edu/blurbs/analysis/lpspace.pdf
[18] Pedro C.S. Costa, Dong An, Ryan Babbush, and Dominic Berry, The discrete adiabatic quantum linear system solver has lower constant factors than the randomized adiabatic solver, Quantum 9 (2025), 1887, arXiv:2312.07690, DOI: 10.22331/q-2025-10-20-1887.
https://doi.org/10.22331/q-2025-10-20-1887
arXiv:arXiv:2312.07690
[19] Pedro C.S. Costa, Dong An, Yuval R. Sanders, Yuan Su, Ryan Babbush, and Dominic W. Berry, Optimal scaling quantum linear-systems solver via discrete adiabatic theorem, PRX Quantum 3 (2022), 040303, arXiv:2111.08152, DOI: 10.1103/PRXQuantum.3.040303.
https://doi.org/10.1103/PRXQuantum.3.040303
arXiv:arXiv:2111.08152
[20] Alexander M. Dalzell, A shortcut to an optimal quantum linear system solver, 2024, arXiv:2406.12086, DOI: 10.48550/arXiv.2406.12086.
https://doi.org/10.48550/arXiv.2406.12086
arXiv:arXiv:2406.12086
[21] Di Fang, Lin Lin, and Yu Tong, Time-marching based quantum solvers for time-dependent linear differential equations, Quantum 7 (2023), 955, arXiv:2208.06941, DOI: 10.22331/q-2023-03-20-955.
https://doi.org/10.22331/q-2023-03-20-955
arXiv:arXiv:2208.06941
[22] Yimin Ge, Jordi Tura, and J. Ignacio Cirac, Faster ground state preparation and high-precision ground energy estimation with fewer qubits, Journal of Mathematical Physics 60 (2019), no. 2, 022202, arXiv:1712.03193, DOI: 10.1063/1.5027484.
https://doi.org/10.1063/1.5027484
arXiv:arXiv:1712.03193
[23] András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 193–204, 2019, arXiv:1806.01838, DOI: 10.1145/3313276.3316366.
https://doi.org/10.1145/3313276.3316366
arXiv:arXiv:1806.01838
[24] Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone, Quantum metrology, Physical Review Letters 96 (2006), 010401, arXiv:quant-ph/0509179, DOI: 10.1103/PhysRevLett.96.010401.
https://doi.org/10.1103/PhysRevLett.96.010401
arXiv:arXiv:quant-ph/0509179
[25] Lov K. Grover, A fast quantum mechanical algorithm for database search, Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, p. 212–219, 1996, arXiv:quant-ph/9605043, DOI: 10.1145/237814.237866.
https://doi.org/10.1145/237814.237866
arXiv:arXiv:quant-ph/9605043
[26] Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd, Quantum algorithm for linear systems of equations, Physical Review Letters 103 (2009), 150502, arXiv:0811.3171, DOI: 10.1103/PhysRevLett.103.150502.
https://doi.org/10.1103/PhysRevLett.103.150502
arXiv:arXiv:0811.3171
[27] Roger A. Horn and Charles R. Johnson, Matrix analysis, Cambridge University Press, 2012, DOI: 10.1017/CBO9781139020411.
https://doi.org/10.1017/CBO9781139020411
[28] Peter Høyer, Michele Mosca, and Ronald de Wolf, Quantum search on bounded-error inputs, Automata, Languages and Programming, pp. 291–299, 2003, arXiv:quant-ph/0304052, DOI: 10.1007/3-540-45061-0_25.
https://doi.org/10.1007/3-540-45061-0_25
arXiv:arXiv:quant-ph/0304052
[29] Martin Idel, A review of matrix scaling and Sinkhorn's normal form for matrices and positive maps, 2016, arXiv:1609.06349, DOI: 10.48550/arXiv.1609.06349.
https://doi.org/10.48550/arXiv.1609.06349
arXiv:arXiv:1609.06349
[30] Richard V Kadison and John R Ringrose, Fundamentals of the theory of operator algebras. volume i: Elementary theory, Academic press New York, 1983, DOI: 10.1007/978-1-4612-2968-1.
https://doi.org/10.1007/978-1-4612-2968-1
[31] Iordanis Kerenidis and Anupam Prakash, Quantum recommendation systems, 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), vol. 67, pp. 49:1–49:21, 2017, arXiv:1603.08675, DOI: 10.4230/LIPIcs.ITCS.2017.49.
https://doi.org/10.4230/LIPIcs.ITCS.2017.49
arXiv:arXiv:1603.08675
[32] Erwin Kreyszig, Introductory functional analysis with applications, vol. 17, John Wiley & Sons, 1991.
[33] Hari Krovi, Improved quantum algorithms for linear and nonlinear differential equations, Quantum 7 (2023), 913, arXiv:2202.01054, DOI: 10.22331/q-2023-02-02-913.
https://doi.org/10.22331/q-2023-02-02-913
arXiv:arXiv:2202.01054
[34] Joonho Lee, Dominic W. Berry, Craig Gidney, William J. Huggins, Jarrod R. McClean, Nathan Wiebe, and Ryan Babbush, Even more efficient quantum computations of chemistry through tensor hypercontraction, PRX Quantum 2 (2021), 030305, arXiv:2011.03494, DOI: 10.1103/PRXQuantum.2.030305.
https://doi.org/10.1103/PRXQuantum.2.030305
arXiv:arXiv:2011.03494
[35] Lin Lin and Yu Tong, Near-optimal ground state preparation, Quantum 4 (2020), 372, arXiv:2002.12508, DOI: 10.22331/q-2020-12-14-372.
https://doi.org/10.22331/q-2020-12-14-372
arXiv:arXiv:2002.12508
[36] Lin Lin and Yu Tong, Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems, Quantum 4 (2020), 361, arXiv:1910.14596, DOI: 10.22331/q-2020-11-11-361.
https://doi.org/10.22331/q-2020-11-11-361
arXiv:arXiv:1910.14596
[37] Guang Hao Low and Isaac L. Chuang, Hamiltonian simulation by uniform spectral amplification, 2017, arXiv:1707.05391, DOI: 10.48550/arXiv.1707.05391.
https://doi.org/10.48550/arXiv.1707.05391
arXiv:arXiv:1707.05391
[38] Guang Hao Low and Isaac L. Chuang, Optimal Hamiltonian simulation by quantum signal processing, Physical Review Letters 118 (2017), 010501, arXiv:1606.02685, DOI: 10.1103/PhysRevLett.118.010501.
https://doi.org/10.1103/PhysRevLett.118.010501
arXiv:arXiv:1606.02685
[39] Guang Hao Low and Isaac L. Chuang, Hamiltonian simulation by qubitization, Quantum 3 (2019), 163, arXiv:1610.06546, DOI: doi.org/10.22331/q-2019-07-12-163.
https://doi.org/10.22331/q-2019-07-12-163
arXiv:arXiv:1610.06546
[40] Guang Hao Low and Yuan Su, Quantum eigenvalue processing, SIAM Journal on Computing 55 (2026), no. 1, 135–215, arXiv:2401.06240, DOI: 10.1137/24M1689363.
https://doi.org/10.1137/24M1689363
arXiv:arXiv:2401.06240
[41] Guang Hao Low, Theodore J. Yoder, and Isaac L. Chuang, Methodology of resonant equiangular composite quantum gates, Physical Review X 6 (2016), 041067, arXiv:1603.03996, DOI: 10.1103/PhysRevX.6.041067.
https://doi.org/10.1103/PhysRevX.6.041067
arXiv:arXiv:1603.03996
[42] John M. Martyn, Zane M. Rossi, Andrew K. Tan, and Isaac L. Chuang, Grand unification of quantum algorithms, PRX Quantum 2 (2021), 040203, arXiv:2105.02859, DOI: 10.1103/PRXQuantum.2.040203.
https://doi.org/10.1103/PRXQuantum.2.040203
arXiv:arXiv:2105.02859
[43] Sam McArdle and David P. Tew, Improving the accuracy of quantum computational chemistry using the transcorrelated method, 2020, arXiv:2006.11181, DOI: 10.48550/arXiv.2006.11181.
https://doi.org/10.48550/arXiv.2006.11181
arXiv:arXiv:2006.11181
[44] David Poulin and Pawel Wocjan, Preparing ground states of quantum many-body systems on a quantum computer, Physical Review Letters 102 (2009), 130503, arXiv:0809.2705, DOI: 10.1103/PhysRevLett.102.130503.
https://doi.org/10.1103/PhysRevLett.102.130503
arXiv:arXiv:0809.2705
[45] Matt Rosenzweig, $L^p$ spaces for $0<p<1$, 2012, https://matthewhr.wordpress.com/wp-content/uploads/2012/09/lp-spaces-for-p-in-01.pdf, Last accessed on 2024-10-14.
https://matthewhr.wordpress.com/wp-content/uploads/2012/09/lp-spaces-for-p-in-01.pdf
[46] Artur Scherer, Benoı̂t Valiron, Siun-Chuon Mau, Scott Alexander, Eric van den Berg, and Thomas E. Chapuran, Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target, Quantum Information Processing 16 (2017), no. 3, 60, arXiv:1505.06552, DOI: 10.1007/s11128-016-1495-5.
https://doi.org/10.1007/s11128-016-1495-5
arXiv:arXiv:1505.06552
[47] André Schrottenloher and Marc Stevens, Quantum procedures for nested search problems, IACR Communications in Cryptology 1 (2024), no. 3, 1–39, DOI: 10.62056/aee0fhbmo.
https://doi.org/10.62056/aee0fhbmo
[48] Changpeng Shao, Computing eigenvalues of diagonalizable matrices in a quantum computer, 2019, arXiv:1912.08015, DOI: 10.48550/arXiv.1912.08015.
https://doi.org/10.48550/arXiv.1912.08015
arXiv:arXiv:1912.08015
[49] Changpeng Shao and Jin-Peng Liu, Solving generalized eigenvalue problems by ordinary differential equations on a quantum computer, 2020, arXiv:2010.15027, DOI: 10.48550/arXiv.2010.15027.
https://doi.org/10.48550/arXiv.2010.15027
arXiv:arXiv:2010.15027
[50] Changpeng Shao and Hua Xiang, Quantum circulant preconditioner for a linear system of equations, Physical Review A 98 (2018), 062321, arXiv:1807.04563, DOI: 10.1103/PhysRevA.98.062321.
https://doi.org/10.1103/PhysRevA.98.062321
arXiv:arXiv:1807.04563
[51] Peter W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Journal on Computing 26 (1997), 1484–1509, arXiv:quant-ph/9508027, DOI: 10.1137/S0097539795293172.
https://doi.org/10.1137/S0097539795293172
arXiv:arXiv:quant-ph/9508027
[52] Rolando D. Somma and Yiğit Subaşı, Complexity of quantum state verification in the quantum linear systems problem, PRX Quantum 2 (2021), 010315, arXiv:2007.15698, DOI: 10.1103/PRXQuantum.2.010315.
https://doi.org/10.1103/PRXQuantum.2.010315
arXiv:arXiv:2007.15698
[53] J Michael Steele, The Cauchy-Schwarz master class: an introduction to the art of mathematical inequalities, Cambridge University Press, 2004, DOI: 10.1017/CBO9780511817106.
https://doi.org/10.1017/CBO9780511817106
[54] Yiğit Subaşı, Rolando D. Somma, and Davide Orsucci, Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing, Physical Review Letters 122 (2019), 060504, arXiv:1805.10549, DOI: 10.1103/PhysRevLett.122.060504.
https://doi.org/10.1103/PhysRevLett.122.060504
arXiv:arXiv:1805.10549
[55] Souichi Takahira, Asuka Ohashi, Tomohiro Sogabe, and Tsuyoshi S. Usuda, Quantum algorithm for matrix functions by Cauchy's integral formula, Quantum Information and Computation 20 (2020), 14–36, arXiv:2106.08075, DOI: 10.26421/QIC20.1-2-2.
https://doi.org/10.26421/QIC20.1-2-2
arXiv:arXiv:2106.08075
[56] Souichi Takahira, Asuka Ohashi, Tomohiro Sogabe, and Tsuyoshi Sasaki Usuda, Quantum algorithms based on the block-encoding framework for matrix functions by contour integrals, 2021, arXiv:2106.08076, DOI: 10.48550/arXiv.2106.08076.
https://doi.org/10.48550/arXiv.2106.08076
arXiv:arXiv:2106.08076
[57] Yu Tong, Dong An, Nathan Wiebe, and Lin Lin, Fast inversion, preconditioned quantum linear system solvers, fast Green's-function computation, and fast evaluation of matrix functions, Physical Review A 104 (2021), 032422, arXiv:2008.13295, DOI: 10.1103/PhysRevA.104.032422.
https://doi.org/10.1103/PhysRevA.104.032422
arXiv:arXiv:2008.13295
[58] Vera von Burg, Guang Hao Low, Thomas Häner, Damian S. Steiger, Markus Reiher, Martin Roetteler, and Matthias Troyer, Quantum computing enhanced computational catalysis, Physical Review Research 3 (2021), 033055, arXiv:2007.14460, DOI: 10.1103/PhysRevResearch.3.033055.
https://doi.org/10.1103/PhysRevResearch.3.033055
arXiv:arXiv:2007.14460
[59] Kianna Wan, Mario Berta, and Earl T. Campbell, Randomized quantum algorithm for statistical phase estimation, Physical Review Letters 129 (2022), 030503, arXiv:2110.12071, DOI: 10.1103/PhysRevLett.129.030503.
https://doi.org/10.1103/PhysRevLett.129.030503
arXiv:arXiv:2110.12071
[60] Guoming Wang, Efficient quantum algorithms for analyzing large sparse electrical networks, Quantum Information and Computation 17 (2017), no. 11–12, 987–1026, arXiv:1311.1851, DOI: 10.26421/qic17.11-12-5.
https://doi.org/10.26421/qic17.11-12-5
arXiv:arXiv:1311.1851
[61] Xiao-Ming Zhang, Yukun Zhang, Wenhao He, and Xiao Yuan, Exponential quantum advantages for practical non-Hermitian eigenproblems, Physical Review Letters 135 (2025), 140601, arXiv:2401.12091, DOI: 10.1103/3n8f-k8pl.
https://doi.org/10.1103/3n8f-k8pl
arXiv:arXiv:2401.12091
[62] Marcin Zwierz, Carlos A. Pérez-Delgado, and Pieter Kok, General optimality of the Heisenberg limit for quantum metrology, Physical Review Letters 105 (2010), 180402, arXiv:1004.3944, DOI: 10.1103/PhysRevLett.105.180402.
https://doi.org/10.1103/PhysRevLett.105.180402
arXiv:arXiv:1004.3944
Cited by
[1] Austin Pechan, John Golden, and Daniel O’Malley, "Block encoding of the three-dimensional heterogeneous Poisson equation with application to fracture flow", Physical Review Applied 25 4, 044038 (2026).
[2] Kazuki Sakamoto and Keisuke Fujii, "On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality", Quantum 10, 2182 (2026).
[3] Hitomi Mori, Yuta Kikuchi, Marcello Benedetti, and Matthias Rosenkranz, "Sparsity-dependent complexity lower bound of quantum linear system solvers", Quantum Science and Technology 11 3, 035063 (2026).
[4] Sayaki Matsushita, "Quantum Communication Complexity of Regularized Linear Regression Protocols", IEEE Transactions on Quantum Engineering 7, 3103012 (2026).
[5] David Jennings, Matteo Lostaglio, Sam Pallister, Andrew T. Sornborger, and Yiğit Subașı, "Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs", PRX Quantum 6 4, 040373 (2025).
[6] Mauro E. S. Morales, Lirandë Pira, Philipp Schleich, Kelvin Koor, Pedro C. S. Costa, Dong An, Alán Aspuru-Guzik, Lin Lin, Patrick Rebentrost, and Dominic W. Berry, "Quantum linear system solvers: A survey of algorithms and applications", Reviews of Modern Physics 98 2, 025005 (2026).
[7] Guang Hao Low and Yuan Su, "Quantum Eigenvalue Processing", 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) 68 (2024).
[8] Alexander M. Dalzell, "A shortcut to an optimal quantum linear system solver", arXiv:2406.12086, (2024).
[9] Guang Hao Low and Rolando D. Somma, "Optimal quantum simulation of linear non-unitary dynamics", arXiv:2508.19238, (2025).
[10] Shantanav Chakraborty, Soumyabrata Hazra, Tongyang Li, Changpeng Shao, Xinzhao Wang, and Yuxin Zhang, "Quantum singular value transformation without block encodings: Near-optimal complexity with minimal ancilla", arXiv:2504.02385, (2025).
[11] Ivan Novikau and Ilon Joseph, "Globalizing the Carleman linear embedding method for nonlinear dynamics", arXiv:2510.15715, (2025).
[12] Christopher Kang and Yuan Su, "Quantum matrix arithmetics with Hamiltonian evolution", arXiv:2510.06316, (2025).
[13] Xi-Ning Zhuang, Zhao-Yun Chen, Ming-Yang Tan, Jiaxuan Zhang, Chuang-Chao Ye, Tian-Hao Wei, Teng-Yang Ma, Cheng Xue, Huan-Yu Liu, Qing-Song Li, Tai-Ping Sun, Xiao-Fan Xu, Yun-Jie Wang, Yu-Chun Wu, and Guo-Ping Guo, "A Pathway to Practical Quantum Advantage in Solving Navier-Stokes Equations", arXiv:2509.08807, (2025).
[14] Gengzhi Yang, Akwum Onwunta, and Dong An, "Quantum Differential Equation Solvers with Low State Preparation Cost: Eliminating the Time Dependence in Dissipative Equations", arXiv:2508.15170, (2025).
[15] Robbie King, Guang Hao Low, Ryan Babbush, Rolando D. Somma, and Nicholas C. Rubin, "Quantum Simulation with Sum-of-Squares Spectral Amplification", Physical Review Letters 136 11, 110601 (2026).
[16] Matthias Deiml and Daniel Peterseim, "Nonlinear quantum computation by amplified encodings", arXiv:2411.16435, (2024).
[17] Yunfei Wang, Ruoxi Jiang, Yingda Fan, Xiaowei Jia, Jens Eisert, Junyu Liu, and Jin-Peng Liu, "Towards efficient quantum algorithms for diffusion probabilistic models", arXiv:2502.14252, (2025).
[18] Linyun Cao and Youle Wang, "Quantum kernel method for learning graph data via quantum walk", Physical Review A 112 4, 042408 (2025).
[19] Giuseppe De Riso, Giuseppe Catalano, Seth Lloyd, Vittorio Giovannetti, and Dario De Santis, "A resource-efficient quantum-walker Quantum RAM", arXiv:2508.02855, (2025).
[20] Songqinghao Yang and Jin-Peng Liu, "Circuit-Efficient Randomized Quantum Simulation of Non-Unitary Dynamics with Observable-Driven and Symmetry-Aware Designs", arXiv:2509.08030, (2025).
[21] Zhixin Song, Hang Ren, Melody Lee, Bryan Gard, Nicolas Renaud, and Spencer H. Bryngelson, "Hadamard Random Forest: Reconstructing real-valued quantum states with exponential reduction in measurement settings", arXiv:2505.06455, (2025).
[22] Kazuki Sakamoto and Keisuke Fujii, "On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality", arXiv:2505.10445, (2025).
[23] Jianqiang Li, "A New Quantum Linear System Algorithm Beyond the Condition Number and Its Application to Solving Multivariate Polynomial Systems", arXiv:2510.05588, (2025).
[24] Renaud Vilmart, Sunheang Ty, and Chetra Mang, "Resource-Efficient Synthesis of Sparse Quantum States", arXiv:2508.05386, (2025).
[25] Loïc Balazi, Matthias Deiml, and Daniel Peterseim, "Quantum Enhanced Numerical Homogenization", arXiv:2603.28521, (2026).
[26] Matthias Deiml and Daniel Peterseim, "Constrained Optimal Polynomials for Quantum Linear System Solvers", arXiv:2604.20513, (2026).
[27] Zexian Li, Guofeng Zhang, and Xiao-Ming Zhang, "Reducing C-NOT Counts for State Preparation and Block Encoding via Diagonal Matrix Migration", arXiv:2603.16492, (2026).
[28] Elise Fressart, Michel Nowak, and Nicole Spillane, "Quantum Domain Decomposition for Preconditioning the Finite Element Method", arXiv:2605.26090, (2026).
[29] Alexander M. Dalzell, Jianqiang Li, and Yuan Su, "Faster quantum linear system solver beyond the condition number", arXiv:2607.07691, (2026).
The above citations are from Crossref's cited-by service (last updated successfully 2026-08-08 02:23:51) and SAO/NASA ADS (last updated successfully 2026-08-08 02:23:52). The list may be incomplete as not all publishers provide suitable and complete citation data.
This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions.