Future of Quantum Computing

M. Brown, Stone Soup (Scribner, New York, 1947)

1947

Earlier work this paper cites.

R. P. Feynman, Simulating physics with computers, Int. J. Theor. Phys. 21

1982

Earlier work this paper cites.

P. J. M. van Laarhoven and E. H. L. Aarts, Simulated annealing: Theory and Applications , Mathematics and Its Applications, Vol. 37 (Reidel, Dordrecht, 1987)

1987

Earlier work this paper cites.

P. W. Shor, Algorithms for quantum computation: Discrete logarithms and factoring, in Proc. 35th Annual Symposium on Foundations of Computer Science, SFCS ‘94’ (1994) pp. 124–134

1994

Earlier work this paper cites.

L. Grover, Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett. 79

1997

Earlier work this paper cites.

D. Aharonov and M. Ben-Or, Fault-tolerant quantum computation with constant error, in 1997 Proc. 29th Annual ACM Symposium on the Theory of Computing (1997) pp. 176–188

1997

Earlier work this paper cites.

E. Bernstein and U. Vazirani, Quantum complexity theory, SIAM J. Comput. 26

1997

Earlier work this paper cites.

D. R. Simon, On the power of quantum computation, SIAM J. Comput. 26

1997

Earlier work this paper cites.

E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Limit on the speed of quantum computation in determining parity, Phys. Rev. Lett. 81

1998

Earlier work this paper cites.

J. Zhou, Q. Gan, A. Krzyżak, and C. Y. Suen, Recognition of handwritten numerals by quantum neural network with fuzzy features, Int. J. Doc. Anal. Recognit. 2

1999

Earlier work this paper cites.

R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. De Wolf, Quantum lower bounds by polynomials, J. ACM 48

2001

Earlier work this paper cites.

A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman, Exponential algorithmic speedup by a quantum walk, in Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing , STOC ’03 (Association for Computing Machinery, New York, 2003) p. 59–68

2003

Earlier work this paper cites.

S. Boyd and L. Vandenberghe, Convex Optimization (Cambridge University Press, Cambridge UK, 2004)

2004

Cited alongside, same era.

A. W. Harrow, Small quantum computers and large classical data sets (2020), arXiv:2004.00026 [quant-ph]

Original

2004

Cited alongside, same era.

J. Kempe, A. Kitaev, and O. Regev, The complexity of the local Hamiltonian problem, SIAM J. Comput. 35

2006

Cited alongside, same era.

V. Giovannetti, S. Lloyd, and L. Maccone, Quantum random access memory, Phys. Rev. Lett. 100

2008

Cited alongside, same era.

E. Farhi, J. Goldstone, and S. Gutmann, A quantum approximate optimization algorithm (2014), arXiv:1411.4028 [quant-ph]

Original

2014

Cited alongside, same era.

E. Farhi, E. Goldstone, S. Gutmann, and L. Zhou, The quantum approximate optimization algorithm and the Sherrington-Kirkpatrick model at infinite size, Quantum 6

2022

Later among the works it cites.

D. Layden, G. Mazzola, M. Mishmash, R.V. amd Motta, P. Wocjan, J.-S. Kim, and S. Sheldon, Quantum-enhanced Markov chain Monte Carlo, Nature 619

2023

Later among the works it cites.

H. Field, OpenAI dissolves team focused on long-term AI risks, less than one year after announcing it, CNBC (2024)

2024

Later among the works it cites.

T. Yamakawa and M. Zhandry, Verifiable quantum advantage without structure, J. ACM 71

2024

Later among the works it cites.

S. P. Jordan, N. Shutty, M. Wootters, A. Zalcman, A. Schmidhuber, R. King, S. V. Isakov, and R. Babbush, Optimization by decoded quantum interferometry (2024), arXiv:2408.08292 [quant-ph]

Original

2024