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 301–400 of 1,006
Variational Quantum Singular Value Decomposition
Wang, X., Song, Z., & Wang, Y. (2021) · Quantum · doi:10.22331/q-2021-06-29-483 · Cited by 80
Resilience of Quantum Random Access Memory to Generic Noise
Hann, C. T., Lee, G., Girvin, S. M., & Jiang, L. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020311 · Cited by 91
Campos, J., & Souto, A. (2021) · IEEE/ACM International Workshop on Quantum Software Engineering (Q-SE) · doi:10.1109/q-se52541.2021.00013 · Cited by 74
Feng, F., Zhou, Y., & Zhang, P. (2021) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2021.3077382 · Cited by 69
Near-term quantum algorithms for linear systems of equations with regression loss functions
Huang, H.-Y., Bharti, K., & Rebentrost, P. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac325f · Cited by 193
Machine learning for anomaly detection in particle physics
Belis, V., Odagiu, P., & Aarrestad, T. K. (2024) · Reviews in Physics · doi:10.1016/j.revip.2024.100091 · Cited by 111
Quantum Computing in Big Data Analytics: A Survey
Shaikh, T. A., & Ali, R. (2016) · IEEE International Conference on Computer and Information Technology (CIT) · doi:10.1109/cit.2016.79 · Cited by 70
Classification with Quantum Machine Learning: A Survey
Abohashima, Z., Elhosen, M., Houssein, E. H., & Mohamed, W. M. (2020) · arXiv · doi:10.48550/arxiv.2006.12270 · Cited by 68
Quantum computing for fluids: Where do we stand?
Sauro Succi, A., Itani, W., Sreenivasan, K. R., & Steijl, R. (2023) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/acfdc7 · Cited by 68
Kernel methods in Quantum Machine Learning
Mengoni, R., & Pierro, A. D. (2019) · Quantum Machine Intelligence · doi:10.1007/s42484-019-00007-4 · Cited by 73
Fujii, K., Mizuta, K., Ueda, H., Mitarai, K., Mizukami, W., & Nakagawa, Y. O. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010346 · Cited by 83
Input Redundancy for Parameterized Quantum Circuits
Vidal, F. J. G., & Theis, D. O. (2020) · Frontiers in Physics · doi:10.3389/fphy.2020.00297 · Cited by 88
Variational quantum algorithm based on the minimum potential energy for solving the Poisson equation
Sato, Y., Kondo, R., Koide, S., Takamatsu, H., & Imoto, N. (2021) · Physical Review A · doi:10.1103/physreva.104.052409 · Cited by 67
Representation Learning via Quantum Neural Tangent Kernels
Liu, J., Tacchino, F., Glick, J. R., Jiang, L., & Mezzacapo, A. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030323 · Cited by 81
Coherence as a Resource for Shor’s Algorithm
Ahnefeld, F., Theurer, T., Egloff, D., Matera, J. M., & Plenio, M. B. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.120501 · Cited by 69
Quantum KNN Classification With K Value Selection and Neighbor Selection
Li, J., Zhang, J., Zhang, J., & Zhang, S. (2023) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2023.3345251 · Cited by 71
Reconstruction of a Photonic Qubit State with Reinforcement Learning
Yu, S., Albarrán-Arriagada, F., Retamal, J. C., Wang, Y., Liu, W., Ke, Z., Meng, Y., Li, Z., Tang, J., Solano, E., et al. (2019) · Advanced Quantum Technologies · doi:10.1002/qute.201800074 · Cited by 69
Fujii, K., Mizuta, K., Ueda, H., Mitarai, K., Mizukami, W., & Nakagawa, Y. O. (2020) · arXiv · doi:10.48550/arxiv.2007.10917 · Cited by 66
Toward pricing financial derivatives with an IBM quantum computer
Martin, A., Candelas, B., Rodríguez-Rozas, Á., Martín-Guerrero, J. D., Chen, X., Lamata, L., Orús, R., Solano, E., & Sanz, M. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013167 · Cited by 74
Quantum algorithm for the Vlasov equation
Engel, A., Smith, G., & Parker, S. (2019) · Physical Review A · doi:10.1103/physreva.100.062315 · Cited by 75
Budinski, L. (2022) · International Journal of Quantum Information · doi:10.1142/s0219749921500398 · Cited by 96
Devadas, R. M., & Sowmya, T. (2025) · MethodsX · doi:10.1016/j.mex.2025.103318 · Cited by 90
Quantum circuit design for solving linear systems of equations
Cao, Y., Daskin, A., Frankel, S., & Kais, S. (2012) · Molecular Physics · doi:10.1080/00268976.2012.668289 · Cited by 65
A quantum algorithm to solve nonlinear differential equations
Leyton, S. K., & Osborne, T. J. (2008) · arXiv · doi:10.48550/arxiv.0812.4423 · Cited by 65
Quantum algorithm for support matrix machines
Duan, B., Yuan, J., Liu, Y., & Li, D. (2017) · Physical Review A · doi:10.1103/physreva.96.032301 · Cited by 65
Penalty methods for a variational quantum eigensolver
Kuroiwa, K., & Nakagawa, Y. O. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013197 · Cited by 76
The Quantum software lifecycle
Weder, B., Barzen, J., Leymann, F., Salm, M., & Vietz, D. (2020) · doi:10.1145/3412451.3428497 · Cited by 69
QFAST: Conflating Search and Numerical Optimization for Scalable Quantum Circuit Synthesis
Younis, E., Sen, K., Yelick, K., & Iancu, C. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00041 · Cited by 66
Review of medical image processing using quantum-enabled algorithms
Yan, F., Huang, H., Witold Pedrycz, C., & Hirota, K. (2024) · Artificial Intelligence Review · doi:10.1007/s10462-024-10932-x · Cited by 76
Paulihedral: a generalized block-wise compiler optimization framework for Quantum simulation kernels
Li, G., Wu, A., Shi, Y., Javadi-Abhari, A., Ding, Y., & Xie, Y. (2022) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3503222.3507715 · Cited by 85
Benchmarking adversarially robust quantum machine learning at scale
West, M. T., Erfani, S., Leckie, C. A., Sevior, M. E., Hollenberg, L. C. L., & Usman, M. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023186 · Cited by 78
Optimizing Quantum Circuits for ArithmeticPreprint
Häner, T., Roetteler, M., & Svore, K. M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.12445 · Cited by 84
Quantum plug n’ play: modular computation in the quantum regime
Thompson, J. E., Modi, K. K., Vedral, V., & Gu, M. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa99b3 · Cited by 64
Quantum Machine Learning in Healthcare: Developments and Challenges
Rani, S., Pareek, P. K., Kaur, J., Chauhan, M., & Bhambri, P. (2023) · International Conference on Integrated Circuits and Communication Systems (ICICACS) · doi:10.1109/icicacs57338.2023.10100075 · Cited by 69
Quantum Fourier Transform Has Small Entanglement
Chen, J., Stoudenmire, E. M., & White, S. R. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.040318 · Cited by 88
Quantum-enhanced magnetometry by phase estimation algorithms with a single artificial atom
Danilin, S., Lebedev, A. V., Vepsäläinen, A. P., Lesovik, G. B., Blatter, G., & Paraoanu, G. S. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0078-y · Cited by 67
Towards practical applications in quantum computational biology
Fedorov, A. K., & Gelfand, M. S. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00024-z · Cited by 62
Mutation Testing of Quantum Programs: A Case Study With Qiskit
Fortunato, D., Campos, J., & Abreu, R. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3195061 · Cited by 82
Time-marching based quantum solvers for time-dependent linear differential equations
Fang, D., Lin, L., & Tong, Y. (2023) · Quantum · doi:10.22331/q-2023-03-20-955 · Cited by 91
Ambainis, A. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1010.4458 · Cited by 62
Quantum Optimization: Potential, Challenges, and the Path Forward
Abbas, A., (NNSA), U. N. N. S. A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D., et al. (2023) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/2229681 · Cited by 65
Beyond the Swap Test: Optimal Estimation of Quantum State Overlap
Fanizza, M., Rosati, M., Skotiniotis, M., Calsamiglia, J., & Giovannetti, V. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.060503 · Cited by 62
An Automated Deductive Verification Framework for Circuit-building Quantum Programs
Chareton, C., Bardin, S., Bobot, F., Perrelle, V., & Valiron, B. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-72019-3_6 · Cited by 86
Experimental Quantum Principal Component Analysis via Parametrized Quantum Circuits
Xin, T., Che, L., Cheng, X., Singh, A., Nie, X., Li, J., Dong, Y., & Lu, D. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.110502 · Cited by 62
Quantum Machine Learning for Finance ICCAD Special Session Paper
Pistoia, M., Farhan, S., Ajagekar, A., Buts, A., Chakrabarti, S., Herman, D., Hu, S., Jena, A., Minssen, P., Niroula, P., et al. (2021) · International Conference on Computer Aided Design · doi:10.1109/iccad51958.2021.9643469 · Cited by 80
Quantum Support Vector Machine for Classifying Noisy Data
Li, J., Li, Y., Song, J., Zhang, J., & Zhang, S. (2024) · IEEE Transactions on Computers · doi:10.1109/tc.2024.3416619 · Cited by 69
Quantum Simulation of Partial Differential Equations via Schrödingerization
Jin, S., Liu, N., & Yu, Y. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.230602 · Cited by 128
Quantum machine learning algorithms for anomaly detection: A review
Corli, S., Moro, L., Dragoni, D., Dispenza, M., & Prati, E. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.107632 · Cited by 81
Optimized surface code communication in superconducting quantum computers
Javadi-Abhari, A., Gokhale, P., Holmes, A. A., Franklin, D. M., Brown, K. R., Martonosi, M., & Chong, F. T. (2017) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3123939.3123949 · Cited by 69
An, D., Linden, N., Liu, J.-P., Montanaro, A., Shao, C., & Wang, J. (2021) · Quantum · doi:10.22331/q-2021-06-24-481 · Cited by 74
Nearly tight Trotterization of interacting electrons
Su, Y., Huang, H.-Y., & Campbell, E. T. (2021) · Quantum · doi:10.22331/q-2021-07-05-495 · Cited by 79
Resilience of Quantum Random Access Memory to Generic Noise
Hann, C. T., Lee, G., Girvin, S. M., & Jiang, L. (2021) · University of Chicago · doi:10.6082/027wm-z2x67 · Cited by 57
Schetakis, N. A., Aghamalyan, D., Griffin, P., & Boguslavsky, M. (2022) · Scientific Reports · doi:10.1038/s41598-022-14876-6 · Cited by 79
Subspace variational quantum simulator
Heya, K., Nakanishi, K. M., Mitarai, K., Yan, Z., Zuo, K., Suzuki, Y., Sugiyama, T., Tamate, S., Tabuchi, Y., Fujii, K., et al. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023078 · Cited by 76
Classification of the MNIST data set with quantum slow feature analysis
Kerenidis, I., & Luongo, A. (2020) · Physical Review A · doi:10.1103/physreva.101.062327 · Cited by 83
Quantum-enhanced magnetometry by phase estimation algorithms with a single artificial atom
Danilin, S., Lebedev, A. V., Vepsäläinen, A. P., Lesovik, G. B., Blatter, G., & Paraoanu, S. (2018) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-b-000276430 · Cited by 60
Quantum Image Processing: Opportunities and Challenges
Ruan, Y., Xue, X., & Shen, Y. (2021) · Mathematical Problems in Engineering · doi:10.1155/2021/6671613 · Cited by 64
Quantum Computing Opportunities in Renewable Energy
Giani, A., & Eldredge, Z. (2021) · SN Computer Science · doi:10.1007/s42979-021-00786-3 · Cited by 68
An Enhanced Quantum K-Nearest Neighbor Classification Algorithm Based on Polar Distance
Feng, C., Zhao, B., Zhou, X., Ding, X., & Shan, Z. (2023) · Entropy · doi:10.3390/e25010127 · Cited by 70
Exponential Quantum Speedup in Simulating Coupled Classical Oscillators
Babbush, R., Berry, D. W., Kothari, R., Somma, R. D., & Wiebe, N. (2023) · Physical Review X · doi:10.1103/physrevx.13.041041 · Cited by 63
The Complexity of Computations
Pudlák, P. (2013) · Springer monographs in mathematics · doi:10.1007/978-3-319-00119-7_5 · Cited by 57
Quantum Driven Machine Learning
Saini, S., Khosla, P. K., Kaur, M., & Singh, G. (2020) · International Journal of Theoretical Physics · doi:10.1007/s10773-020-04656-1 · Cited by 61
Expanding Data Encoding Patterns For Quantum Algorithms
Weigold, M., Barzen, J., Leymann, F., & Salm, M. (2021) · IEEE International Conference on Software Architecture Companion (ICSA-C) · doi:10.1109/icsa-c52384.2021.00025 · Cited by 67
Two-dimensional color-code quantum computation
Fowler, A. G. (2011) · Physical Review A · doi:10.1103/physreva.83.042310 · Cited by 58
Quantum algorithm for visual tracking
Yu, C., Gao, F., Liu, C., Huynh, D. Q., Reynolds, M. A., & Wang, J. B. (2019) · Physical Review A · doi:10.1103/physreva.99.022301 · Cited by 59
Asymptotic quantum algorithm for the Toeplitz systems
Wan, L., Yu, C., Pan, S., Gao, F., Wen, Q., & Qin, S. (2018) · Physical Review A · doi:10.1103/physreva.97.062322 · Cited by 60
Beyond Bits: A Review of Quantum Embedding Techniques for Efficient Information Processing
Khan, M. A., Aman, M. N., & Sikdar, B. (2024) · IEEE Access · doi:10.1109/access.2024.3382150 · Cited by 67
Advances in quantum machine learningPreprint
Adcock, J. C., Allen, E. J., Day, M., Frick, S., Hinchliff, J. J., Johnson, M., Morley-Short, S., Pallister, S., Price, A. B., & Stanisic, S. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.02900 · Cited by 103
The Inductive Bias of Quantum KernelsPreprint
Kübler, J. M., Buchholz, S., & Schölkopf, B. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.03747 · Cited by 64
On applications of quantum computing to plasma simulations
Dodin, I. Y., & Startsev, E. A. (2021) · Physics of Plasmas · doi:10.1063/5.0056974 · Cited by 57
Quantum Support Vector Machine Algorithms for Remote Sensing Data Classification
Delilbasic, A., Cavallaro, G., Willsch, M., Melgani, F., Riedel, M., & Michielsen, K. F. L. (2021) · IEEE International Geoscience and Remote Sensing Symposium (IGARSS) · doi:10.1109/igarss47720.2021.9554802 · Cited by 58
A Leap among Quantum Computing and Quantum Neural Networks: A Survey
Massoli, F. V., Vadicamo, L., Amato, G. M., & Falchi, F. (2022) · ACM Computing Surveys · doi:10.1145/3529756 · Cited by 78
Kosugi, T., Nishiya, Y., Nishi, H., & Matsushita, Y. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033121 · Cited by 75
Quantum Computers for Weather and Climate Prediction: The Good, the Bad, and the Noisy
Tennie, F., & Palmer, T. N. (2023) · Bulletin of the American Meteorological Society · doi:10.1175/bams-d-22-0031.1 · Cited by 56
Demonstration of Algorithmic Quantum Speedup
Pokharel, B., & Lidar, D. A. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.210602 · Cited by 66
Itani, W., Sreenivasan, K. R., & Succi, S. (2024) · Physics of Fluids · doi:10.1063/5.0176569 · Cited by 58
A Perspective on Protein Structure Prediction Using Quantum Computers
Doğa, H., Raubenolt, B. A., Cumbo, F., Joshi, J., DiFilippo, F. P., Qin, J., Blankenberg, D. J., & Shehab, O. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c00067 · Cited by 67
Quantum Phase Estimation with Time‐Frequency Qudits in a Single Photon
Lu, H., Hu, Z., Alshaykh, M. S., Moore, A. J., Wang, Y., Imany, P., Weiner, A. M., & Kais, S. (2019) · Advanced Quantum Technologies · doi:10.1002/qute.201900074 · Cited by 60
Quantum inverse iteration algorithm for programmable quantum simulators
Kyriienko, O. (2020) · npj Quantum Information · doi:10.1038/s41534-019-0239-7 · Cited by 66
The theory of the quantum kernel-based binary classifier
Park, D. K., Blank, C., & Petruccione, F. (2020) · Physics Letters A · doi:10.1016/j.physleta.2020.126422 · Cited by 61
Quantum Computing: An Overview Across the System StackPreprint
Resch, S., & Karpuzcu, U. R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.07240 · Cited by 94
Quantum machine learning and quantum biomimetics: A perspective
Lamata, L. (2020) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ab9803 · Cited by 59
Quantum computing for future real-time building HVAC controls
Deng, Z., Wang, X., & Dong, B. (2023) · Applied Energy · doi:10.1016/j.apenergy.2022.120621 · Cited by 59
Jin, S., Liu, N., & Yu, Y. (2022) · Journal of Computational Physics · doi:10.1016/j.jcp.2023.112149 · Cited by 67
Integrating quantum computing resources into scientific HPC ecosystems
Beck, T. L., Baroni, A., Bennink, R. S., Buchs, G., Pérez, E. A. C., Eisenbach, M., da Silva, R. F., Meena, M. G., Gottiparthi, K., Groszkowski, P., et al. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.06.058 · Cited by 82
Wang, Z., & Wang, X. (2025) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.70073 · Cited by 56
Quantum algorithms and circuits for scientific computing
Bhaskar, M. K., Hadfield, S., Papageorgiou, A., & Petras, I. (2016) · Quantum Information and Computation · doi:10.26421/qic16.3-4-2 · Cited by 55
Ozols, M., Roetteler, M., & Roland, J. (2013) · ACM Transactions on Computation Theory · doi:10.1145/2493252.2493256 · Cited by 60
Hybrid Quantum Computing with Conditional Beam Splitter Gate in Trapped Ion System
Gan, J., Maslennikov, G., Tseng, K.-W., Nguyen, C. H., & Matsukevich, D. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.170502 · Cited by 57
A path towards quantum advantage in training deep generative models with quantum annealers
Vinci, W., Buffoni, L., Sadeghi, H., Khoshaman, A. H., Andriyash, E., & Amin, M. H. S. (2020) · Machine Learning Science and Technology · doi:10.1088/2632-2153/aba220 · Cited by 59
Efficient Quantum Circuits for Accurate State Preparation of Smooth, Differentiable Functions
Holmes, A. A., & Matsuura, A. Y. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00030 · Cited by 55
Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits
Wiebe, N., & Roetteler, M. (2016) · Quantum Information and Computation · doi:10.26421/qic16.1-2-9 · Cited by 61
Quantum algorithm and quantum circuit for A-optimal projection: Dimensionality reduction
Duan, B., Yuan, J., Xu, J., & Li, D. (2019) · Physical Review A · doi:10.1103/physreva.99.032311 · Cited by 54
Quantum SDP-Solvers: Better Upper and Lower Bounds
van Apeldoorn, J., Gilyén, A., Gribling, S., & de Wolf, R. (2017) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2017.44 · Cited by 55
Boundaries of quantum supremacy via random circuit sampling
Zlokapa, A., Villalonga, B., Boixo, S., & Lidar, D. A. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00703-x · Cited by 66
Quantum Computing: Towards Industry Reference Problems
Luckow, A., Klepsch, J., & Pichlmeier, J. (2021) · Digitale Welt · doi:10.1007/s42354-021-0335-7 · Cited by 56
Machine learning \& artificial intelligence in the quantum domainPreprint
Dunjko, V., & Briegel, H. J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.02779 · Cited by 54
Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search
Li, S., Zhou, X., & Feng, Y. (2020) · IEEE Transactions on Computers · doi:10.1109/tc.2020.3023247 · Cited by 57
Quantum Machine Learning in Drug Discovery: Applications in Academia and Pharmaceutical Industries
Smaldone, A. M., Shee, Y., Kyro, G. W., Xu, C., Vu, N. P., Dutta, R., Farag, M. H., Galda, A., Kumar, S., Kyoseva, E. S., et al. (2025) · Chemical Reviews · doi:10.1021/acs.chemrev.4c00678 · Cited by 74
Wen, J., Kong, X., Wei, S., Wang, B.-X., Xin, T., & Long, G. (2019) · Physical Review A · doi:10.1103/physreva.99.012320 · Cited by 53
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
