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 101–200 of 1,006
Quantum variational autoencoder
Khoshaman, A., Vinci, W., Denis, B., Andriyash, E., Sadeghi, H., & Amin, M. H. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aada1f · Cited by 218
Efficient Bayesian Phase Estimation
Wiebe, N., & Granade, C. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.010503 · Cited by 215
Quantum Image Processing and Its Application to Edge Detection: Theory and Experiment
Yao, X., Wang, H., Liao, Z., Chen, M.-C., Pan, J., Li, J., Zhang, K., Lin, X., Wang, ., Luo, Z., et al. (2017) · Physical Review X · doi:10.1103/physrevx.7.031041 · Cited by 200
Faster quantum simulation by randomization
Childs, A. M., Ostrander, A., & Su, Y. (2019) · Quantum · doi:10.22331/q-2019-09-02-182 · Cited by 222
Machine learning meets quantum physics
Sarma, S. D., Deng, D.-L., & Duan, L.-M. (2019) · Physics Today · doi:10.1063/pt.3.4164 · Cited by 201
Quantum algorithms and the finite element method
Montanaro, A., & Pallister, S. (2016) · Physical Review A · doi:10.1103/physreva.93.032324 · Cited by 192
Ajagekar, A., Humble, T., & You, F. (2020) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2019.106630 · Cited by 191
“This is evident from QC techniques like Shor’s algorithm for integer factorization [11], Grover’s search algorithm for unstructured databases [12], quantum algorithm for linear system of equations [13], and many more [14].”
Method0.5 petabyte simulation of a 45-qubit quantum circuit
Häner, T., & Steiger, D. S. (2017) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3126908.3126947 · Cited by 213
Quantum-inspired support vector machine
Ding, C., Bao, T.-Y., & Huang, H.-L. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3084467 · Cited by 186
Solving nonlinear differential equations with differentiable quantum circuits
Kyriienko, O., Paine, A. E., & Elfving, V. E. (2021) · Physical Review A · doi:10.1103/physreva.103.052416 · Cited by 185
QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation
Li, A., Stein, S., Krishnamoorthy, S., & Ang, J. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3550488 · Cited by 183
Quantum Algorithms for Systems of Linear Equations Inspired by Adiabatic Quantum Computing
Subaşı, Y., Somma, R. D., & Orsucci, D. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.060504 · Cited by 183
Quantum Hopfield neural network
Rebentrost, P., Bromley, T. R., Weedbrook, C., & Lloyd, S. (2018) · Physical Review A · doi:10.1103/physreva.98.042308 · Cited by 187
Self-citationQuantum technology for military applications
Krelina, M. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00113-y · Cited by 237
Quantum gradient descent for linear systems and least squares
Kerenidis, I., & Prakash, A. (2020) · Physical Review A · doi:10.1103/physreva.101.022316 · Cited by 177
Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
Zhang, X., Li, T., & Yuan, X. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.230504 · Cited by 245
NISQ computing: where are we and where do we go?
Lau, J. W. Z., Lim, K. H., Shrotriya, H., & Kwek, L. C. (2022) · AAPPS bulletin · doi:10.1007/s43673-022-00058-z · Cited by 199
Experimental Quantum Computing to Solve Systems of Linear Equations
Cai, X.-D., Weedbrook, C., Su, Z.-E., Chen, M.-C., Gu, M., Zhu, M.-J., Li, L., Liu, N.-L., Lu, C.-Y., & Pan, J.-W. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.230501 · Cited by 173
Supervised quantum machine learning models are kernel methods
Schuld, M. (2021) · arXiv · doi:10.48550/arxiv.2101.11020 · Cited by 173
Hardware-Efficient Quantum Random Access Memory with Hybrid Quantum Acoustic Systems
Hann, C. T., Zou, C., Zhang, Y., Chu, Y., Schoelkopf, R. J., Girvin, S. M., & Jiang, L. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.250501 · Cited by 182
Variational algorithms for linear algebra
Xu, X., Sun, J., Endo, S., Li, Y., Benjamin, S. C., & Yuan, X. (2021) · 中国科学通报：英文版 · doi:10.1016/j.scib.2021.06.023 · Cited by 195
LIQUi|>: A Software Design Architecture and Domain-Specific Language for Quantum ComputingPreprint
Wecker, D., & Svore, K. (2014) · arXiv.org · doi:10.48550/arxiv.1402.4467 · Cited by 218
Quantum Computing and Communications
Imre, S., & Balázs, F. (2004) · Wiley eBooks · doi:10.1002/9780470869048 · Cited by 167
Quantum computing at the frontiers of biological sciences
Emani, P. S., Warrell, J., Anticevic, A., Bekiranov, S., Gandal, M., McConnell, M. J., Sapiro, G., Aspuru-Guzik, A., Baker, J. T., Bastiani, M., et al. (2021) · Nature Methods · doi:10.1038/s41592-020-01004-3 · Cited by 163
Self-citationQuantum generative adversarial network for generating discrete distribution
Situ, H., He, Z., Wang, Y., Li, L., & Zheng, S. (2020) · Information Sciences · doi:10.1016/j.ins.2020.05.127 · Cited by 190
Quantum algorithm for simulating the wave equation
Costa, P. C. S., Jordan, S. P., & Ostrander, A. (2019) · Physical Review A · doi:10.1103/physreva.99.012323 · Cited by 159
Rietsche, R., Dremel, C., Bosch, S., Steinacker, L., Meckel, M., & Leimeister, J. M. (2022) · Electronic Markets · doi:10.1007/s12525-022-00570-y · Cited by 171
Do We Really Understand Quantum Mechanics?
Laloë, F. (2012) · Cambridge University Press eBooks · doi:10.1017/9781108569361 · Cited by 171
Green, A. S., Lumsdaine, P. L., Ross, N. J., Selinger, P., & Valiron, B. (2013) · ACM SIGPLAN Notices · doi:10.1145/2499370.2462177 · Cited by 191
Machine learning in the quantum realm: The state-of-the-art, challenges, and future vision
Houssein, E. H., Abohashima, Z., Elhoseny, M., & Mohamed, W. M. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.116512 · Cited by 166
The Born supremacy: quantum advantage and training of an Ising Born machine
Coyle, B., Mills, D., Danos, V., & Kashefi, E. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00288-9 · Cited by 155
High-precision quantum algorithms for partial differential equations
Childs, A. M., Liu, J.-P., & Ostrander, A. (2021) · Quantum · doi:10.22331/q-2021-11-10-574 · Cited by 211
Grover Adaptive Search for Constrained Polynomial Binary Optimization
Gilliam, A., Woerner, S., & Gonciulea, C. (2021) · Quantum · doi:10.22331/q-2021-04-08-428 · Cited by 153
Silq: a high-level quantum language with safe uncomputation and intuitive semantics
Bichsel, B., Baader, M., Gehr, T., & Vechev, M. (2020) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3385412.3386007 · Cited by 154
Guest Column: A Survey of Quantum Learning Theory
Arunachalam, S., & de Wolf, R. (2017) · ACM SIGACT News · doi:10.1145/3106700.3106710 · Cited by 152
Quantum adversarial machine learning
Lu, S., Duan, L.-M., & Deng, D.-L. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033212 · Cited by 187
Quantum machine learning for chemistry and physics
Sajjan, M., Li, J., Selvarajan, R., Sureshbabu, S. H., Kale, S. S., Gupta, R., Singh, V., & Kais, S. (2022) · Chemical Society Reviews · doi:10.1039/d2cs00203e · Cited by 173
Circuit-Based Quantum Random Access Memory for Classical Data
Park, D. K., Petruccione, F., & Rhee, J.-K. K. (2019) · Scientific Reports · doi:10.1038/s41598-019-40439-3 · Cited by 151
On the robustness of bucket brigade quantum RAM
Arunachalam, S., Gheorghiu, V., Jochym-O’Connor, T., Mosca, M., & Srinivasan, P. V. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/12/123010 · Cited by 147
Machine learning method for state preparation and gate synthesis on photonic quantum computers
Arrazola, J. M., Bromley, T. R., Izaac, J., Myers, C. R., Brádler, K., & Killoran, N. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aaf59e · Cited by 153
Recent advances in quantum machine learning
Zhang, Y., & Ni, Q. (2020) · Quantum Engineering · doi:10.1002/que2.34 · Cited by 163
A quantum machine learning algorithm based on generative models
Gao, X.-S., Zhang, Z., & Duan, L. (2018) · Science Advances · doi:10.1126/sciadv.aat9004 · Cited by 177
Quantum Search Algorithms for Wireless Communications
Botsinis, P., Alanis, D., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2882385 · Cited by 149
Experimental verification of quantum computation
Barz, S., Fitzsimons, J. F., Kashefi, E., & Walther, P. J. (2013) · Nature Physics · doi:10.1038/nphys2763 · Cited by 149
Focus beyond Quadratic Speedups for Error-Corrected Quantum Advantage
Babbush, R., McClean, J. R., Newman, M., Gidney, C., Boixo, S., & Neven, H. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010103 · Cited by 148
Quantum algorithm for linear regression
Wang, G. (2017) · Physical Review A · doi:10.1103/physreva.96.012335 · Cited by 145
Quantum machine learning for quantum anomaly detection
Liu, N., & Rebentrost, P. (2018) · Physical Review A · doi:10.1103/physreva.97.042315 · Cited by 161
SupermarQ: A Scalable Quantum Benchmark Suite
Tomesh, T., Gokhale, P., Omole, V., Ravi, G. S., Smith, K. N., Viszlai, J., Wu, X.-C., Hardavellas, N., Martonosi, M., & Chong, F. T. (2022) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca53966.2022.00050 · Cited by 184
Ajagekar, A., & You, F. (2022) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2022.112493 · Cited by 164
Computational advantage of quantum random sampling
Hangleiter, D., & Eisert, J. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.035001 · Cited by 145
Quantum eigenvalue estimation via time series analysis
Somma, R. D. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab5c60 · Cited by 137
Efficient phase-factor evaluation in quantum signal processing
Dong, Y., Meng, X., Whaley, K. B., & Lin, L. (2021) · Physical Review A · doi:10.1103/physreva.103.042419 · Cited by 142
Tang, E. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.060503 · Cited by 140
Möller, M., & Vuik, C. (2017) · Ethics and Information Technology · doi:10.1007/s10676-017-9438-0 · Cited by 157
Quantum-inspired algorithms in practice
Arrazola, J. M., Delgado, A., Bardhan, B. R., & Lloyd, S. (2020) · Quantum · doi:10.22331/q-2020-08-13-307 · Cited by 179
Self-citationQuantum singular-value decomposition of nonsparse low-rank matrices
Rebentrost, P., Steffens, A., Marvian, I., & Lloyd, S. (2018) · Physical Review A · doi:10.1103/physreva.97.012327 · Cited by 132
Self-citationQuantum Spectral Methods for Differential Equations
Childs, A. M., & Liu, J.-P. (2020) · Communications in Mathematical Physics · doi:10.1007/s00220-020-03699-z · Cited by 133
Quantum discriminant analysis for dimensionality reduction and classification
Cong, I., & Duan, L. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/7/073011 · Cited by 131
Quantum machine learning in high energy physics
Guan, W., Perdue, G., Pesah, A. C., Schuld, M., Terashi, K., Vallecorsa, S., & Vlimant, J.-R. (2020) · Machine Learning Science and Technology · doi:10.1088/2632-2153/abc17d · Cited by 152
Quantum gradient descent and Newton’s method for constrained polynomial optimization
Rebentrost, F. P., & Lloyd, S. (2019) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 130
Self-citationMachine-Learning-Assisted Many-Body Entanglement Measurement
Gray, J., Banchi, L., Bayat, A., & Bose, S. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.150503 · Cited by 137
Variational quantum algorithm for the Poisson equation
Liu, H., Wu, Y., Wan, L., Pan, S., Qin, S., Gao, F., & Wen, Q. (2021) · Physical Review A · doi:10.1103/physreva.104.022418 · Cited by 130
Noisy intermediate-scale quantum computers
Cheng, B., Deng, X., Gu, X. Q., He, Y., Hu, G., Huang, P., Li, J., Lin, B., Lu, D., Lu, Y., et al. (2023) · Frontiers of Physics · doi:10.1007/s11467-022-1249-z · Cited by 147
Johnson, T. H., Clark, S. R., & Jaksch, D. (2014) · EPJ Quantum Technology · doi:10.1140/epjqt10 · Cited by 127
Variational Quantum Fidelity Estimation
Cerezo, M., Poremba, A., Cincio, Ł., & Coles, P. J. (2020) · Quantum · doi:10.22331/q-2020-03-26-248 · Cited by 129
Quantum Information and Algorithms for Correlated Quantum Matter
Head-Marsden, K., Flick, J., Ciccarino, C. J., & Narang, P. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.0c00620 · Cited by 133
Bapst, V., Foini, L., Krząkała, F., Semerjian, G., & Zamponi, F. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.10.002 · Cited by 135
Quantum Computing and Simulations for Energy Applications: Review and Perspective
Paudel, H. P., Syamlal, M., Crawford, S. E., Lee, Y., Shugayev, R., Lu, P., Ohodnicki, P. R., Mollot, D., & Duan, Y. (2022) · ACS Engineering Au · doi:10.1021/acsengineeringau.1c00033 · Cited by 153
Suzuki, Y., Endo, S., Fujii, K., & Tokunaga, Y. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010345 · Cited by 154
Zhao, N. B., Zhang, H., Yang, X., Yan, J., & You, F. (2023) · Advances in Applied Energy · doi:10.1016/j.adapen.2023.100125 · Cited by 131
Bapst, V., Foini, L., Krząkała, F., Semerjian, G., & Zamponi, F. (2012) · HAL · Cited by 124
Black-box hamiltonian simulation and unitary implementationPreprint
Berry, D. W., & Childs, A. M. (2012) · doi:10.5555/2231036.2231040 · Cited by 122
Quantum Neuron: an elementary building block for machine learning on quantum computersPreprint
Cao, Y., Guerreschi, G. G., & Aspuru‐Guzik, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.11240 · Cited by 200
Machine Learning Algorithms in Quantum Computing: A Survey
Ramezani, S. B., Sommers, A., Manchukonda, H. K., Rahimi, S., & Amirlatifi, A. (2020) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn48605.2020.9207714 · Cited by 137
Optimal Scaling Quantum Linear-Systems Solver via Discrete Adiabatic Theorem
Costa, P. C. S., An, D., Sanders, Y. R., Su, Y., Babbush, R., & Berry, D. W. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.040303 · Cited by 190
Hamiltonian Simulation Using Linear Combinations of Unitary Operations
Childs, A. M., & Wiebe, N. (2012) · Quantum Information and Computation · doi:10.26421/qic12.11-12 · Cited by 119
Projection-based runtime assertions for testing and debugging Quantum programs
Li, G., Zhou, L., Yu, N., Ding, Y., Ying, M., & Xie, Y. (2020) · Proceedings of the ACM on Programming Languages · doi:10.1145/3428218 · Cited by 156
Quantum federated learning through blind quantum computing
Li, W., Lu, S., & Deng, D.-L. (2021) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-021-1753-3 · Cited by 134
Fault-Tolerant Resource Estimation of Quantum Random-Access Memories
Matteo, O. D., Gheorghiu, V., & Mosca, M. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.2965803 · Cited by 113
Disentangling Hype from Practicality: On Realistically Achieving Quantum Advantage
Hoefler, T., Häner, T., & Troyer, M. (2023) · Communications of the ACM · doi:10.1145/3571725 · Cited by 119
Schuld, M., & Petruccione, F. (2017) · Springer eBooks · doi:10.1007/978-1-4899-7687-1_913 · Cited by 112
Time-dependent Hamiltonian simulation with L 1 -norm scaling
Berry, D. W., Childs, A. M., Su, Y., Wang, X., & Wiebe, N. (2020) · Quantum · doi:10.22331/q-2020-04-20-254 · Cited by 133
Symmetry resolved entanglement: exact results in 1D and beyond
Fraenkel, S., & Goldstein, M. (2020) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/ab7753 · Cited by 116
Herrmann, J., Masot-Llima, S., Remm, A., Zapletal, P., McMahon, N. A., Scarato, C., Swiadek, F., Andersen, C. K., Hellings, C., Krinner, S., et al. (2022) · Nature Communications · doi:10.1038/s41467-022-31679-5 · Cited by 130
Hybrid Quantum–Classical Generative Adversarial Network for High-Resolution Image Generation
Tsang, S. L., West, M. T., Erfani, S., & Usman, M. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3319319 · Cited by 126
Black-Box Quantum State Preparation without Arithmetic
Sanders, Y. R., Low, G. H., Scherer, A., & Berry, D. W. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.020502 · Cited by 107
An, D., & Lin, L. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3498331 · Cited by 111
Experimental realization of quantum algorithm for solving linear systems of equations
Pan, J., Cao, Y., Yao, X., Li, Z., Ju, C., Chen, H., Peng, X., Kais, S., & Du, J. (2014) · Physical Review A · doi:10.1103/physreva.89.022313 · Cited by 110
Automated distribution of quantum circuits via hypergraph partitioning
Andrés-Martínez, P., & Heunen, C. (2019) · Physical Review A · doi:10.1103/physreva.100.032308 · Cited by 112
Chia, N.-H., Gilyén, A., Li, T., Lin, H.-H., Tang, E., & Wang, C. (2020) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3357713.3384314 · Cited by 106
Quantum Algorithm for Spectral Measurement with a Lower Gate Count
Poulin, D., Kitaev, A., Steiger, D. S., Hastings, M. B., & Troyer, M. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.010501 · Cited by 108
Chamola, V., Jolfaei, A., Chanana, V., Parashari, P., & Hassija, V. (2021) · Computer Communications · doi:10.1016/j.comcom.2021.05.019 · Cited by 117
Black-box Hamiltonian simulation and unitary implementation
Childs, A. M., & Berry, D. W. (2012) · Quantum Information and Computation · doi:10.26421/qic12.1-2-4 · Cited by 107
Implementing Grover’s Algorithm on the IBM Quantum Computers
Mandviwalla, A., Ohshiro, K., & Ji, B. (2018) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata.2018.8622457 · Cited by 108
Recurrent Quantum Neural NetworksPreprint
Bausch, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.14619 · Cited by 107
Benchmarking the performance of portfolio optimization with QAOA
Brandhofer, S., Braun, D., Dehn, V., Hellstern, G., Hüls, M., Ji, Y., Polian, I., Bhatia, A. S., & Wellens, T. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03766-5 · Cited by 106
Dynamics of charge-resolved entanglement after a local quench
Feldman, N., & Goldstein, M. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.100.235146 · Cited by 112
Quantum assisted Gaussian process regression
Zhao, Z., Fitzsimons, J. K., & Fitzsimons, J. (2015) · Physical Review A · doi:10.1103/physreva.99.052331 · Cited by 124
Quantum adversarial machine learning
Lu, S., Duan, L., & Deng, D. (2020) · MPG.PuRe (Max Planck Society) · Cited by 105
A comparison of various classical optimizers for a variational quantum linear solver
Pellow-Jarman, A., Sinayskiy, I., Pillay, A. W., & Petruccione, F. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03140-x · Cited by 105
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
