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 601–700 of 1,006
Quantum superposition inspired spiking neural network
Sun, Y., Zeng, Y., & Zhang, T. (2021) · iScience · doi:10.1016/j.isci.2021.102880 · Cited by 37
Double sparse quantum state preparation
Veras, T. M. L., da Silva, L. D., & da Silva, A. J. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03549-y · Cited by 44
Optimal Tuning of Quantum Generative Adversarial Networks for Multivariate Distribution Loading
Agliardi, G., & Prati, E. (2022) · Quantum Reports · doi:10.3390/quantum4010006 · Cited by 34
Quantum k -fold cross-validation for nearest neighbor classification algorithm
Li, J., Gao, F., Lin, S., Guo, M., Li, Y., Liu, H., Qin, S., & Wen, Q. (2022) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2022.128435 · Cited by 46
Quantum tomography using state-preparation unitaries
van Apeldoorn, J., Cornelissen, A., Gilyén, A., & Nannicini, G. (2023) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611977554.ch47 · Cited by 34
Two-Unitary Decomposition Algorithm and Open Quantum System Simulation
Suri, N., Barreto, J., Hadfield, S., Wiebe, N., Wudarski, F., & Marshall, J. (2023) · Quantum · doi:10.22331/q-2023-05-15-1002 · Cited by 37
Algebraic and Logical Methods in Quantum ComputationPreprint
Ross, N. J. (2015) · arXiv (Cornell University) · doi:10.4230/lipics.fscd.2018.3 · Cited by 40
Finding Angles for Quantum Signal Processing with Machine PrecisionPreprint
Chao, R., Ding, D., Gilyén, A., Huang, C., & Szegedy, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.02831 · Cited by 53
FEqa: Finite element computations on quantum annealers
Raisuddin, O. M., & De, S. (2022) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2022.115014 · Cited by 32
A Variational Quantum Linear Solver Application to Discrete Finite-Element Methods
Trahan, C. J., Loveland, M., Davis, N. A., & Ellison, E. (2023) · Entropy · doi:10.3390/e25040580 · Cited by 40
Programming Quantum Neural Networks on NISQ Systems: An Overview of Technologies and Methodologies
Markidis, S. (2023) · Entropy · doi:10.3390/e25040694 · Cited by 41
Quantum machine learning for natural language processing application
Pandey, S., Basisth, N. J., Sachan, T., Kumari, N., & Pakray, P. (2023) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2023.129123 · Cited by 45
Multivariate trace estimation in constant quantum depth
Quek, Y., Kaur, E., & Wilde, M. M. (2024) · Quantum · doi:10.22331/q-2024-01-10-1220 · Cited by 35
Support matrix machine: A review
Kumari, A. R., Akhtar, M., Shah, R., & Tanveer, M. (2024) · Neural Networks · doi:10.1016/j.neunet.2024.106767 · Cited by 38
Quantum Computing: Foundations, Architecture and Applications
Christopher Columbus, C., Krishnan, P. T., Elamaran, E., Arul, R., & Kumar, T. S. (2025) · Engineering Reports · doi:10.1002/eng2.70337 · Cited by 36
Experimental digital quantum simulation of temporal–spatial dynamics of interacting fermion system
Lu, Y., Feng, G., Li, Y., & Long, G. (2015) · 中国科学通报：英文版 · doi:10.1007/s11434-014-0712-9 · Cited by 32
EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
Berry, D. W., Childs, A. M., Cleve, R., Kothari, R., & Somma, R. D. (2017) · Forum of Mathematics Sigma · doi:10.1017/fms.2017.2 · Cited by 39
Digital-analog quantum algorithm for the quantum Fourier transform
Martin, A., Lamata Manuel, L., Solano, E., & Sanz, M. (2020) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · Cited by 33
Approximate quantum circuit synthesis using block encodings
Camps, D., & Beeumen, R. V. (2020) · Physical Review A · doi:10.1103/physreva.102.052411 · Cited by 33
Universal Adversarial Examples and Perturbations for Quantum Classifiers
Gong, W., & Deng, D.-L. (2021) · National Science Review · doi:10.1093/nsr/nwab130 · Cited by 39
Kottmann, K., Metz, F., Fraxanet, J., & Baldelli, N. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.043184 · Cited by 37
The Efficient Preparation of Normal Distributions in Quantum Registers
Rattew, A. G., Sun, Y., Minssen, P., & Pistoia, M. (2021) · Quantum · doi:10.22331/q-2021-12-23-609 · Cited by 36
Quantum homotopy perturbation method for nonlinear dissipative ordinary differential equations
Xue, C., Wu, Y.-C., & Guo, G. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac3eff · Cited by 40
Heisenberg-limited quantum phase estimation of multiple eigenvalues with few control qubits
Dutkiewicz, A., Terhal, B. M., & Brien, T. E. O. A. (2022) · Quantum · doi:10.22331/q-2022-10-06-830 · Cited by 32
Liu, Y. Y., Chen, Z., Shu, C., Chew, S. C., Khoo, B. C., Zhao, X., & Cui, Y. (2022) · Physics of Fluids · doi:10.1063/5.0121778 · Cited by 35
Efficient quantum circuits for arbitrary sparse unitaries
Jordan, S. P., & Wocjan, P. (2009) · Physical Review A · doi:10.1103/physreva.80.062301 · Cited by 31
Extreme Quantum Memory Advantage for Rare-Event Sampling
Aghamohammadi, C., Loomis, S. P., Mahoney, J. R., & Crutchfield, J. P. (2018) · Physical Review X · doi:10.1103/physrevx.8.011025 · Cited by 32
Proving Quantum Programs CorrectPreprint
Hietala, K., Rand, R., Hung, S.-H., Li, L., & Hicks, M. (2020) · arXiv (Cornell University) · doi:10.4230/lipics.itp.2021.21 · Cited by 54
Design and analysis of quantum powered support vector machines for malignant breast cancer diagnosis
Vashisth, S., Dhall, I., & Aggarwal, G. (2021) · Journal of Intelligent Systems · doi:10.1515/jisys-2020-0089 · Cited by 35
Efficient Quantum Algorithm for Nonlinear Reaction–Diffusion Equations and Energy Estimation
Liu, J.-P., An, D., Fang, D., Wang, J., Low, G. H., & Jordan, S. P. (2023) · Communications in Mathematical Physics · doi:10.1007/s00220-023-04857-9 · Cited by 67
Quantum computing basics, applications and future perspectives
Balamurugan, K. S., Sivakami, A., Mathankumar, M., Prasad, Y. J. D. S., & Ahmad, I. (2024) · Journal of Molecular Structure · doi:10.1016/j.molstruc.2024.137917 · Cited by 37
Quantum algorithm for time-dependent differential equations using Dyson series
Berry, D. W., & Costa, P. C. S. (2024) · Quantum · doi:10.22331/q-2024-06-13-1369 · Cited by 62
Aifer, M., Donatella, K., Gordon, M. H., Duffield, S., Ahle, T. D., Simpson, D., Crooks, G. E., & Coles, P. J. (2024) · npj Unconventional Computing · doi:10.1038/s44335-024-00014-0 · Cited by 32
Quantum-enhanced feature selection with forward selection and backward elimination
He, Z., Li, L., Huang, Z., & Situ, H. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1924-8 · Cited by 33
Quantum-Teleportation-Inspired Algorithm for Sampling Large Random Quantum Circuits
Chen, M.-C., Li, R., Gan, L., Zhu, X., Yang, G., Lu, C., & Pan, J.-W. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.080502 · Cited by 33
Quantum Technology for Economists
Hull, I., Sattath, O., Diamanti, E., & Wendin, G. P. (2020) · Contributions to economics · doi:10.1007/978-3-031-50780-9 · Cited by 36
Fock state-enhanced expressivity of quantum machine learning models
Gan, B. Y., Leykam, D., & Angelakis, D. G. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00135-0 · Cited by 43
Problem-Dependent Power of Quantum Neural Networks on Multiclass Classification
Du, Y., Yang, Y., Tao, D., & Hsieh, M.-H. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.140601 · Cited by 45
Protecting expressive circuits with a quantum error detection code
Self, C. N., Benedetti, M., & Amaro, D. (2024) · Nature Physics · doi:10.1038/s41567-023-02282-2 · Cited by 31
Quantum dimensionality reduction by linear discriminant analysis
Yu, K., Lin, S., & Guo, G. (2023) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2023.128554 · Cited by 32
Climate Change Through Quantum Lens: Computing and Machine Learning
Rahman, S. M., Alkhalaf, O. H., Alam, M. S., Tiwari, S. P., Shafiullah, M., Al-Judaibi, S. M., & Al–Ismail, F. S. (2024) · Earth Systems and Environment · doi:10.1007/s41748-024-00411-2 · Cited by 35
Simulating unsteady flows on a superconducting quantum processor
Meng, Z., Zhong, J., Xu, S., Wang, K., Chen, J., Jin, F., Zhu, X., Gao, Y., Wu, Y., Zhang, C., et al. (2024) · Communications Physics · doi:10.1038/s42005-024-01845-w · Cited by 29
Efficient quantum circuit for singular-value thresholding
Duan, B., Yuan, J., Liu, Y., & Li, D. (2018) · Physical Review A · doi:10.1103/physreva.98.012308 · Cited by 31
Quantum Algorithms for Fluid Simulations
Steijl, R. (2019) · IntechOpen eBooks · doi:10.5772/intechopen.86685 · Cited by 31
Lin, J., Bao, W., Zhang, S., Li, T., & Wang, X. (2019) · Physics Letters A · doi:10.1016/j.physleta.2019.06.026 · Cited by 32
The Role of Multiplicative Complexity in Compiling Low $T$-count Oracle Circuits
Meuli, G., Soeken, M., Campbell, E. T., Roetteler, M., & Micheli, G. D. (2019) · 2019 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) · doi:10.1109/iccad45719.2019.8942093 · Cited by 31
Characterizing the Reproducibility of Noisy Quantum Circuits
Dasgupta, S., & Humble, T. S. (2022) · Entropy · doi:10.3390/e24020244 · Cited by 32
Multivariable quantum signal processing (M-QSP): prophecies of the two-headed oracle
Rossi, Z. M., & Chuang, I. L. (2022) · Quantum · doi:10.22331/q-2022-09-20-811 · Cited by 43
Quantum pattern recognition on real quantum processing units
Das, S., Zhang, J., Martina, S., Suter, D., & Caruso, F. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-022-00093-x · Cited by 34
Exact solution for the quantum and private capacities of bosonic dephasing channels
Lami, L., & Wilde, M. M. (2023) · Nature Photonics · doi:10.1038/s41566-023-01190-4 · Cited by 38
Equation solving by simulation
Childs, A. M. (2009) · Nature Physics · doi:10.1038/nphys1473 · Cited by 31
Efficient simulation of sparse Markovian quantum dynamics
Domino, K., Glos, A., & Ostaszewski, M. (2017) · Quantum Information and Computation · doi:10.26421/qic17.11-12 · Cited by 31
Ali, M., & Kabel, M. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.20.014054 · Cited by 31
Mandrà, S., Guerreschi, G. G., & Aspuru‐Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/7/073003 · Cited by 32
Quantum processing by remote quantum control
Qiang, X., Zhou, X., Aungskunsiri, K., Cable, H. V., & O’Brien, J. L. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa78d6 · Cited by 30
Quantum circulant preconditioner for a linear system of equations
Shao, C., & Xiang, H. (2018) · Physical Review A · doi:10.1103/physreva.98.062321 · Cited by 30
Quantum Computing: Codebreaking and Beyond
Roetteler, M., & Svore, K. M. (2018) · IEEE Security & Privacy · doi:10.1109/msp.2018.3761710 · Cited by 30
Sugisaki, K., Yamamoto, S., Nakazawa, S., Toyota, K., Sato, K., Shiomi, D., & Takui, T. (2018) · Chemical Physics Letters · doi:10.1016/j.cpletx.2018.100002 · Cited by 30
An Application of Quantum Annealing Computing to Seismic Inversion
Souza, A. M., Martins, E. O., Roditi, I., Sá, N., Sarthour, R. S., & Oliveira, I. S. (2022) · Frontiers in Physics · doi:10.3389/fphy.2021.748285 · Cited by 35
Ding, Y., & Chong, F. T. (2020) · Synthesis lectures on computer architecture · doi:10.2200/s01014ed1v01y202005cac051 · Cited by 63
Quantum Differentially Private Sparse Regression Learning
Du, Y., Hsieh, M.-H., Liu, T., You, S., & Tao, D. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3164726 · Cited by 33
Experimental Realization of a Deterministic Quantum Router with Superconducting Quantum Circuits
Wang, Z., Wu, Y., Bao, Z., Li, Y., Ma, C., Wang, H., Song, Y., Zhang, H., & Duan, L. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.014049 · Cited by 32
Quantum machine learning with adaptive linear optics
Chabaud, U., Markham, D., & Sohbi, A. (2021) · Quantum · doi:10.22331/q-2021-07-05-496 · Cited by 36
Oh, S., Choi, J., Kim, J., & Kim, J. (2021) · International Conference on Information Networking · doi:10.1109/icoin50884.2021.9333906 · Cited by 30
Estimating distinguishability measures on quantum computers
Rethinasamy, S., Agarwal, R., Sharma, K., & Wilde, M. M. (2023) · Physical Review A · doi:10.1103/physreva.108.012409 · Cited by 49
Quantum Interior Point Methods for Semidefinite Optimization
Augustino, B., Nannicini, G., Tamás Terlaky, B., & Zuluaga, L. F. (2023) · Quantum · doi:10.22331/q-2023-09-11-1110 · Cited by 44
Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation
Vazquez, A. C., Egger, D. J., Ochsner, D., & Woerner, S. (2023) · Quantum · doi:10.22331/q-2023-07-25-1067 · Cited by 38
Optimizing a polynomial function on a quantum processor
Li, K., Wei, S., Gao, P., Zhang, F., Zhou, Z., Xin, T., Wang, X., Rebentrost, P., & Long, G. (2021) · npj Quantum Information · doi:10.1038/s41534-020-00351-5 · Cited by 30
Butko, A., Michelogiannakis, G., Williams, S., Iancu, C., Donofrio, D., Shalf, J. M., Carter, J. T., & Siddiqi, I. A. (2020) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc2020.2020.00011 · Cited by 32
Quantum supremacy and random circuitsPreprint
Movassagh, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.06210 · Cited by 60
An efficient quantum partial differential equation solver with chebyshev points
Oz, F., San, O., & Kara, K. (2023) · Scientific Reports · doi:10.1038/s41598-023-34966-3 · Cited by 36
Quantum Natural Language Processing
Widdows, D., Aboumrad, W., Kim, D., Ray, S., & Mei, J. (2024) · Künstliche Intell. · doi:10.1007/s13218-024-00861-w · Cited by 38
Quantum algorithm for solving the advection equation using Hamiltonian simulation
Brearley, P., & Laizet, S. (2024) · Physical Review A · doi:10.1103/physreva.110.012430 · Cited by 37
Opening the Black Box inside Grover’s Algorithm
Stoudenmire, E. M., & Waintal, X. (2024) · Physical Review X · doi:10.1103/physrevx.14.041029 · Cited by 35
The potential of multidimensional photonic computing
Bente, I., Taheriniya, S., Lenzini, F., Brückerhoff‐Plückelmann, F., Kues, M., Bhaskaran, H., Wright, C. D., & Pernice, W. H. P. (2025) · Nature Reviews Physics · doi:10.1038/s42254-025-00843-3 · Cited by 36
Quantum circuit design for accurate simulation of qudit channels
Wang, D., & Sanders, B. C. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/4/043004 · Cited by 26
Exact gate decompositions for photonic quantum computing
Kalajdzievski, T. Z., & Arrazola, J. M. (2019) · Physical Review A · doi:10.1103/physreva.99.022341 · Cited by 34
Fast Black-Box Quantum State Preparation
Bausch, J. (2022) · Quantum · doi:10.22331/q-2022-08-04-773 · Cited by 30
Patterns for Hybrid Quantum Algorithms
Weigold, M., Barzen, J., Leymann, F., & Vietz, D. (2021) · Communications in computer and information science · doi:10.1007/978-3-030-87568-8_2 · Cited by 30
Complexity of Implementing Trotter Steps
Low, G. H., Su, Y., Tong, Y., & Tran, M. C. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020323 · Cited by 41
Reducing CNOT count in quantum Fourier transform for the linear nearest-neighbor architecture
Park, B., & Ahn, D. (2023) · Scientific Reports · doi:10.1038/s41598-023-35625-3 · Cited by 31
Low-Rank Quantum State Preparation
Araujo, I. F., Blank, C., Araújo, I. C. S., & da Silva, A. J. (2023) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2023.3297972 · Cited by 37
Quantum Gaussian process regression for Bayesian optimization
Rapp, F., & Roth, M. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00138-9 · Cited by 34
Linear and Logarithmic Time Compositions of Quantum Many-Body Operators
Motzoi, F., Kaicher, M., & Wilhelm, F. K. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.160503 · Cited by 29
Lowering qubit requirements for quantum simulations of fermionic systemsPreprint
Steudtner, M., & Wehner, S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.07067 · Cited by 29
Efficient quantum state preparation with Walsh series
Zylberman, J., & Debbasch, F. (2024) · Physical Review A · doi:10.1103/physreva.109.042401 · Cited by 37
A kernel-based quantum random forest for improved classification
Srikumar, M., Hill, C. D., & Hollenberg, L. C. L. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00131-2 · Cited by 36
Towards quantum computational mechanics
Liu, B., Ortíz, M., & Cirak, F. (2024) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2024.117403 · Cited by 34
Quantum Circuits for partial differential equations via Schrödingerisation
Hu, J., Jin, S., Liu, N., & Zhang, L. (2024) · Quantum · doi:10.22331/q-2024-12-12-1563 · Cited by 30
Practical Introduction to Benchmarking and Characterization of Quantum Computers
Hashim, A., Nguyen, L. B., Goss, N., Marinelli, B., Naik, R., Chistolini, T., Hines, J., Marceaux, J. P., Kim, Y., Gokhale, P., et al. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.030202 · Cited by 85
Quantum mixed-state self-attention network
Fu, C., Zhao, Q., Feng, L., Chen, C., Lin, Y., & Lin, J. (2025) · Neural Networks · doi:10.1016/j.neunet.2025.107123 · Cited by 39
A Survey of Quantum Machine Learning: Foundations, Algorithms, Frameworks, Data and Applications
Rodríguez-Díaz, F., Gutiérrez‐Avilés, D., Troncoso, A., & Alvarez, F. M. (2025) · ACM Computing Surveys · doi:10.1145/3764582 · Cited by 28
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems
Gall, F. L., & Seddighin, S. (2022) · Algorithmica · doi:10.1007/s00453-022-01066-z · Cited by 27
Variational quantum linear solver with a dynamic ansatz
Patil, H. P., Wang, Y., & Krstić, P. (2022) · Physical Review A · doi:10.1103/physreva.105.012423 · Cited by 33
A Survey on Quantum Computational Finance for Derivatives Pricing and VaR
Gómez, A., Leitao, Á., Manzano, A., Musso, D., Nogueiras, M. R., Ordóñez, G., & Vázquez, C. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-022-09732-9 · Cited by 34
Wei, C.-Y., Tsai, Y.-H., Jhang, C.-S., & Jiang, J.-H. R. (2022) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3489517.3530481 · Cited by 28
Quantum multi-programming for Grover’s search
Park, G., Zhang, K., Yu, K., & Korepin, V. E. (2023) · Quantum Information Processing · doi:10.1007/s11128-022-03793-2 · Cited by 34
Quantum computing for power systems: Tutorial, review, challenges, and prospects
Liu, H., & Tang, W. (2023) · Electric Power Systems Research · doi:10.1016/j.epsr.2023.109530 · Cited by 32
Çalıkyılmaz, U., Groppe, S., Groppe, J., Winker, T., Prestel, S., Shagieva, F., Arya, D., Preis, F., & Gruenwald, L. (2023) · Proceedings of the VLDB Endowment · doi:10.14778/3598581.3598603 · Cited by 29
Testing Multi-Subroutine Quantum Programs: From Unit Testing to Integration Testing
Long, P., & Zhao, J. (2024) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3656339 · Cited by 30
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
