- Rami Barends
- Alireza Shabani
- Lucas Lamata
- Julian Kelly
- Antonio Mezzacapo
- Urtzi Las Heras
- Ryan Babbush
- Austin Fowler
- Brooks Campbell
- Yu Chen
- Zijun Chen
- Ben Chiaro
- Andrew Dunsworth
- Evan Jeffrey
- Erik Lucero
- Anthony Megrant
- Josh Mutus
- Matthew Neeley
- Charles Neill
- Peter O'Malley
- Chris Quintana
- Enrique Solano
- Ted White
- Jim Wenner
- Amit Vainsencher
- Daniel Sank
- Pedram Roushan
- Hartmut Neven
- John Martinis
Abstract
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.
Research Areas
Learn more about how we do research
We maintain a portfolio of research projects, providing individuals and teams the freedom to emphasize specific types of work