The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Quantum Algorithm for Linear Systems of Equations
Open accessAbstract
Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix $A$ and a vector $\stackrel{\ensuremath{\rightarrow}}{b}$, find a vector $\stackrel{\ensuremath{\rightarrow}}{x}$ such that $A\stackrel{\ensuremath{\rightarrow}}{x}=\stackrel{\ensuremath{\rightarrow}}{b}$. We consider the case where one does not need to know the solution $\stackrel{\ensuremath{\rightarrow}}{x}$ itself, but rather an approximation of the expectation value of some operator associated with $\stackrel{\ensuremath{\rightarrow}}{x}$, e.g., ${\stackrel{\ensuremath{\rightarrow}}{x}}^{\ifmmode\dagger\else\textdagger\fi{}}M\stackrel{\ensuremath{\rightarrow}}{x}$ for some matrix $M$. In this case, when $A$ is sparse, $N\ifmmode\times\else\texttimes\fi{}N$ and has condition number $\ensuremath{\kappa}$, the fastest known classical algorithms can find $\stackrel{\ensuremath{\rightarrow}}{x}$ and estimate ${\stackrel{\ensuremath{\rightarrow}}{x}}^{\ifmmode\dagger\else\textdagger\fi{}}M\stackrel{\ensuremath{\rightarrow}}{x}$ in time scaling roughly as $N\sqrt{\ensuremath{\kappa}}$. Here, we exhibit a quantum algorithm for estimating ${\stackrel{\ensuremath{\rightarrow}}{x}}^{\ifmmode\dagger\else\textdagger\fi{}}M\stackrel{\ensuremath{\rightarrow}}{x}$ whose runtime is a polynomial of $\mathrm{log}(N)$ and $\ensuremath{\kappa}$. Indeed, for small values of $\ensuremath{\kappa}$ [i.e., $\mathrm{poly}\mathrm{log}(N)$], we prove (using some common complexity-theoretic assumptions) that any classical algorithm for this problem generically requires exponentially more time than our quantum algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“On the specific applications of this algorithm [75], its use is possible in computational biology, where numeric models can be solved, and also in the domain of machine learning techniques.”
From Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics (2024) · cites this paper as [75]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“As proposed by Harrow etal. [75], the quantum algorithm is capable enough to give solutions to definite linear systems at exponentially rapid speed compared to any existing algorithm.”
From Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics (2024) · cites this paper as [75]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The classical algorithmic complexity for this task scales polynomially in the dimension N , whereas the now-famous Harrow-Hassidim-Lloyd (HHL) quantum algorithm [3] has a complexity that scales logarithmically in N , with some scaling improvements having been proposed [134-137].”
From Variational quantum algorithms (2021) · cites this paper as [3]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“In particular, the task of matrix inversion admits an exponential quantum speedup, which could have many applications.”
From Quantum Computing in the NISQ era and beyond (2018) · cites this paper as [40]
The cited source says what the claim attributes to it.
In the citing paper
“This quantum algorithm runs in time O (log N ) , an exponential speedup relative to classical matrix inversion (for fixed error and for fixed sparsity and condition number of A ).”
From Quantum Computing in the NISQ era and beyond (2018) · cites this paper as [40]
The cited source says what the claim attributes to it.
In the citing paper
“Available pieces of literature reveal the application of quantum algorithms to solve linear [75] and differential equations [76-78], where these algorithms play the role of 'subroutines' in algorithms on data processing.”
From Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics (2024) · cites this paper as [75]
The cited source says what the claim attributes to it.
In the citing paper
“They proved that even though these traditional sampling ones are quick, any traditional algorithm, in general, needs much more time than their [75] algorithm to complete the identical matrix inversion job.”
From Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics (2024) · cites this paper as [75]
The cited source says what the claim attributes to it.
In the citing paper
“This group [75] reported that their algorithm was related to the traditional Monte Carlo ones, which are pretty quick and operate with samples of a statistical distribution involving N objects instead of using all the N constituents of distribution.”
From Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics (2024) · cites this paper as [75]
The cited source says what the claim attributes to it.
In the citing paper
“Recent research trends indicate 'data sets' which are used to define these equations, which can be enormous depending on the specific application [75], where data of the order petabytes could be required to process to get a solution.”
From Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics (2024) · cites this paper as [75]
The cited source says what the claim attributes to it.
In the citing paper
“However, aside from the caveat that the matrix A must be sparse and well conditioned, note that both the input vector | b 〉 and the output vector | A -1 b 〉 are quantum states.”
From Quantum Computing in the NISQ era and beyond (2018) · cites this paper as [40]
The cited source says what the claim attributes to it.
In the citing paper
“Assuming these constraints, x j i can be approximately produced in time polynomial in log N , d and κ . 58,59”
From Quantum algorithms: an overview (2016) · cites this paper as [58]
The cited source says what the claim attributes to it.
In the citing paper
“Indeed, one can even show that achieving a similar runtime classically would imply that classical computers could ef fi ciently simulate any polynomial-time quantum computation. 58”
From Quantum algorithms: an overview (2016) · cites this paper as [58]
The cited source says what the claim attributes to it.
In the citing paper
“The quantum algorithm of Harrow, Hassidim and Lloyd 58 (HHL) for solving systems of linear equations sidesteps this issue by ' solving ' the equations in a peculiarly quantum sense: given the ability to create the quantum state b j i ¼ P N i ¼ 1 bi i j i , and access to A , the algorithm outputs a state approximately proportional to x j i ¼ P N i ¼ 1 xi i j i .”
From Quantum algorithms: an overview (2016) · cites this paper as [58]
In the citing paper
“Second, by considering more favorable schemes for Hamiltonian decomposition 256,257 , most modern-day simulation algorithms scale in terms of τ max = t ‖ H ‖ max instead of τ , where ‖ H ‖ max is the absolute value of the largest entry of H as a matrix in the computational basis.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [257]
In the citing paper
“Childs 257 showed that given oracle access to a Hamiltonian with eigenvalues λ , one can construct a unitary quantum walk operator with eigenvalues e ± i arcsin λ .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [257]
In the citing paper
“Inserting this conditional operation in the quantum phase algorithm and using the improved phaseestimation techniques of ref. 15 yields the eigenvectors and eigenvalues to accuracy by applying the quantum phase algorithm for time t = O( -1 ), and so requires n = O(1/ 3 ) copies of the state ρ.”
From Quantum principal component analysis (2014) · cites this paper as [15]
In the citing paper
“Note that density matrix exponentiation is most effective when some of the eigenvalues of ρ are large.If all of the eigenvalues are of size O(1/d) then we require time t = O(d) to resolve the eigenvalues 15 .”
From Quantum principal component analysis (2014) · cites this paper as [15]
In the citing paper
“The Harrow-Hassidim-Lloyd (HHL) quantum algorithm [16] can solve certain linear systems exponentially faster than any known classical algorithm”
From The prospects of quantum computing in computational molecular biology (2021) · cites this paper as [16]
In the citing paper
“However, the algorithm proposed by Harrow, Hassidim and Lloyd [16] allows the inversion of a matrix in O log N ð Þ within some conditions.”
From The prospects of quantum computing in computational molecular biology (2021) · cites this paper as [16]
In the citing paper
“Reading out the function values from the quantum state |u in general requires exponential sampling, representing a so-called data”
From Solving nonlinear differential equations with differentiable quantum circuits (2021) · cites this paper as [9]
In the citing paper
“The power of HHL-based algorithms relies on amplitude encoding, where a function is represented as a quantum state |u = 2 N k=1 u k |k encoded in complex u k amplitudes of computational basis states |k for N qubits.This allows for compressing large grids into a small qubit register, providing exponential memory advantage.”
From Solving nonlinear differential equations with differentiable quantum circuits (2021) · cites this paper as [9]
In the citing paper
“When two particles for example are sent into a multiport, e.g.multimode waveguide [153,154], multimode fiber [155] or integrated waveguide structures [156], the transmission can be described as a complex bi-partite quantum walk”
From Two-photon interference: the Hong–Ou–Mandel effect (2021) · cites this paper as [154]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
A scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
The Mathematical Theory of Finite Element Methods
Brenner, S. C., & Scott, L. R. (2007) · Texts in applied mathematics · doi:10.1007/978-0-387-75934-0 · Cited by 4,009
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 2×
“[2] S.”
BackgroundSelf-citationIntroduction to the Theory of Computation
Sipser, M. (1996) · ACM SIGACT News · doi:10.1145/230514.571645 · Cited by 2,886
An Introduction to the Conjugate Gradient Method Without the Agonizing Pain
Shewchuk, J. R. (1994) · Cited by 2,193
Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion
Hansen, P. C. (1987) · Medical Entomology and Zoology · Cited by 2,142
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science · doi:10.1126/science.1057726 · Cited by 2,056
Quantum amplitude amplification and estimation
Brassard, G., Høyer, P., Mosca, M., & Tapp, A. (2002) · Contemporary Mathematics · doi:10.1090/conm/305/05215 · Cited by 1,680
Cleve, R., EKERT, A. K., Macchiavello, C., & Mosca, M. (1998) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.1998.0164 · Cited by 1,399
Flagged first, then by citations
Research works printed but not linked: 3
- P. W. Shor, 1994, Proc. of the 35th FOCS
- P. Valiant, 2008, Proc. of the 40th Annual STOC
- L. Sheridan, 2009, J. Math Phys. A, 42, 185302
Cited by
Sorted by citations
Items 701–800 of 1,006
Jaques, S., & Rattew, A. G. (2025) · Quantum · doi:10.22331/q-2025-12-02-1922 · Cited by 103
Efficient quantum algorithms for analyzing large sparse electrical networks
Wang, G. (2017) · Quantum Information and Computation · doi:10.26421/qic17.11-12-5 · Cited by 36
Dai, W., Peng, T., & Win, M. Z. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.2969000 · Cited by 29
Quantum Computing with black-box SubroutinesPreprint
Thompson, J. E., Gu, M., Modi, K. K., & Vedral, V. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.2927 · Cited by 33
The hardness of random quantum circuits
Movassagh, R. (2023) · Nature Physics · doi:10.1038/s41567-023-02131-2 · Cited by 34
Quantum kernel estimation-based quantum support vector regression
Zhou, X., Yu, J., Tan, J., & Jiang, T. (2024) · Quantum Information Processing · doi:10.1007/s11128-023-04231-7 · Cited by 30
Tensorized Pauli decomposition algorithm
Hantzko, L., Binkowski, L., & Gupta, S. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad6499 · Cited by 38
Quantum Computing for Cybersecurity
Alauthman, M., Almomani, A., Al–Qerem, A., Khaldy, M. A. A., Aldweesh, A. Y., Maqousi, A. Y. A., & Alkasassbeh, M. S. (2024) · Advances in information security, privacy, and ethics book series · doi:10.4018/979-8-3693-5330-1.ch004 · Cited by 28
Next Generation Power System Planning and Operation With Quantum Computation
Ganeshamurthy, P. A., Ghosh, K., O’Meara, C., Cortiana, G., Schiefelbein, J., & Monti, A. (2024) · IEEE Access · doi:10.1109/access.2024.3509743 · Cited by 35
Hybrid digital-analog simulation of many-body dynamics with superconducting qubits
Валерьевич, Б. Д., Zhukov, A. A., & Pogosov, W. V. (2020) · Physical Review A · doi:10.1103/physreva.101.052337 · Cited by 28
Relationship between costs for quantum error mitigation and non-Markovian measures
Hakoshima, H., Matsuzaki, Y., & Endo, S. (2021) · Physical Review A · doi:10.1103/physreva.103.012611 · Cited by 28
Quantum inverse iteration algorithm for programmable quantum simulators
Kyriienko, O. (2025) · Figshare · Cited by 27
Quantum imaginary time evolution steered by reinforcement learning
Cao, C., An, Z., Hou, S., Zhou, D. L., & Zeng, B. (2022) · Communications Physics · doi:10.1038/s42005-022-00837-y · Cited by 29
SpinQ Gemini: a desktop quantum computing platform for education and research
Hou, S., Feng, G., Wu, Z., Zou, H., Shi, W., Zeng, J., Cao, C., Yü, S., Sheng, Z., Rao, X., et al. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00109-8 · Cited by 38
A brief introduction to quantum algorithms
Zhang, S., & Li, L. (2022) · CCF Transactions on High Performance Computing · doi:10.1007/s42514-022-00090-3 · Cited by 31
Quantum neural network autoencoder and classifier applied to an industrial case study
Mangini, S., Marruzzo, A., Piantanida, M., Gerace, D., Bajoni, D., & Macchiavello, C. (2022) · Quantum Machine Intelligence · doi:10.1007/s42484-022-00070-4 · Cited by 35
Universal Parity Quantum Computing
Fellner, M., Messinger, A., Ender, K., & Lechner, W. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.180503 · Cited by 29
Tower: data structures in Quantum superposition
Yuan, C., & Carbin, M. (2022) · Proceedings of the ACM on Programming Languages · doi:10.1145/3563297 · Cited by 27
Noisy-Intermediate-Scale Quantum Electromagnetic Transients Program
Zhou, Y., Zhang, P., & Feng, F. (2022) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2022.3172655 · Cited by 27
Programmable In-Memory Computing Circuit for Solving Combinatorial Matrix Operation in One Step
Hong, Q., Man, S., Sun, J., Du, S., & Zhang, J. (2023) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2023.3263217 · Cited by 27
Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions
Moosa, M., Watts, T. W., Chen, Y., Sarma, A., & McMahon, P. L. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acfc62 · Cited by 29
Phase transition in stabilizer entropy and efficient purity estimation
Leone, L., Oliviero, S. F. E., Esposito, G., & Hamma, A. (2024) · Physical Review A · doi:10.1103/physreva.109.032403 · Cited by 32
Efficient algorithms in quantum query complexity
Kothari, R. (2014) · UWSpace (University of Waterloo) · Cited by 26
NISQ Quantum Computing: A Security-Centric Tutorial and Survey [Feature]
Chen, F., Jiang, L., Müller, H. A., Richerme, P., Chu, C., Fu, Z., & Min, Y. (2024) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2024.3349665 · Cited by 32
Development of optimization method for truss structure by quantum annealing
Honda, R., Endo, K., Kaji, T., Suzuki, Y., Matsuda, Y., Tanaka, S., & Muramatsu, M. (2024) · Scientific Reports · doi:10.1038/s41598-024-64588-2 · Cited by 26
Hamiltonian simulation for hyperbolic partial differential equations by scalable quantum circuits
Sato, Y., Kondo, R., Hamamura, I., Onodera, T., & Yamamoto, N. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033246 · Cited by 49
Quantum Cryptanalysis: Shor, Grover, and Beyond
Jordan, S. P., & Liu, Y.-K. (2018) · IEEE Security & Privacy · doi:10.1109/msp.2018.3761719 · Cited by 26
Predicting excited states from ground state wavefunction by supervised quantum machine learning
Kawai, H., & Nakagawa, Y. O. (2020) · Machine Learning Science and Technology · doi:10.1088/2632-2153/aba183 · Cited by 27
Key questions for the quantum machine learner to ask themselves
Wiebe, N. (2020) · New Journal of Physics · doi:10.1088/1367-2630/abac39 · Cited by 25
Joint QKD-Post-Quantum Cryptosystems
Djordjević, I. B. (2020) · IEEE Access · doi:10.1109/access.2020.3018909 · Cited by 32
A quantum‐based diagnostics approach for additive manufacturing machine
Sharma, V., Gupta, S., Mehta, G., & Lad, B. K. (2021) · IET Collaborative Intelligent Manufacturing · doi:10.1049/cim2.12022 · Cited by 26
Compiling basic linear algebra subroutines for quantum computers
Zhao, L., Zhao, Z., Rebentrost, P., & Fitzsimons, J. F. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-021-00048-8 · Cited by 26
Coreset Clustering on Small Quantum Computers
Anschuetz, E. R. (2021) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 26
Pricing Multi-Asset Derivatives by Finite-Difference Method on a Quantum Computer
Miyamoto, K., & Kubo, K. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3128643 · Cited by 32
Xor-And-Inverter Graphs for Quantum Compilation
Meuli, G., Soeken, M., & Micheli, G. D. (2022) · npj Quantum Information · doi:10.1038/s41534-021-00514-y · Cited by 27
QULATIS: A Quantum Error Correction Methodology toward Lattice Surgery
Ueno, Y., Kondo, M., Tanaka, M., Suzuki, Y., & Tabuchi, Y. (2022) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca53966.2022.00028 · Cited by 26
Quantum microgrid state estimation
Feng, F., Zhang, P., Zhou, Y., & Tang, Z. (2022) · Electric Power Systems Research · doi:10.1016/j.epsr.2022.108386 · Cited by 26
Quantum computing and preconditioners for hydrological linear systems
Golden, J. K., O’Malley, D., & Viswanathan, H. (2022) · Scientific Reports · doi:10.1038/s41598-022-25727-9 · Cited by 26
Variational quantum one-class classifier
Park, G., Huh, J., & Park, D. K. (2023) · Machine Learning Science and Technology · doi:10.1088/2632-2153/acafd5 · Cited by 27
An Empirical Comparison of Optimizers for Quantum Machine Learning with SPSA-Based Gradients
Wiedmann, M., Hölle, M., Periyasamy, M., Meyer, N., Ufrecht, C., Scherer, D. D., Plinge, A., & Mutschler, C. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00058 · Cited by 26
Can small quantum systems learn
Wiebe, N., & Grandade, C. (2017) · Quantum Information and Computation · doi:10.26421/qic17.7-8-2 · Cited by 26
Das, S., Siopsis, G., & Weedbrook, C. (2018) · Physical Review A · doi:10.1103/physreva.97.022315 · Cited by 26
Extreme Quantum Advantage when Simulating Classical Systems with Long-Range Interaction
Aghamohammadi, C., Mahoney, J. R., & Crutchfield, J. P. (2017) · Scientific Reports · doi:10.1038/s41598-017-04928-7 · Cited by 26
Cost-function embedding and dataset encoding for machine learning with parametrized quantum circuits
Cao, S., Wossnig, L., Vlastakis, B., Leek, P., & Grant, E. (2020) · Physical Review A · doi:10.1103/physreva.101.052309 · Cited by 30
Wang, S., Wang, Z., Li, W., Fan, L., Cui, G., Wei, Z., & Gu, Y. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02855-7 · Cited by 26
T-Count Optimized Quantum Circuit Designs for Single-Precision Floating-Point Division
Gayathri, S. S., Kumar, R., Dhanalakshmi, S., Dooly, G., & Duraibabu, D. B. (2021) · Electronics · doi:10.3390/electronics10060703 · Cited by 26
Quantum $k$-nearest neighbors algorithmPreprint
Basheer, A., Afham, A., & Goyal, S. K. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.09187 · Cited by 52
A Survey of Quantum Internet Protocols From a Layered Perspective
Li, Y., Zhang, H., Zhang, C., Huang, T., & Yu, F. R. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3361662 · Cited by 38
Li, Y., Zhou, F., Song, W., Zhang, X., Fan, J., Han, Y., & Lei, Z. (2024) · Scripta Materialia · doi:10.1016/j.scriptamat.2024.116337 · Cited by 25
Bellante, A., Fioravanti, T., Carminati, M., Zanero, S., & Luongo, A. (2025) · Computers & Security · doi:10.1016/j.cose.2025.104341 · Cited by 35
Zhang, Z., Wu, Y., & Ma, X. (2025) · Energy Conversion and Management · doi:10.1016/j.enconman.2025.119694 · Cited by 30
Error-mitigated data-driven circuit learning on noisy quantum hardware
Hamilton, K. E., & Pooser, R. C. (2020) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00021-x · Cited by 23
Quantum locally linear embedding for nonlinear dimensionality reduction
He, X., Li, S., Lyu, C., & Wang, X. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02818-y · Cited by 27
Variational quantum packaged deflation for arbitrary excited states
Wen, J., Lv, D., Yung, M., & Long, G. (2021) · Quantum Engineering · doi:10.1002/que2.80 · Cited by 27
Quantum algorithm for neighborhood preserving embedding
Pan, S., Wan, L., Liu, H., Wu, Y., Qin, S., Wen, Q., & Gao, F. (2022) · Chinese Physics B · doi:10.1088/1674-1056/ac523a · Cited by 25
Quantum approximate optimization for hard problems in linear algebra
Borle, A., Elfving, V. E., & Lomonaco, S. J. (2021) · SciPost Physics Core · doi:10.21468/scipostphyscore.4.4.031 · Cited by 38
Impact of time-correlated noise on zero-noise extrapolation
Schultz, K., LaRose, R., Mari, A., Quiroz, G., Shammah, N., Clader, B. D., & Zeng, W. J. (2022) · Physical Review A · doi:10.1103/physreva.106.052406 · Cited by 28
Effects of quantum resources and noise on the statistical complexity of quantum circuits
Bu, K., Koh, D. E., Li, L., Luo, Q., & Zhang, Y. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acb56a · Cited by 27
Solving DC power flow problems using quantum and hybrid algorithms
Gao, F., Wu, G., Guo, S., Dai, W., & Shuang, F. (2023) · Applied Soft Computing · doi:10.1016/j.asoc.2023.110147 · Cited by 25
Let quantum neural networks choose their own frequencies
Jaderberg, B., Gentile, A. A., Berrada, Y. A., Shishenina, E., & Elfving, V. E. (2024) · Physical Review A · doi:10.1103/physreva.109.042421 · Cited by 28
Quantum algorithms for nonlinear partial differential equations
Jin, S., & Liu, N. (2024) · Bulletin des Sciences Mathématiques · doi:10.1016/j.bulsci.2024.103457 · Cited by 25
Ozols, M., Roetteler, M., & Roland, J. (2012) · Conference on Innovations in Theoretical Computer Science · doi:10.1145/2090236.2090261 · Cited by 37
A universal quantum circuit scheme for finding complex eigenvalues
Daskin, A., Grama, A. Y., & Kais, S. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0654-1 · Cited by 24
Quantum Algorithms for Similarity Measurement Based on Euclidean Distance
Yu, K., Guo, G., Li, J., & Lin, S. (2020) · International Journal of Theoretical Physics · doi:10.1007/s10773-020-04567-1 · Cited by 25
Preparing topological projected entangled pair states on a quantum computer
Schwarz, M., Temme, K., Verstraete, F., Pérez-Garcı́a, D., & Cubitt, T. S. (2013) · Physical Review A · doi:10.1103/physreva.88.032321 · Cited by 24
The Geometry of Parallelism. Classical, Probabilistic, and Quantum EffectsPreprint
Lago, U. D., Faggian, C., Valiron, B., & Yoshimizu, A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1610.09629 · Cited by 25
A quantum hamiltonian simulation benchmark
Dong, Y., Whaley, K. B., & Lin, L. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00636-x · Cited by 31
Compact quantum algorithms for time-dependent differential equations
Bharadwaj, S. S., & Sreenivasan, K. R. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.023262 · Cited by 25
Ahmed, O., Tennie, F., & Magri, L. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043082 · Cited by 24
Entanglement detection with quantum support vector machine (QSVM) on near-term quantum devices
Mahdian, M., & Mousavi, Z. B. (2025) · Scientific Reports · doi:10.1038/s41598-025-95897-9 · Cited by 28
Quantum Information Processing and Precision Measurement Using a Levitated Nanodiamond
Zhang, H., Chen, X.-Y., & Yin, Z. (2021) · Advanced Quantum Technologies · doi:10.1002/qute.202000154 · Cited by 26
Quantum computation and simulation with superconducting qubits*
He, K., Geng, X., Huang, R., Liu, J., & Chen, W. (2021) · Chinese Physics B · doi:10.1088/1674-1056/ac16cf · Cited by 24
Quantum second-order optimization algorithm for general polynomials
Gao, P., Li, K., Wei, S., & Long, G. (2021) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-021-1725-9 · Cited by 25
Meng, F., Li, Z., Yu, X., & Zhang, Z. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3119010 · Cited by 27
A Quantum Convolutional Neural Network for Image Classification
Lü, Y., Gao, Q. Z., Lü, J., OGORZAŁEK, M. J., & Zheng, J. Y. (2021) · Chinese Control Conference (CCC) · doi:10.23919/ccc52363.2021.9550027 · Cited by 29
Rolling bearing fault diagnosis based on quantum LS-SVM
Li, Y., Song, L., Sun, Q., Xu, H., Li, X., Fang, Z., & Yao, W. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00137-y · Cited by 24
Quantum Processing in Fusion of SAR and Optical Images for Deep Learning: A Data-Centric Approach
Majji, S. R., Chalumuri, A., Kune, R., & Manoj, B. S. (2022) · IEEE Access · doi:10.1109/access.2022.3189474 · Cited by 25
Quantum variational learning for quantum error-correcting codes
Cao, C., Zhang, C., Wu, Z., Grassl, M., & Zeng, B. (2022) · Quantum · doi:10.22331/q-2022-10-06-828 · Cited by 29
Quantum Computing Methods for Supply Chain Management
Jiang, H., Shen, Z. M., & Liu, J. (2022) · IEEE/ACM Symposium on Edge Computing (SEC) · doi:10.1109/sec54971.2022.00059 · Cited by 27
Systems Architecture for Quantum Random Access Memory
Xu, S., Hann, C. T., Foxman, B., Girvin, S. M., & Ding, Y. (2023) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3613424.3614270 · Cited by 31
A variational quantum algorithm-based numerical method for solving potential and Stokes flows
Liu, Y. Y., Chen, Z., Shu, C., Rebentrost, P., Liu, Y., Chew, S. C., Khoo, B. C., & Cui, Y. (2023) · Ocean Engineering · doi:10.1016/j.oceaneng.2023.116494 · Cited by 24
Quantum Data Center: Perspectives
Liu, J., & Jiang, L. (2024) · IEEE Network · doi:10.1109/mnet.2024.3397836 · Cited by 28
Wei, T.-C., & Huang, C.-Y. (2017) · Physical Review A · doi:10.1103/physreva.96.032317 · Cited by 24
Solving the Hamiltonian Cycle Problem using a Quantum Computer
Mahasinghe, A., Hua, R., Dinneen, M. J., & Goyal, R. (2019) · Australasian Computer Science Week Multiconference (ACSW) · doi:10.1145/3290688.3290703 · Cited by 24
Grammar-Aware Question-Answering on Quantum Computers.Preprint
Meichanetzidis, K., Toumi, A., de Felice, G., & Coecke, B. (2020) · arXiv (Cornell University) · Cited by 24
Supercomputing leverages quantum machine learning and Grover’s algorithm
Khanal, B., Orduz, J., Rivas, P., & Baker, E. J. (2022) · The Journal of Supercomputing · doi:10.1007/s11227-022-04923-4 · Cited by 27
Topology-driven quantum architecture search framework
Su, J., Fan, J., Wu, S., Li, G., Qin, S., & Gao, F. (2025) · Science China Information Sciences · doi:10.1007/s11432-024-4486-x · Cited by 34
Experimental study of Forrelation in nuclear spins
Li, H., Gao, X., Xin, T., Yung, M., & Long, G. (2017) · 中国科学通报：英文版 · doi:10.1016/j.scib.2017.03.006 · Cited by 23
Gong, L.-H., He, X.-T., Tan, R.-C., & Zhou, Z. (2017) · International Journal of Theoretical Physics · doi:10.1007/s10773-017-3541-1 · Cited by 23
Demonstration of essentiality of entanglement in a Deutsch-like quantum algorithm
Huang, H.-L., Goswami, A., Bao, W., & Panigrahi, P. K. (2018) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-018-9175-2 · Cited by 25
Quantum random access memory via quantum walk
Asaka, R., Sakai, K., & Yahagi, R. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abf484 · Cited by 25
Variational Quantum-Based Simulation of Waveguide Modes
Ewe, W.-B., Koh, D. E., Goh, S. T., Chu, H., & Png, C. E. (2022) · IEEE Transactions on Microwave Theory and Techniques · doi:10.1109/tmtt.2022.3151510 · Cited by 31
García-Molina, P., Rodríguez-Mediavilla, J., & García‐Ripoll, J. J. (2022) · Physical Review A · doi:10.1103/physreva.105.012433 · Cited by 30
Efficient deterministic preparation of quantum states using decision diagrams
Mozafari, F., Micheli, G. D., & Yang, Y. (2022) · Physical Review A · doi:10.1103/physreva.106.022617 · Cited by 37
Noise-Resilient Phase Estimation with Randomized Compiling
Gu, Y., Ma, Y., Forcellini, N., & Liu, D. E. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.250601 · Cited by 30
Distributed exact Grover’s algorithm
Zhou, X., Qiu, D., & Luo, L. (2023) · Frontiers of Physics · doi:10.1007/s11467-023-1327-x · Cited by 24
Anomaly detection speed-up by quantum restricted Boltzmann machines
Moro, L., & Prati, E. (2023) · Communications Physics · doi:10.1038/s42005-023-01390-y · Cited by 27
Circuit Decomposition of Multicontrolled Special Unitary Single-Qubit Gates
Vale, R. F., Azevedo, T. M. D., Araújo, I. C. S., Araujo, I. F., & da Silva, A. J. (2023) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2023.3327102 · Cited by 55
Simulating lossy Gaussian boson sampling with matrix-product operators
Liu, M., Oh, C., Liu, J., Jiang, L., & Alexeev, Y. (2023) · Physical Review A · doi:10.1103/physreva.108.052604 · Cited by 28
Ensemble fluid simulations on quantum computers
Succi, S., Itani, W., Sanavio, C., Sreenivasan, K. R., & Steijl, R. (2023) · Computers & Fluids · doi:10.1016/j.compfluid.2023.106148 · Cited by 23
Metadata
- Authors
- Harrow, A. W., Hassidim, A., & Lloyd, S.
- Affiliations
- University of Bristol (GB)
- Massachusetts Institute of Technology (US)
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2009-10-07
- Volume
- 103
- Issue
- 15
- Pages
- 150502-150502
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1492999010
- Semantic Scholar
- ed562f0c86c80f75a8b9ac7344567e8b44c8d643
- Cited by
- 3,325
- References
- 34
- Citations by year
- 2026: 355 · 2025: 553 · 2024: 478 · 2023: 429 · 2022: 332 · 2021: 337 · 2020: 231 · 2019: 181 · 2018: 98 · 2017: 102 · 2016: 53 · 2015: 35 · 2014: 39 · 2013: 33 · 2012: 40
- FWCI
- 23.75
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Physical Review Letters (publishedVersion)
- arXiv (Cornell University) (publishedVersion)
- PubMed (publishedVersion)
- DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc)
- arXiv (Cornell University)
- PIRSA
- Bulletin of the American Physical Society
- Funders
- W. M. Keck Foundation
- Engineering and Physical Sciences Research Council (GR/S82169/01)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- quantum algorithms, systems of linear equations, sparse matrices, condition number, expectation value estimation, quantum advantage
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
