Digitized adiabatic quantum computing with a superconducting circuit

  1. R. Barends,
  2. A. Shabani,
  3. L. Lamata,
  4. J. Kelly,
  5. A. Mezzacapo,
  6. U. Las Heras,
  7. R. Babbush,
  8. A. G. Fowler,
  9. B. Campbell,
  10. Yu Chen,
  11. Z. Chen,
  12. B. Chiaro,
  13. A. Dunsworth,
  14. E. Jeffrey,
  15. E. Lucero,
  16. A. Megrant,
  17. J. Y. Mutus,
  18. M. Neeley,
  19. C. Neill,
  20. P. J. J. O'Malley,
  21. C. Quintana,
  22. P. Roushan,
  23. D. Sank,
  24. A. Vainsencher,
  25. J. Wenner,
  26. T. C. White,
  27. E. Solano,
  28. H. Neven,
  29. and John M. Martinis
A major challenge in quantum computing is to solve general problems with limited physical hardware. Here, 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, 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 problems with more complex interactions, with a performance that is comparable. The presented approach is compatible with small-scale systems as well as future error-corrected quantum computers.
arxiv pdf

leave comment