Quantum Algorithms for Fixed Qubit Architectures

J. A. Nelder and R. Mead. “A Simplex Method for Function Minimization”. The Computer Journal

1965

Earlier work this paper cites.

Michel X. Goemans and David P. Williamson. “Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming”. J. ACM

1995

Earlier work this paper cites.

L. K. Grover. “A fast quantum mechanical algorithm for database search” (May 1996). arXiv: quant-ph/9605043

1996

Earlier work this paper cites.

E. Farhi, J. Goldstone, S. Gutmann and M. Sipser. “Quantum Computation by Adiabatic Evolution” (Jan. 2000). arXiv: quant- ph/0001106

2000

Earlier work this paper cites.

G. Brassard et al. “Quantum Amplitude Amplification and Estimation” (2000). arXiv: quant-ph/0005055 . 2000

2000

Earlier work this paper cites.

S. Aaronson. “Quantum Lower Bound for Recursive Fourier Sampling”. QIC

2003

Earlier work this paper cites.

B. M. Terhal and D. P. DiVincenzo. “Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games”. QIC

2004

Earlier work this paper cites.

S. Aaronson. “Quantum computing, postselection, and probabilistic polynomial-time”. Proc. Roy. Soc. London A Ser A

2005

Earlier work this paper cites.

S. Khot, G. Kindler, E. Mossel, and R. OÕDonnell. “Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?” SIAM

2007

Earlier work this paper cites.

R.J. Bremner and D.J. Shepard. Proc. Roy. Soc. London A Ser A

2011

Earlier work this paper cites.

K. Fujii and T. Morimae. “Quantum Commuting Circuits and Complexity of Ising Partition Functions” (Nov. 2013). arXiv: 1311.2128 [quant-ph]

Original

2013

Earlier work this paper cites.

K. M. Svore, M. B. Hastings, and M. Freedman. “Faster Phase Estimation”. ArXiv e-prints

Original

2013

Earlier work this paper cites.

R. Barends et al. “Superconducting quantum circuits at the surface code threshold for fault tolerance”. Nature

2014

Earlier work this paper cites.

E. Farhi, J. Goldstone, and S. Gutmann. “A Quantum Approximate Optimization Algorithm” (2014). arXiv: 1411.4028

Original

2014

Cited alongside, same era.

E. Farhi, J. Goldstone, and S. Gutmann. “A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem” (2014). arXiv: 1412.6062

Original

2014

Cited alongside, same era.

A. Peruzzo, J. McClean, P. Shadbolt, M. Yung, X. Zhou, P. Love, A. Aspuru-Guzik, J. O’Brien. “A variational eigenvalue solver on a photonic quantum processor”. Nat. Commun. 5

2014

Cited alongside, same era.

S. Aaronson. TOCS

2014

Cited alongside, same era.

K. Fujii et al. “Impossibility of Classically Simulating One-Clean-Qubit Computation” (2014). arXiv: 1409.6777 [quant-ph]

Original

2014

F. Yan et al. “The flux qubit revisited to enhance coherence and reproducibility”. Nature Communications

2016

Later among the works it cites.

E. A. Sete, W. J. Zeng, and C. T. Rigetti. “A functional architecture for scalable quantum computing”. 2016 IEEE International Conference on Rebooting Computing (ICRC)

2016

Later among the works it cites.

David Aasen et al. “Milestones Toward Majorana-Based Quantum Computing”. Phys. Rev. X

2016

Later among the works it cites.

J. R. McClean et al. “The theory of variational hybrid quantum-classical algorithms”. New J. Phys

2016

Later among the works it cites.

M. J. Bremner, A. Montanaro, and D. J. Shepherd. “Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations”. Phys. Rev. Lett

Original

2016

Later among the works it cites.