Quantum approximate optimization of non-planar graph problems on a planar superconducting processor
Top Cited Papers
- 4 February 2021
- journal article
- research article
- Published by Springer Science and Business Media LLC in Nature Physics
- Vol. 17 (3), 332-336
- https://doi.org/10.1038/s41567-020-01105-y
Abstract
No abstract availableKeywords
Funding Information
- Dave Bacon is a CIFAR Associate Fellow in the Quantum Information Science Program
- EC | Horizon 2020 Framework Programme (828826, 828826, 828826, 828826)
This publication has 24 references indexed in Scilit:
- What is the Computational Value of Finite-Range Tunneling?Physical Review X, 2016
- Defining and detecting quantum speedupScience, 2014
- Ising formulations of many NP problemsFrontiers in Physics, 2014
- Minor-embedding in adiabatic quantum computation: I. The parameter setting problemQuantum Information Processing, 2008
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete ProblemScience, 2001
- On Some Tighter Inapproximability Results (Extended Abstract)Lecture Notes in Computer Science, 1999
- Quantum annealing in the transverse Ising modelPhysical Review E, 1998
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- On the computational complexity of Ising spin glass modelsJournal of Physics A: General Physics, 1982
- Solvable Model of a Spin-GlassPhysical Review Letters, 1975