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 801–900 of 1,006
Quantum simulation for partial differential equations with physical boundary or interface conditions
Jin, S., Li, X., Liu, N., & Yu, Y. (2023) · Journal of Computational Physics · doi:10.1016/j.jcp.2023.112707 · Cited by 28
Exponential quantum speed-ups are generic
Brandão, F. G. S. L., & Horodecki, M. (2013) · CaltechAUTHORS (California Institute of Technology) · doi:10.5555/2535639.2535640 · Cited by 23
Application of Pontryagin's minimum principle to Grover's quantum search problem
Lin, C., Wang, Y., Kolesov, G., & Kalabic, U. V. (2019) · Physical Review A · doi:10.1103/physreva.100.022327 · Cited by 22
Quantum computing and the security of public key cryptography
Li, K., Yan, P.-G., & Cai, Q.-Y. (2021) · Fundamental Research · doi:10.1016/j.fmre.2020.12.001 · Cited by 27
Fast high-fidelity geometric quantum control with quantum brachistochrones
Dong, Y., Feng, C., Zheng, Y. H., Chen, X.-D., Guo, G., & Sun, F. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.043177 · Cited by 21
Optimal Quantum Sample Complexity of Learning Algorithms
Arunachalam, S., & de Wolf, R. (2016) · UvA-DARE (University of Amsterdam) · doi:10.48550/arxiv.1607.00932 · Cited by 40
Introduction to Quantum Information and Computation for Chemistry
Kais, S. (2014) · Advances in chemical physics · doi:10.1002/9781118742631.ch01 · Cited by 25
Scalable Benchmarks for Gate-Based Quantum ComputersPreprint
Cornelissen, A., Bausch, J., & Gilyén, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.10698 · Cited by 37
Mapping structural topology optimization problems to quantum annealing
Wang, X., Wang, Z., & Ni, B. (2024) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-024-03791-1 · Cited by 22
Xiao, Y., Yang, L., Shu, C., Chew, S. C., Khoo, B. C., Cui, Y., & Liu, Y. Y. (2024) · Physics of Fluids · doi:10.1063/5.0226232 · Cited by 22
Lattice Boltzmann simulations for soft flowing matter
Tiribocchi, A., Durve, M., Marco Lauricella, A., Montessori, A., Tucny, J., & Sauro Succi, A. (2024) · Physics Reports · doi:10.1016/j.physrep.2024.11.002 · Cited by 22
Incompressible Navier–Stokes solve on noisy quantum hardware via a hybrid quantum–classical scheme
Song, Z., Deaton, R., Gard, B., & Bryngelson, S. H. (2024) · Computers & Fluids · doi:10.1016/j.compfluid.2024.106507 · Cited by 31
Efficient quantum thermal simulation
Chen, C.-F., Kastoryano, M. J., Brandão, F. G. S. L., & Gilyén, A. (2025) · Nature · doi:10.1038/s41586-025-09583-x · Cited by 45
Product formulas for exponentials of commutators
Childs, A. M., & Wiebe, N. (2013) · Journal of Mathematical Physics · doi:10.1063/1.4811386 · Cited by 22
Quantum computation for large-scale image classification
Ruan, Y., Chen, H., Tan, J., & Li, X. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1391-z · Cited by 22
Quantum remote sensing under the effect of dephasing
Okane, H., Hakoshima, H., Takeuchi, Y., Seki, Y., & Matsuzaki, Y. (2021) · Physical Review A · doi:10.1103/physreva.104.062610 · Cited by 23
Floating-Point Calculations on a Quantum Annealer: Division and Matrix Inversion
Singleton, R., & Rogers, M. (2020) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 22
Enhanced Machine Learning using Quantum Computing
Jhanwar, A., & Nene, M. J. (2021) · International Conference on Electronics and Sustainable Communication Systems (ICESC) · doi:10.1109/icesc51422.2021.9532638 · Cited by 28
Gharibian, S., & Gall, F. L. (2022) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3519935.3519991 · Cited by 41
Liang, Z., Wang, Z., Yang, J., Yang, L., Shi, Y., & Jiang, W. (2021) · International Conference on Computer Aided Design · doi:10.1109/iccad51958.2021.9643470 · Cited by 26
Sample complexity of learning parametric quantum circuits
Cai, H., Ye, Q., & Deng, D.-L. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac4f30 · Cited by 28
A survey of quantum computing hybrid applications with brain-computer interface
Huang, D., Wang, M., Wang, J., & Yan, J. (2022) · Cognitive Robotics · doi:10.1016/j.cogr.2022.07.002 · Cited by 27
A Survey on Quantum Computing for Recommendation Systems
Pilato, G., & Vella, F. (2022) · Information · doi:10.3390/info14010020 · Cited by 24
Quantum Regularized Least Squares
Chakraborty, S., Morolia, A., & Peduri, A. (2023) · Quantum · doi:10.22331/q-2023-04-27-988 · Cited by 24
Efficient variational synthesis of quantum circuits with coherent multi-start optimization
Nemkov, N. A., Kiktenko, E. O., Luchnikov, I. A., & Fedorov, A. K. (2023) · Quantum · doi:10.22331/q-2023-05-04-993 · Cited by 27
Efficient quantum feature extraction for CNN-based learning
Dou, T., Zhang, G., & Cui, W. (2023) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2023.06.003 · Cited by 26
Continuous dynamical decoupling of optical 171Yb+ qudits with radiofrequency fields
Zalivako, I. V., Borisenko, A. S., Semerikov, I. A., Korolkov, A. E., Sidorov, P., Galstyan, K. P., Semenin, N. V., Smirnov, V. N., Aksenov, M. D., Fedorov, A. K., et al. (2023) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2023.1228208 · Cited by 23
Reducing 2-QuBit Gate Count for ZX-Calculus based Quantum Circuit Optimization
Staudacher, K., Guggemos, T., Grundner-Culemann, S., & Gehrke, W. (2023) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.394.3 · Cited by 22
Efficient and fail-safe quantum algorithm for the transport equation
Schalkers, M. A., & Möller, M. (2024) · Journal of Computational Physics · doi:10.1016/j.jcp.2024.112816 · Cited by 22
Approximate complex amplitude encoding algorithm and its application to data classification problems
Mitsuda, N., Ichimura, T., Nakaji, K., Suzuki, Y., Tanaka, T., Raymond, R., Tezuka, H., Onodera, T., & Yamamoto, N. (2024) · Physical Review A · doi:10.1103/physreva.109.052423 · Cited by 24
Quantum computing of reacting flows via Hamiltonian simulation
Zhen Hua, L. U., & Yang, Y. (2024) · Proceedings of the Combustion Institute · doi:10.1016/j.proci.2024.105440 · Cited by 22
Efficient Magic State Distillation by Zero-Level Distillation
(2025) · doi:10.1103/thxx-njr6 · Cited by 22
Evaluation of an analog accelerator for linear algebra
Huang, Y., Guo, N., Seok, M., Tsividis, Y., & Sethumadhavan, S. (2016) · ACM SIGARCH Computer Architecture News · doi:10.1145/3007787.3001197 · Cited by 22
Efficient quantum circuits for dense circulant and circulant like operators
Zhou, S., & Wang, J. B. (2017) · Royal Society Open Science · doi:10.1098/rsos.160906 · Cited by 24
Quantum simulation of partially distinguishable boson sampling
Moylett, A. E., & Turner, P. S. (2018) · Physical Review A · doi:10.1103/physreva.97.062329 · Cited by 24
Quantum photonic network on chip
Zhang, Q.-Y., Xu, P., & Zhu, S. N. (2018) · Chinese Physics B · doi:10.1088/1674-1056/27/5/054207 · Cited by 22
Quantum speedup of twin support vector machines
Ye, Z., Li, L., Situ, H., & Wang, Y. (2020) · Science China Information Sciences · doi:10.1007/s11432-019-2783-7 · Cited by 22
Coherence Depletion in Quantum Algorithms
Liu, Y.-C., Shang, J., & Zhang, X. (2019) · Entropy · doi:10.3390/e21030260 · Cited by 21
Collective optimization for variational quantum eigensolvers
Zhang, D.-B., & Yin, T. (2020) · Physical Review A · doi:10.1103/physreva.101.032311 · Cited by 24
Quantum approximate Bayesian computation for NMR model inference
Sels, D., Dashti, H., Mora, S., Demler, O., & Demler, E. (2020) · Nature Machine Intelligence · doi:10.1038/s42256-020-0198-x · Cited by 23
Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory
Péchoux, R., Perdrix, S., Rennela, M., & Zamdzhiev, V. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-45231-5_29 · Cited by 21
Evaluation of an Analog Accelerator for Linear Algebra
Huang, Y., Guo, N., Seok, M., Tsividis, Y., & Sethumadhavan, S. (2016) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca.2016.56 · Cited by 22
Quantum-assisted biomolecular modelling
Harris, S. A., & Kendon, V. M. (2010) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2010.0087 · Cited by 22
Equivalence, identity, and unitarity checking in black-box testing of quantum programs
Long, P., & Zhao, J. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2024.112000 · Cited by 35
Multilevel Leapfrogging Initialization Strategy for Quantum Approximate Optimization Algorithm
Ni, X., Cai, B., Liu, H., Qin, S., Gao, F., & Wen, Q. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300419 · Cited by 29
Circuit complexity of quantum access models for encoding classical data
Zhang, X., & Yuan, X. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00835-8 · Cited by 33
Enabling large-scale and high-precision fluid simulations on near-term quantum computers
Chen, Z., Ma, T.-Y., Ye, C.-C., Xu, L., Bai, W., Zhou, L., Tan, M.-Y., Zhuang, X., Xu, X., Wang, Y., et al. (2024) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2024.117428 · Cited by 31
Practical Quantum Advantage on Partially Fault-Tolerant Quantum Computer
Toshio, R., Akahoshi, Y., Fujisaki, J., Oshima, H., Sato, S., & Fujii, K. (2025) · Physical Review X · doi:10.1103/physrevx.15.021057 · Cited by 49
Hierarchical Reversible Logic Synthesis Using LUTs
Soeken, M., Roetteler, M., Wiebe, N., & Micheli, G. D. (2017) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3061639.3062261 · Cited by 22
Quantum circuit design methodology for multiple linear regression
Dutta, S., Suau, A., Dutta, S., Roy, S., Behera, B. K., & Panigrahi, P. K. (2020) · IET Quantum Communication · doi:10.1049/iet-qtc.2020.0013 · Cited by 38
Quantum face recognition protocol with ghost imaging
Salari, V., Paneru, D., Sağlamyürek, E., Ghadimi, M., Abdar, M., Rezaee, M., Aslani, M., Barzanjeh, S., & Karimi, E. (2023) · Scientific Reports · doi:10.1038/s41598-022-25280-5 · Cited by 22
Jin, S., Liu, N., & Yu, Y. (2022) · Journal of Computational Physics · doi:10.1016/j.jcp.2022.111641 · Cited by 33
The Potential of Quantum Computing for Geoscience
Sahimi, M., & Tahmasebi, P. (2022) · Transport in Porous Media · doi:10.1007/s11242-022-01855-8 · Cited by 22
Quantum Computing Method for Solving Electromagnetic Problems Based on the Finite Element Method
Zhang, J., Feng, F., & Zhang, Q. (2023) · IEEE Transactions on Microwave Theory and Techniques · doi:10.1109/tmtt.2023.3297406 · Cited by 22
Sparse Quantum State Preparation for Strongly Correlated Systems
Feniou, C., Adjoua, O., Claudon, B., Zylberman, J., Giner, E., & Piquemal, J. (2024) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.3c03159 · Cited by 27
Dynamic optimization based on quantum computation-A comprehensive review
Kou, H., Zhang, Y., & Lee, H. P. (2023) · Computers & Structures · doi:10.1016/j.compstruc.2023.107255 · Cited by 21
Mitigating noise in digital and digital–analog quantum computation
García-Molina, P., Martin, A., de Andoin, M. G., & Sanz, M. (2024) · Communications Physics · doi:10.1038/s42005-024-01812-5 · Cited by 30
Kudrow, D., Bier, K., Deng, Z., Franklin, D. M., Tomita, Y., Brown, K. R., & Chong, F. T. (2013) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/2485922.2485937 · Cited by 21
Stability of the Trotter–Suzuki decomposition
Dhand, I., & Sanders, B. C. (2014) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/47/26/265206 · Cited by 21
Corrected quantum walk for optimal Hamiltonian simulation
Berry, D. W., & Novo, L. (2016) · Quantum Information and Computation · doi:10.26421/qic16.15-16-3 · Cited by 20
Simple digital quantum algorithm for symmetric first-order linear hyperbolic systems
Fillion‐Gourdeau, F., & Lorin, E. (2018) · Numerical Algorithms · doi:10.1007/s11075-018-0639-3 · Cited by 20
Superconducting quantum many-body circuits for quantum simulation and computing
Wilkinson, S. A., & Hartmann, M. J. (2020) · Applied Physics Letters · doi:10.1063/5.0008202 · Cited by 24
A quantum algorithm for simulating non-sparse Hamiltonians
Wang, C., & Wossnig, L. (2020) · Quantum Information and Computation · doi:10.26421/qic20.7-8-5 · Cited by 22
Quantum speedup in adaptive boosting of binary classification
Wang, X., Ma, Y., Hsieh, M.-H., & Yung, M. (2020) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-020-1638-5 · Cited by 22
A Resource-Efficient Design for a Reversible Floating Point Adder in Quantum Computing
Nguyen, T. D., & Meter, R. V. (2014) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/2629525 · Cited by 21
Quantum classificationPreprint
Gambs, S. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0809.0444 · Cited by 21
Quantum algorithms for scientific computing
Au-Yeung, R., Camino, B., Rathore, O., & Kendon, V. M. (2024) · Reports on Progress in Physics · doi:10.1088/1361-6633/ad85f0 · Cited by 37
A hybrid quantum-classical framework for computational fluid dynamics
Ye, C.-C., An, N.-B., Ma, T.-Y., Dou, M., Bai, W., Sun, D.-J., Chen, Z., & Guo, G. (2024) · Physics of Fluids · doi:10.1063/5.0238193 · Cited by 26
Robust Quantum Feature Selection With Sparse Optimization Circuit
Li, J., Song, J., Shi, J., Xu, H., Yu, H., Chen, G., & Zhang, S. (2025) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2025.3526060 · Cited by 20
Quantum machine learning regression optimisation for full-scale sewage sludge anaerobic digestion
Mohamed, Y., Elghadban, A., Lei, H. I., Shih, A. A., & Lee, P.-H. H. (2025) · npj Clean Water · doi:10.1038/s41545-025-00440-y · Cited by 21
Towards simulating fluid flows with quantum computing
Bharadwaj, S. S., & Sreenivasan, K. R. (2025) · Sadhana · doi:10.1007/s12046-024-02660-3 · Cited by 21
Overcoming synthesizer phase noise in quantum sensing
Long, G., Feng, G., & Sprenger, P. (2019) · Quantum Engineering · doi:10.1002/que2.27 · Cited by 20
Toward Cosmological Simulations of Dark Matter on Quantum Computers
Mocz, P., & Szasz, A. (2021) · The Astrophysical Journal · doi:10.3847/1538-4357/abe6ac · Cited by 21
Faster Quantum-inspired Algorithms for Solving Linear Systems
Shao, C., & Montanaro, A. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3520141 · Cited by 33
QUBO formulations for a system of linear equations
Jun, K. (2024) · Results in Control and Optimization · doi:10.1016/j.rico.2024.100380 · Cited by 25
Quantum Machine Learning Algorithm for Knowledge Graphs
Ma, Y., & Volker Tresp, C. (2021) · ACM Transactions on Quantum Computing · doi:10.1145/3467982 · Cited by 21
Advances in Quantum Computation and Quantum Technologies: A Design Automation Perspective
Micheli, G. D., Jiang, J.-H. R., Rand, R. W., Smith, K. N., & Soeken, M. (2022) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2022.3205174 · Cited by 23
Halder, D., Prasannaa, V. S., & Maitra, R. (2022) · The Journal of Chemical Physics · doi:10.1063/5.0114688 · Cited by 22
Rančić, M. J. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.l012021 · Cited by 19
BF-QC: Belief functions on quantum circuits
Zhou, Q., Tian, G., & Deng, Y. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.119885 · Cited by 22
New record in the number of qubits for a quantum implementation of AES
Li, Z., Gao, F., Qin, S., & Wen, Q. (2023) · Frontiers in Physics · doi:10.3389/fphy.2023.1171753 · Cited by 20
Automated Quantum Circuit Design With Nested Monte Carlo Tree Search
Wang, P., Usman, M., Parampalli, U., Hollenberg, L. C. L., & Myers, C. R. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3265709 · Cited by 25
Leong, F. Y., Koh, D. E., Ewe, W.-B., & Kong, J. F. (2023) · International Journal of Numerical Methods for Heat & Fluid Flow · doi:10.1108/hff-05-2023-0265 · Cited by 27
A quantum online portfolio optimization algorithm
Lim, D., & Rebentrost, P. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04256-6 · Cited by 21
Quantum Computing: Exploring Superposition and Entanglement for Cutting-Edge Applications
Parmar, S. J., Parmar, V. R., Verma, J. P. V., Roy, S., & Bhattacharya, P. (2023) · International Conference on Security of Information and Networks (SIN) · doi:10.1109/sin60469.2023.10474803 · Cited by 20
Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra
Wang, S., McArdle, S., & Berta, M. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020324 · Cited by 39
Transition role of entangled data in quantum machine learning
Wang, X., Du, Y., Tu, Z., Luo, Y., Yuan, X., & Tao, D. (2024) · Nature Communications · doi:10.1038/s41467-024-47983-1 · Cited by 30
Quantum support vector machine for multi classification
Li, X., Zhang, X., Li, M., & Shen, S. (2024) · Communications in Theoretical Physics · doi:10.1088/1572-9494/ad48fc · Cited by 20
Solving linear systems on quantum hardware with hybrid HHL++
Yalovetzky, R., Minssen, P., Herman, D., & Pistoia, M. (2024) · Scientific Reports · doi:10.1038/s41598-024-69077-0 · Cited by 27
Quantum computing and quantum-inspired techniques for feature subset selection: a review
Mandal, A. K., & Chakraborty, B. (2024) · Knowledge and Information Systems · doi:10.1007/s10115-024-02282-5 · Cited by 21
Quantum Leak: Timing Side-Channel Attacks on Cloud-Based Quantum Services
Lu, C., Telang, E., Aysu, A., & Basu, K. (2025) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1145/3716368.3735264 · Cited by 39
Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices
Ferrari, D., & Amoretti, M. (2018) · International Journal of Quantum Information · doi:10.1142/s0219749918400063 · Cited by 20
A Reaction Attack Against Cryptosystems Based on LRPC Codes
Samardjiska, S., Santini, P., Persichetti, E., & Banegas, G. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-30530-7_10 · Cited by 20
Simulating noisy variational quantum eigensolver with local noise models
Zeng, J., Wu, Z., Cao, C., Zhang, C., Hou, S., Xu, P., & Zeng, B. (2021) · Quantum Engineering · doi:10.1002/que2.77 · Cited by 24
Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems
Xiong, Y., Chandra, D., Ng, S. X., & Hanzo, L. (2020) · IEEE Access · doi:10.1109/access.2020.3045016 · Cited by 22
Big data classification with quantum multiclass SVM and quantum one-against-all approach
Bishwas, A. K., Mani, A., & Palade, V. (2016) · International Conference on Contemporary Computing and Informatics (IC3I) · doi:10.1109/ic3i.2016.7918805 · Cited by 20
Quantum Algorithms to Matrix MultiplicationPreprint
Shao, C. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.01601 · Cited by 24
Quantum algorithms for training Gaussian processes
Zhao, Z., Fitzsimons, J. K., Osborne, M. A., Roberts, S. J., & Fitzsimons, J. F. (2019) · Physical Review A · doi:10.1103/physreva.100.012304 · Cited by 19
Modeling Heterogeneous Catalysis Using Quantum Computers: An Academic and Industry Perspective
Hariharan, S., Kinge, S., & Visscher, L. (2024) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.4c01212 · Cited by 23
Quantum neural networks with data re-uploading for urban traffic time series forecasting
Schetakis, N. A., Bonfini, P., Alisoltani, N., Blazakis, K. V., Tsintzos, S. I., Askitopoulos, A., Aghamalyan, D., Fafoutellis, P., & Vlahogianni, E. I. (2025) · Scientific Reports · doi:10.1038/s41598-025-04546-8 · Cited by 34
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
