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 401–500 of 1,006
Towards a Pattern Language for Quantum Algorithms
Leymann, F. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-14082-3_19 · Cited by 53
Time Complexity of In-Memory Solution of Linear Systems
Sun, Z., Pedretti, G., Mannocci, P., Ambrosi, E., Bricalli, A., & Ielmini, D. (2020) · IEEE Transactions on Electron Devices · doi:10.1109/ted.2020.2992435 · Cited by 58
Power-optimal, stabilized entangling gate between trapped-ion qubits
Blümel, R., Grzesiak, N., Pisenti, N. C., Wright, K., & Nam, Y. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00489-w · Cited by 62
Quantum Algorithms for Linear Algebra and Machine Learning.
Prakash, A. (2014) · eScholarship (California Digital Library) · Cited by 51
Mutual information-assisted adaptive variational quantum eigensolver
Zhang, Z.-J., Kyaw, T. H., Kottmann, J. S., Degroote, M., & Aspuru-Guzik, A. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abdca4 · Cited by 52
Opportunities and Challenges of Quantum Computing for Engineering Optimization
Wang, Y., Kim, J. E., & Suresh, K. (2023) · Journal of Computing and Information Science in Engineering · doi:10.1115/1.4062969 · Cited by 55
Machine Learning-Based Computational Design Methods for High-Entropy Alloys
Zhao, Y. M., Zhang, J. Y., Liaw, P. K., & Yang, T. (2025) · High Entropy Alloys & Materials · doi:10.1007/s44210-025-00055-5 · Cited by 57
Barz, S. (2015) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/48/8/083001 · Cited by 56
Integrating Quantum Computing into Workflow Modeling and Execution
Weder, B., Breitenbücher, U., Leymann, F., & Wild, K. (2020) · IEEE/ACM International Conference on Utility and Cloud Computing (UCC) · doi:10.1109/ucc48980.2020.00046 · Cited by 61
Experimental quantum kernel trick with nuclear spins in a solid
Kusumoto, T., Mitarai, K., Fujii, K., Kitagawa, M., & Negoro, M. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00423-0 · Cited by 70
Generalized quantum circuit differentiation rules
Kyriienko, O., & Elfving, V. E. (2021) · Physical Review A · doi:10.1103/physreva.104.052417 · Cited by 69
Quantum mapping algorithm for structural non-probabilistic reliability optimization
Xu, Y., Wang, X., & Wang, Z. (2025) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-025-04085-w · Cited by 53
Graph isomorphism and Gaussian boson sampling
Brádler, K., Friedland, S., Izaac, J., Killoran, N., & Su, D. (2021) · Special Matrices · doi:10.1515/spma-2020-0132 · Cited by 61
Quantum Algorithms for Portfolio Optimization
Kerenidis, I., Prakash, A., & Szilágyi, D. (2019) · ACM Conference on Advances in Financial Technologies (AFT) · doi:10.1145/3318041.3355465 · Cited by 52
Physical-Layer Supervised Learning Assisted by an Entangled Sensor Network
Zhuang, Q., & Zhang, Z. (2019) · Physical Review X · doi:10.1103/physrevx.9.041023 · Cited by 56
Linear-depth quantum circuits for multiqubit controlled gates
da Silva, A. J., & Park, D. K. (2022) · Physical Review A · doi:10.1103/physreva.106.042602 · Cited by 51
Quantum kernel methods for solving regression problems and differential equations
Paine, A. E., Elfving, V. E., & Kyriienko, O. (2023) · Physical Review A · doi:10.1103/physreva.107.032428 · Cited by 71
Detecting Clouds in Multispectral Satellite Images Using Quantum-Kernel Support Vector Machines
Miroszewski, A., B, J. M. A., Czelusta, G., Szczepanek, F., Grabowski, B., Saux, B. L., & Nalepa, J. (2023) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2023.3304122 · Cited by 53
Preparing Projected Entangled Pair States on a Quantum Computer
Schwarz, M., Temme, K., & Verstraete, F. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.110502 · Cited by 55
Quantum versus classical generative modelling in finance
Coyle, B., Henderson, M., Le, J. C. J., Kumar, N., Paini, M., & Kashefi, E. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abd3db · Cited by 65
A Survey of Quantum Learning TheoryPreprint
Arunachalam, S., & de Wolf, R. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.06806 · Cited by 88
A Variational Quantum Algorithm for Preparing Quantum Gibbs StatesPreprint
Chowdhury, A. C. N., Low, G. H., & Wiebe, N. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.00055 · Cited by 91
Quantum computation of molecular response properties
Cai, X., Fang, W., Fan, H., & Li, Z. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033324 · Cited by 51
An improved quantum-inspired algorithm for linear regression
Gilyén, A., Song, Z., & Tang, E. (2022) · Quantum · doi:10.22331/q-2022-06-30-754 · Cited by 70
Zaman, A., Morrell, H. J., & Wong, H. Y. (2023) · IEEE Access · doi:10.1109/access.2023.3297658 · Cited by 56
Presence and Absence of Barren Plateaus in Tensor-Network Based Machine Learning
Liu, Z., Yu, L.-W., Duan, L., & Deng, D.-L. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.270501 · Cited by 56
An Efficient Algorithm for Sparse Quantum State Preparation
Gleinig, N., & Hoefler, T. (2021) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac18074.2021.9586240 · Cited by 49
Avoiding barren plateaus with classical deep neural networks
Friedrich, L., & Maziero, J. (2022) · Physical Review A · doi:10.1103/physreva.106.042433 · Cited by 49
Huang, K., Cai, X., Li, H., Ge, Z.-Y., Hou, R., Li, H., Liu, T., Shi, Y., Chen, C.-T., Zheng, D., et al. (2022) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.2c02381 · Cited by 52
Speeding Up Learning Quantum States Through Group Equivariant Convolutional Quantum Ansätze
Zheng, H., Li, Z., Liu, J., Strelchuk, S., & Kondor, R. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020327 · Cited by 67
Stabilizer entropy dynamics after a quantum quench
Rattacaso, D., Leone, L., Oliviero, S. F. E., & Hamma, A. (2023) · Physical Review A · doi:10.1103/physreva.108.042407 · Cited by 67
Realistic interpretation of quantum mechanics and encounter-delayed-choice experiment
Long, G., Qin, W., Yang, Z., & Li, J. (2017) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-017-9122-2 · Cited by 49
Nearly tight Trotterization of interacting electrons
Su, Y., Huang, H.-Y., & Campbell, E. T. (2020) · CaltechAUTHORS (California Institute of Technology) · Cited by 49
Markovian Quantum Neuroevolution for Machine Learning
Lu, Z., Shen, P.-X., & Deng, D.-L. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.044039 · Cited by 51
Quantum computation: Algorithms and Applications
Cho, C., Chen, C.-Y., Chen, K.-C., Huang, T., Hsu, M.-C., Cao, N., Zeng, B., Tan, S.-G., & Chang, C. (2021) · Chinese Journal of Physics · doi:10.1016/j.cjph.2021.05.001 · Cited by 54
Astrea: Accurate Quantum Error-Decoding via Practical Minimum-Weight Perfect-Matching
Vittal, S., Das, P., & Qureshi, M. K. (2023) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3579371.3589037 · Cited by 48
Analyzing Prospects for Quantum Advantage in Topological Data Analysis
Berry, D. W., Su, Y., Gyurik, C., King, R., Basso, J., Barba, A. D. T., Rajput, A., Wiebe, N., Dunjko, V., & Babbush, R. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010319 · Cited by 74
Lightweight block ciphers for resource-constrained environments: A comprehensive survey
Zhong, Y. Q., & Gu, J. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.03.054 · Cited by 60
Robust resource-efficient quantum variational ansatz through an evolutionary algorithm
Huang, Y., Li, Q., Hou, X., Wu, R.-B., Yung, M., Bayat, A., & Wang, X. (2022) · Physical Review A · doi:10.1103/physreva.105.052414 · Cited by 56
Hamiltonian Simulation by Uniform Spectral AmplificationPreprint
Low, G. H., & Chuang, I. L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.05391 · Cited by 63
The Need for Structure in Quantum SpeedupsPreprint
Aaronson, S., & Ambainis, A. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0911.0996 · Cited by 70
Computing Ground State Properties with Early Fault-Tolerant Quantum Computers
Zhang, R., Wang, G., & Johnson, P. D. (2022) · Quantum · doi:10.22331/q-2022-07-11-761 · Cited by 53
Enhancing the Quantum Linear Systems Algorithm Using Richardson Extrapolation
Vazquez, A. C., Hiptmair, R., & Woerner, S. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3490631 · Cited by 54
Nonconventional Computer Arithmetic Circuits, Systems and Applications
Sousa, L. A. (2021) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2020.3027425 · Cited by 47
Resonant quantum principal component analysis
Li, Z., Chai, Z., Guo, Y., Ji, W., Wang, M., Shi, F., Wang, Y., Lloyd, S., & Du, J. (2021) · Science Advances · doi:10.1126/sciadv.abg2589 · Cited by 54
Self-citationQuantum-Enhanced Heat Engine Based on Superabsorption
Kamimura, S., Hakoshima, H., Matsuzaki, Y., Yoshida, K., & 都倉, 康. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.180602 · Cited by 49
Prospects and challenges of quantum finance
Bouland, A., van Dam, W., Joorati, H., Kerenidis, I., & Prakash, A. (2020) · arXiv · doi:10.48550/arxiv.2011.06492 · Cited by 46
A language and hardware independent approach to quantum–classical computing
McCaskey, A. J., Dumitrescu, E. F., Liakh, D., Chen, M., Feng, W., & Humble, T. S. (2018) · SoftwareX · doi:10.1016/j.softx.2018.07.007 · Cited by 46
Realizing quantum gates with optically addressable Yb + 171 ion qudits
Aksenov, M. A., Zalivako, I. V., Semerikov, I. A., Borisenko, A. S., Semenin, N. V., Sidorov, P., Fedorov, A. K., Khabarova, K. Y., & Kolachevsky, N. (2023) · Physical Review A · doi:10.1103/physreva.107.052612 · Cited by 51
Integration of Quantum Technologies into Metaverse: Applications, Potentials, and Challenges
Tuli, E. A., Lee, J., & Kim, D. (2024) · IEEE Access · doi:10.1109/access.2024.3366527 · Cited by 48
Quantum computing for nonlinear differential equations and turbulence
Tennie, F., Laizet, S., Lloyd, S., & Magri, L. (2025) · Nature Reviews Physics · doi:10.1038/s42254-024-00799-w · Cited by 58
Self-citationFast quantum algorithms for least squares regression and statistic leverage scores
Liu, Y., & Zhang, S. (2016) · Theoretical Computer Science · doi:10.1016/j.tcs.2016.05.044 · Cited by 45
Point processes with Gaussian boson sampling
Jahangiri, S., Arrazola, J. M., Quesada, N., & Killoran, N. (2020) · Physical review. E · doi:10.1103/physreve.101.022134 · Cited by 51
Nonlinear quantum neuron: A fundamental building block for quantum neural networks
Yan, S., Qi, H., & Cui, W. (2020) · Physical Review A · doi:10.1103/physreva.102.052421 · Cited by 45
Quantum algorithm for estimating α -Renyi entropies of quantum states
Subramanian, S., & Hsieh, M.-H. (2021) · Physical Review A · doi:10.1103/physreva.104.022428 · Cited by 46
QASMBench: A Low-level QASM Benchmark Suite for NISQ Evaluation and SimulationPreprint
Li, A., Stein, S., Krishnamoorthy, S., & Ang, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.13018 · Cited by 46
Quantum Hoare Logic with Classical Variables
Feng, Y., & Ying, M. (2021) · ACM Transactions on Quantum Computing · doi:10.1145/3456877 · Cited by 63
Configurable sublinear circuits for quantum state preparation
Araujo, I. F., Park, D. K., Ludermir, T. B., de Oliveira, W. R., Petruccione, F., & da Silva, A. J. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03869-7 · Cited by 55
Formal Verification of Quantum Programs: Theory, Tools, and Challenges
Lewis, M., Soudjani, S., & Zuliani, P. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3624483 · Cited by 65
Perspectives of quantum computing for chemical engineering
Bernal, D. E., Ajagekar, A., Harwood, S. M., Stober, S. T., Trenev, D., & You, F. (2022) · AIChE Journal · doi:10.1002/aic.17651 · Cited by 51
Quantum Deep Reinforcement Learning for Robot Navigation Tasks
Hohenfeld, H., Heimann, D., Wiebe, F., & Kirchner, F. (2024) · IEEE Access · doi:10.1109/access.2024.3417808 · Cited by 58
Potential quantum advantage for simulation of fluid dynamics
Li, X., Yin, X., Wiebe, N., Chun, J., Schenter, G. K., Cheung, M. S., & Mülmenstädt, J. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013036 · Cited by 45
Quantum Finance: Exploring the Implications of Quantum Computing on Financial Models
Zhou, J. (2025) · Computational Economics · doi:10.1007/s10614-025-10894-4 · Cited by 56
Toward Quantum Federated Learning
Ren, C., Yan, R., Zhu, H., Yu, H., Xu, M., Shen, Y., Xu, Y. H., Xiao, M., Dong, Z. Y., Skoglund, M., et al. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2025.3552643 · Cited by 93
Versatile microwave-driven trapped ion spin system for quantum information processing
Piltz, C., Sriarunothai, T., Ivanov, S. S., Wölk, S., & Wunderlich, C. (2016) · Science Advances · doi:10.1126/sciadv.1600093 · Cited by 43
Quantum Circuits for Floating-Point Arithmetic
Häner, T., Soeken, M., Roetteler, M., & Svore, K. M. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-99498-7_11 · Cited by 44
Quantum algorithms and lower bounds for convex optimization
Chakrabarti, S., Childs, A. M., Li, T., & Wu, X. (2020) · Quantum · doi:10.22331/q-2020-01-13-221 · Cited by 44
Quantum anomaly detection with density estimation and multivariate Gaussian distribution
Liang, J., Shen, S., Li, M., & Li, L. (2019) · Physical Review A · doi:10.1103/physreva.99.052310 · Cited by 48
Demonstration of topological data analysis on a quantum processor
Huang, H.-L., Wang, X., Rohde, P. P., Luo, Y.-H., Zhao, Y., Liu, C., Li, L., Liu, N.-L., Lu, C., & Pan, J.-W. (2018) · Optica · doi:10.1364/optica.5.000193 · Cited by 47
Quantum Computing for Enhancing Grid Security
Eskandarpour, R., Gokhale, P., Khodaei, A., Chong, F. T., Passo, A., & Bahramirad, S. (2020) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2020.3004073 · Cited by 46
Exact and Practical Pattern Matching for Quantum Circuit Optimization
Iten, R., Moyard, R., Metger, T., Sutter, D., & Woerner, S. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3498325 · Cited by 45
Fast-forwarding quantum evolution
Gu, S., Somma, R. D., & Şahinoğlu, B. (2021) · Quantum · doi:10.22331/q-2021-11-15-577 · Cited by 45
Mathematical operations and equation solving with reconfigurable metadevices
Tzarouchis, D. C., Mencagli, M. J., Edwards, B. E., & Engheta, N. (2022) · Light Science & Applications · doi:10.1038/s41377-022-00950-1 · Cited by 45
Sublinear quantum algorithms for training linear and kernel-based classifiersPreprint
Li, T., Chakrabarti, S., & Wu, X. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.02276 · Cited by 53
Hybrid quantum algorithms for flow problems
Bharadwaj, S. S., & Sreenivasan, K. R. (2023) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2311014120 · Cited by 46
Homomorphic encryption experiments on IBM’s cloud quantum computing platform
Huang, H.-L., Zhao, Y., Li, T., Li, F., Du, Y.-T., Fu, X.-Q., Zhang, S., Wang, X., & Bao, W. (2016) · Frontiers of Physics · doi:10.1007/s11467-016-0643-9 · Cited by 45
Programming quantum computers using design automation
Soeken, M., Häner, T., & Roetteler, M. (2018) · Design, Automation, and Test in Europe · doi:10.23919/date.2018.8341993 · Cited by 49
Quantum Hoare Logic with Ghost Variables
Unruh, D. (2019) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.2019.8785779 · Cited by 44
Quantum Computation in Robotic Science and Applications
Petschnigg, C., Brandstötter, M., Pichler, H., Hofbaur, M., & Dieber, B. (2019) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2019.8793768 · Cited by 45
Linear embedding of nonlinear dynamical systems and prospects for efficient quantum algorithms
Engel, A., Smith, G., & Parker, S. E. (2021) · Physics of Plasmas · doi:10.1063/5.0040313 · Cited by 45
Style-based quantum generative adversarial networks for Monte Carlo events
Bravo-Prieto, C., Baglio, J., Cè, M., Francis, A. S., Grabowska, D. M., & Carrazza, S. (2022) · Quantum · doi:10.22331/q-2022-08-17-777 · Cited by 60
Fast-forwarding of Hamiltonians and exponentially precise measurements
Atia, Y., & Aharonov, D. (2017) · RePEc: Research Papers in Economics · Cited by 43
Quantum algorithms for approximate function loading
Marin-Sanchez, G., Gonzalez-Conde, J., & Sanz, M. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.033114 · Cited by 55
Quantum support vector machine without iteration
Zhang, R., Wang, J., Jiang, N., & Wang, Z. (2023) · Information Sciences · doi:10.1016/j.ins.2023.03.106 · Cited by 47
Applying quantum approximate optimization to the heterogeneous vehicle routing problem
Fitzek, D., Ghandriz, T., Laine, L., Granath, M., & Kockum, A. F. (2024) · Scientific Reports · doi:10.1038/s41598-024-76967-w · Cited by 49
Trainability barriers and opportunities in quantum generative modeling
Rudolph, M. S., Lerch, S., Thanasilp, S., Kiss, O., Shaya, O., Vallecorsa, S., Grossi, M., & Holmes, Z. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00902-0 · Cited by 75
Programming the quantum future
Valiron, B., Ross, N. J., Selinger, P., Alexander, D. S., & Smith, J. M. (2015) · Communications of the ACM · doi:10.1145/2699415 · Cited by 43
An Introduction to Quantum Computing, without the Physics
Nannicini, G. (2020) · SIAM Review · doi:10.1137/18m1170650 · Cited by 46
Hybrid classical-quantum linear solver using Noisy Intermediate-Scale Quantum machines
Chen, C.-C., Shiau, S.-Y., Wu, M.-F., & Wu, Y.-R. (2019) · Scientific Reports · doi:10.1038/s41598-019-52275-6 · Cited by 42
Quantum Speedup for Aeroscience and Engineering
Givi, P., Daley, A. J., Mavriplis, D. J., & Malik, M. R. (2020) · AIAA Journal · doi:10.2514/1.j059183 · Cited by 46
Quantum-Enhanced Grid of the Future: A Primer
Eskandarpour, R., Ghosh, K., Khodaei, A., Paaso, E. A., & Zhang, L. (2020) · IEEE Access · doi:10.1109/access.2020.3031595 · Cited by 43
Variational quantum simulations of stochastic differential equations
Kubo, K., Nakagawa, Y. O., Endo, S., & Nagayama, S. (2021) · Physical Review A · doi:10.1103/physreva.103.052425 · Cited by 58
Generative quantum learning of joint probability distribution functions
Zhu, E. Y., Johri, S., Bacon, D., Esencan, M., Kim, J., Muir, M., Murgai, N., Nguyen, J., Pisenti, N. C., Schouela, A., et al. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043092 · Cited by 61
Towards quantum advantage via topological data analysis
Gyurik, C., Cade, C., & Dunjko, V. (2022) · Quantum · doi:10.22331/q-2022-11-10-855 · Cited by 70
Black-box Hamiltonian simulation and unitary implementation
Berry, D. W., & Childs, A. M. (2012) · Quantum Information and Computation · doi:10.26421/qic12.1-2 · Cited by 41
Quantum anomaly detection for collider physics
Alvi, S., Bauer, C., & Nachman, B. P. (2023) · Journal of High Energy Physics · doi:10.1007/jhep02(2023)220 · Cited by 42
Robust and Efficient Hamiltonian Learning
Yu, W., Sun, J., Han, Z., & Yuan, X. (2023) · Quantum · doi:10.22331/q-2023-06-29-1045 · Cited by 44
Mitigating Barren Plateaus of Variational Quantum Eigensolvers
Liu, X., Liu, G., Zhang, H.-K., Huang, J., & Wang, X. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3383050 · Cited by 55
New Quantum Algorithms for Computing Quantum Entropies and Distances
Wang, Q., Guan, J., Liu, J., Zhang, Z., & Ying, M. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3399014 · Cited by 75
Variational quantum algorithms for dimensionality reduction and classification
Liang, J., Shen, S., Li, M., & Li, L. (2020) · Physical Review A · doi:10.1103/physreva.101.032323 · Cited by 42
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
