Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing

  1. R. Barends,
  2. J. Kelly,
  3. A. Megrant,
  4. A. Veitia,
  5. D. Sank,
  6. E. Jeffrey,
  7. T. C. White,
  8. J. Mutus,
  9. A. G. Fowler,
  10. B. Campbell,
  11. Y. Chen,
  12. Z. Chen,
  13. B. Chiaro,
  14. A. Dunsworth,
  15. C. Neill,
  16. P. O'Malley,
  17. P. Roushan,
  18. A. Vainsencher,
  19. J. Wenner,
  20. A. N. Korotkov,
  21. A. N. Cleland,
  22. and John M. Martinis
A quantum computer can solve hard problems – such as prime factoring, database searching, and quantum simulation – at the cost of needing to protect fragile quantum states from error. Quantum error correction provides this protection, by distributing a logical state among many physical qubits via quantum entanglement. Superconductivity is an appealing platform, as it allows for constructing large quantum circuits, and is compatible with microfabrication. For superconducting qubits the surface code is a natural choice for error correction, as it uses only nearest-neighbour coupling and rapidly-cycled entangling gates. The gate fidelity requirements are modest: The per-step fidelity threshold is only about 99%. Here, we demonstrate a universal set of logic gates in a superconducting multi-qubit processor, achieving an average single-qubit gate fidelity of 99.92% and a two-qubit gate fidelity up to 99.4%. This places Josephson quantum computing at the fault-tolerant threshold for surface code error correction. Our quantum processor is a first step towards the surface code, using five qubits arranged in a linear array with nearest-neighbour coupling. As a further demonstration, we construct a five-qubit Greenberger-Horne-Zeilinger (GHZ) state using the complete circuit and full set of gates. The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits.
arxiv pdf

leave comment