Quantum Algorithms for Scientific Computing and Approximate Optimization
Open accessThe DOI matches its OpenAlex record; 64 of the 64 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552 · cited 4×
“Unfortunately, the combination of the size of m and the degree of the polynomial makes the algorithms impractical in many cases of interest [167, 189, 224, 240, 246].”
BackgroundInfluentialQuantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587 · cited 5×
“Using semidefinite programming and randomization, the Goemans-Williamson algorithm [105] achieves an approximation ratio of 0.”
BackgroundMethodInfluentialQuantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · cited 2×
“For example, a recent paper deals with the solution of linear systems on a quantum computer [121].”
BackgroundLloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 3×
“Later, Aharonov and Ta-Shma [5] generalized Lloyd’s results to sparse Hamiltonians.”
BackgroundGeorgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Quantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339 · cited 2×
“A particularly prominent metaheuristic is quantum annealing (or, more specifically, adiabatic quantum optimization) [90, 142], which can be implemented on quantum devices that are much simpler than universal quantum computers and hence easier in principle to design and engineer.”
BackgroundA 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
Some optimal inapproximability results
Håstad, J. (2001) · Journal of the ACM · doi:10.1145/502090.502098 · Cited by 1,902
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
Optimization, approximation, and complexity classes
Papadimitriou, C. H., & Yannakakis, M. (1991) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(91)90023-x · Cited by 1,653
Simulated Quantum Computation of Molecular Energies
Aspuru-Guzik, A., Dutoi, A. D., Love, P. J., & Head-Gordon, M. (2005) · Science · doi:10.1126/science.1113479 · Cited by 1,418
Quantum computational networks
Deutsch, D. E. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0099 · Cited by 1,270
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
Measurement-based quantum computation
Briegel, H. J., Browne, D. E., Dür, W., Raussendorf, R., & Van den Nest, M. (2009) · Nature Physics · doi:10.1038/nphys1157 · Cited by 1,090
Quantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071
Bravyi, S. B., & Kitaev, A. Y. (2002) · Annals of Physics · doi:10.1006/aphy.2002.6254 · Cited by 1,033
Suzuki, M. (1976) · Communications in Mathematical Physics · doi:10.1007/bf01609348 · Cited by 895 · cited 1×
“Such Hamiltonians are common in physics and chemistry [147, 177, 189, 213, 216, 233, 242].”
BackgroundBoros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827
Evidence for quantum annealing with more than one hundred qubits
Boixo, S., Rønnow, T. F., Isakov, S. V., Wang, Z., Wecker, D., Lidar, D. A., Martinis, J. M., & Troyer, M. (2014) · Nature Physics · doi:10.1038/nphys2900 · Cited by 810 · cited 2×
“It remains an important open problem whether or not such devices, or even future improved versions, can provide advantages for real-world optimization problems [42, 78].”
BackgroundTowards quantum chemistry on a quantum computer
Lanyon, B. P., Whitfield, J. D., Gillett, G. G., Goggin, M. E., Almeida, M. P., Kassal, I., Biamonte, J. D., Mohseni, M., Powell, B. J., Barbieri, M., et al. (2010) · Nature Chemistry · doi:10.1038/nchem.483 · Cited by 796
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms · doi:10.3390/a12020034 · Cited by 772
Self-citationElucidating reaction mechanisms on quantum computers
Reiher, M., Wiebe, N., Svore, K. M., Wecker, D., & Troyer, M. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1619152114 · Cited by 745 · cited 1×
“quantum algorithms would be an extremely powerful tool for new science and technology, having tremendous potential impact on the design of new medicines and advanced materials, and improving the efficiency of important chemical processes such as nitrogen fixation [198].”
BackgroundSimulating Hamiltonian Dynamics with a Truncated Taylor Series
Berry, D. W., Childs, A. M., Cleve, R., Kothari, R., & Somma, R. D. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.090502 · Cited by 742 · cited 4×
“It is interesting to observe that the query complexity might be low and depend on ε−1 polylogarithmically as in [32], yet when one considers the total gate count the picture may be quite different.”
BackgroundMethodInfluentialModern Quantum Mechanics, Revised Edition
Sakurai, J. J., & Commins, E. D. (1995) · American Journal of Physics · doi:10.1119/1.17781 · Cited by 710
The Complexity of the Local Hamiltonian Problem
Kempe, J., Kitaev, A., & Regev, O. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704445226 · Cited by 648
The Bravyi-Kitaev transformation for quantum computation of electronic structure
Seeley, J. T., Richard, M. J., & Love, P. J. (2012) · The Journal of Chemical Physics · doi:10.1063/1.4768229 · Cited by 585
Time/Space Trade-Offs for Reversible Computation
Bennett, C. H. (1989) · SIAM Journal on Computing · doi:10.1137/0218053 · Cited by 405 · cited 1×
“To the extent that the modules are based on classical computations, their reversibility is not a major issue since [27, 158, 192] show how to simulate them reversibly.”
BackgroundWhat is the Computational Value of Finite-Range Tunneling?
Denchev, V. S., Boixo, S., Isakov, S. V., Ding, N., Babbush, R., Smelyanskiy, V., Martinis, J., & Neven, H. (2016) · Physical Review X · doi:10.1103/physrevx.6.031015 · Cited by 399 · cited 1×
“It remains an important open problem whether or not such devices, or even future improved versions, can provide advantages for real-world optimization problems [42, 78].”
BackgroundAdiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2008) · SIAM Review · doi:10.1137/080734479 · Cited by 395 · cited 1×
“(2)A closely related computational model, adiabatic quantum computation [6], is universal.”
BackgroundPolynomial-time quantum algorithm for the simulation of chemical dynamics
Kassal, I., Jordan, S. P., Love, P. J., Mohseni, M., & Aspuru-Guzik, A. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0808245105 · Cited by 385
Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters
Berry, D. W., Childs, A. M., & Kothari, R. (2015) · 2015 IEEE 56th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2015.54 · Cited by 372 · cited 2×
“3) by one, as in [33], hardly make a difference.”
BackgroundQuantum approximate optimization algorithm for MaxCut: A fermionic view
Wang, Z., Hadfield, S., Jiang, Z., & Rieffel, E. G. (2018) · Physical Review A · doi:10.1103/physreva.97.022304 · Cited by 353
Self-citationQuantum algorithms for fermionic simulations
Ortiz, G., Gubernatis, J. E., Knill, E., & Laflamme, R. (2001) · Physical Review A · doi:10.1103/physreva.64.022319 · Cited by 347
Quantum algorithms for algebraic problems
Childs, A. M., & van Dam, W. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.1 · Cited by 344
A new quantum ripple-carry addition circuit
Cuccaro, S. A., Draper, T. G., Kutin, S. A., & Moulton, D. P. (2004) · arXiv · doi:10.48550/arxiv.quant-ph/0410184 · Cited by 344
Quantum Supremacy through the Quantum Approximate Optimization Algorithm
Farhi, E., & Harrow, A. W. (2016) · arXiv · doi:10.48550/arxiv.1602.07674 · Cited by 331
Exponential improvement in precision for simulating sparse Hamiltonians
Berry, D. W., Childs, A. M., Cleve, R., Kothari, R., & Somma, R. D. (2014) · Proceedings of the forty-sixth annual ACM symposium on Theory of computing · doi:10.1145/2591796.2591854 · Cited by 324
Quantum computing and the entanglement frontier
Preskill, J. (2012) · arXiv · doi:10.48550/arxiv.1203.5813 · Cited by 308
Quantum Simulation of Time-Dependent Hamiltonians and the Convenient Illusion of Hilbert Space
Poulin, D., Qarry, A., Somma, R., & Verstraete, F. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.170501 · Cited by 265 · cited 1×
“Finally, we remark that it is possible to extend our algorithms to the case of time-dependent Hamiltonians H = H(t) = ∑m j=1Hj(t), using similar techniques as those applied for splitting formulas in [194, 248, 249]; we leave this as an area for future investigation.”
MethodSchuch, N., & Verstraete, F. (2009) · Nature Physics · doi:10.1038/nphys1370 · Cited by 260 · cited 3×
“On the other hand, there are a number of recent results in discrete complexity theory suggesting that many eigenvalue problems are very hard even for quantum computers because they are QMAcomplete [61, 148, 205, 243].”
BackgroundOptimizing Variational Quantum Algorithms Using Pontryagin’s Minimum Principle
Yang, Z.-C., Rahmani, A., Shabani, A., Neven, H., & Chamon, C. (2017) · Physical Review X · doi:10.1103/physrevx.7.021027 · Cited by 210 · cited 4×
“A handful of recent papers suggest QAOA circuits are powerful for computation [87, 91, 138, 254].”
BackgroundMethodInfluentialHigher order decompositions of ordered operator exponentials
Wiebe, N., Berry, D., Høyer, P., & Sanders, B. C. (2010) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/43/6/065203 · Cited by 208 · cited 1×
“Finally, we remark that it is possible to extend our algorithms to the case of time-dependent Hamiltonians H = H(t) = ∑m j=1Hj(t), using similar techniques as those applied for splitting formulas in [194, 248, 249]; we leave this as an area for future investigation.”
MethodChemical basis of Trotter-Suzuki errors in quantum chemistry simulation
Babbush, R., McClean, J., Wecker, D., Aspuru-Guzik, A., & Wiebe, N. (2015) · Physical Review A · doi:10.1103/physreva.91.022311 · Cited by 199 · cited 5×
“ation is common in chemistry applications involving the second-quantized electronic Hamiltonian, and heuristics have been proposed to take advantage of this and reduce the simulation cost; see, e.g., [18,193,240]. The goal, then, is to construct algorithms that improve known simulation cost estimates, particularly whe…”
BackgroundInfluentialFast quantum modular exponentiation
Van Meter, R., & Itoh, K. M. (2005) · Physical Review A · doi:10.1103/physreva.71.052320 · Cited by 181
The Trotter step size required for accurate quantum simulation of quantum chemistry
Poulin, D., Hastings, M. B., Wecker, D., Wiebe, N., Doberty, A. C., & Troyer, M. (2015) · Quantum Information and Computation · doi:10.26421/qic15.5-6-1 · Cited by 159
Quantum circuits for strongly correlated quantum systems
Verstraete, F., Cirac, J. I., & Latorre, J. I. (2009) · Physical Review A · doi:10.1103/physreva.79.032316 · Cited by 158 · cited 2×
“Alternatively, UM(β) can be implemented efficiently using techniques related to the quantum Fourier transform [232].”
MethodFaster quantum chemistry simulation on fault-tolerant quantum computers
Cody Jones, N., Whitfield, J. D., McMahon, P. L., Yung, M.-H., Meter, R. V., Aspuru-Guzik, A., & Yamamoto, Y. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/11/115023 · Cited by 145
Exponentially more precise quantum simulation of fermions in second quantization
Babbush, R., Berry, D. W., Kivlichan, I. D., Wei, A. Y., Love, P. J., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/3/033032 · Cited by 135 · cited 9×
“, onN ) for this problem has been the subject of considerable recent effort [17, 18, 123, 167, 193, 240].”
BackgroundMethodInfluentialExploiting Locality in Quantum Computation for Quantum Chemistry
McClean, J. R., Babbush, R., Love, P. J., & Aspuru-Guzik, A. (2014) · The Journal of Physical Chemistry Letters · doi:10.1021/jz501649m · Cited by 125 · cited 10×
“In [18, 167], it was argued using empirical evidence that similar improvements on the number of queries are possible for certain restricted but commonly used basis function sets, and this may lead to a number of queries proportional to N 5.”
BackgroundInfluentialSimulating quantum mechanics on a quantum computer
Boghosian, B. M., & Taylor, W. (1998) · Physica D: Nonlinear Phenomena · doi:10.1016/s0167-2789(98)00042-6 · Cited by 120
Quantum Annealing for Constrained Optimization
Hen, I., & Spedalieri, F. M. (2016) · Physical Review Applied · doi:10.1103/physrevapplied.5.034007 · Cited by 114 · cited 7×
“This was observed in [127, 128] for adiabatic quantum optimization, where it was shown that mixing Hamiltonians satisfying these properties could be used instead of penalty Hamiltonian terms, with several advantages in that setting including reduced resource requirements for implementation.”
BackgroundMethodInfluentialHogg, T., & Portnov, D. (2000) · Information Sciences · doi:10.1016/s0020-0255(00)00052-9 · Cited by 111 · cited 1×
“ximately solve hard optimization problems on a quantum computer. This family of parameterized algorithms builds off of both quantum annealing and earlier proposals for gate model quantum optimization [131]. We give an overview of the details of QAOA and some important related results. Consider the problem of maximizin…”
BackgroundSimulating quantum dynamics on a quantum computer
Wiebe, N., Berry, D. W., Høyer, P., & Sanders, B. C. (2011) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/44/44/445308 · Cited by 110
Practical optimization for hybrid quantum-classical algorithms
Guerreschi, G. G., & Smelyanskiy, M. (2017) · arXiv · doi:10.48550/arxiv.1701.01450 · Cited by 99
Quantum Algorithms for Fixed Qubit Architectures
Farhi, E., Goldstone, J., Gutmann, S., & Neven, H. (2017) · arXiv · doi:10.48550/arxiv.1703.06199 · Cited by 93
Simulating Sparse Hamiltonians with Star Decompositions
Childs, A. M., & Kothari, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-18073-6_8 · Cited by 85
Quantum Approximate Optimization with Hard and Soft Constraints
Hadfield, S., Wang, Z., Rieffel, E. G., O'Gorman, B., Venturelli, D., & Biswas, R. (2017) · Proceedings of the Second International Workshop on Post Moores Era Supercomputing · doi:10.1145/3149526.3149530 · Cited by 51
Self-citationBeating the random assignment on constraint satisfaction problems of bounded degree
Barak, B., Moitra, A., O'Donnell, R., Raghavendra, P., Regev, O., Steurer, D., Trevisan, L., Vijayaraghavan, A., Witmer, D., & Wright, J. (2015) · arXiv · doi:10.48550/arxiv.1505.03424 · Cited by 8
Cited by
Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator
Pagano, G., Bapat, A., Becker, P., Collins, K. S., De, A., Hess, P. W., Kaplan, H. B., Kyprianidis, A., Tan, W. L., Baldwin, C., et al. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2006373117 · Cited by 262
Exploiting Symmetry Reduces the Cost of Training QAOA
Shaydulin, R., & Wild, S. M. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3066275 · Cited by 39
Toward Quantum Gate-Model Heuristics for Real-World Planning Problems
Stollenwerk, T., Hadfield, S., & Wang, Z. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3030609 · Cited by 29
Self-citationApproximating the quantum approximate optimization algorithm with digital-analog interactions
Headley, D., Müller, T., Martin, A., Solano, E., Sanz, M., & Wilhelm, F. K. (2020) · arXiv · doi:10.48550/arxiv.2002.12215 · Cited by 21
Quantum approximate algorithm for NP optimization problems with constraints
Ruan, Y., Marsh, S., Xue, X., Li, X., Liu, Z., & Wang, J. (2020) · arXiv · doi:10.48550/arxiv.2002.00943 · Cited by 9
Metadata
- Authors
- Hadfield, S.
- Venue
- arXiv (Cornell University)
- Publisher
- Cornell University
- Published
- 2018-01-01
- ISSN
- 2331-8422 (ISSN-L)
- OpenAlex
- W2802230929
- Cited by
- 31
- References
- 64
- Type
- posted content
- Language
- en
- Open access
- green
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.