Corpus ID: 209444714

Quantum approximate optimization of the exact-cover problem on a superconducting quantum processor

@article{Bengtsson2019QuantumAO,
  title={Quantum approximate optimization of the exact-cover problem on a superconducting quantum processor},
  author={A. Bengtsson and Pontus Vikstaal and C. Warren and Marika Svensson and X. Gu and A. F. Kockum and P. Krantz and Christian Krivzan and D. Shiri and I. Svensson and G. Tancredi and G. Johansson and P. Delsing and G. Ferrini and J. Bylander},
  journal={arXiv: Quantum Physics},
  year={2019}
}
Present-day, noisy, small or intermediate-scale quantum processors---although far from fault-tolerant---support the execution of heuristic quantum algorithms, which might enable a quantum advantage, for example, when applied to combinatorial optimization problems. On small-scale quantum processors, validations of such algorithms serve as important technology demonstrators. We implement the quantum approximate optimization algorithm (QAOA) on our hardware platform, consisting of two transmon… Expand
9 Citations

Figures and Tables from this paper

Reachability Deficits Implicit in Google's Quantum Approximate Optimization of Graph Problems
  • 5
  • PDF
High-Fidelity, High-Scalability Two-Qubit Gate Scheme for Superconducting Qubits.
  • 14
  • PDF
Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets
  • 12
  • PDF
Quantum Technology for Economists
  • PDF
Qubit-efficient encoding schemes for binary optimisation problems
  • 2
  • PDF

References

SHOWING 1-2 OF 2 REFERENCES
The Tail Assignment Problem
  • 50
arXiv preprint arXiv : 1905 . 13641 ( 2019 ) . [ 5