Digitized adiabatic quantum computing with a superconducting circuit, part II: Experiment

ORAL

Abstract

A major challenge in quantum computing is to solve general problems with limited physical hardware. We implement digitized adiabatic quantum computing, combining the generality of the adiabatic algorithm with the universality of the digital approach, using a superconducting circuit with nine qubits. We probe the adiabatic evolutions, explore the scaling of errors with system size, and quantify the success of the algorithm for random spin problems. We find that the system can approximate the solutions to both frustrated Ising problems and non-stoquastic problem Hamiltonians with a performance that is comparable.

Authors

  • R. Barends

    • Google Inc.
  • A. Shabani

    • Google Inc.
  • L. Lamata

    • University of the Basque Country, Spain
  • J. Kelly

    • Google Inc.
  • A. Mezzacapo

    • University of the Basque Country, Spain
  • U. Las Heras

    • University of the Basque Country, Spain
  • R. Babbush

    • Google Inc.
  • A.G. Fowler

    • Google Inc.
  • B. Campbell

    • UC Santa Barbara
  • Y. Chen

    • Google Inc.
  • Z. Chen

    • Google Inc.
  • B. Chiaro

    • UC Santa Barbara
  • A. Dunsworth

    • UC Santa Barbara
  • E. Jeffrey

    • Google Inc.
  • E. Lucero

    • Google Inc.
  • A. Megrant

    • Google Inc.
  • J. Mutus

    • Google Inc.
  • M. Neeley

    • Google Inc.
  • C. Neill

    • UC Santa Barbara
  • P. O'Malley

    • UC Santa Barbara
  • C. Quintana

    • UC Santa Barbara
  • P. Roushan

    • Google Inc.
  • E. Solano

    • University of the Basque Country, Spain
  • H. Neven

    • Google Inc.
  • J. Martinis

    • Google Inc.