Removing leakage-induced correlated errors in superconducting quantum error correction

  1. M. McEwen,
  2. D. Kafri,
  3. Z. Chen,
  4. J. Atalaya,
  5. K. J. Satzinger,
  6. C. Quintana,
  7. P. V. Klimov,
  8. D. Sank,
  9. C. Gidney,
  10. A. G. Fowler,
  11. F. Arute,
  12. K. Arya,
  13. B. Buckley,
  14. B. Burkett,
  15. N. Bushnell,
  16. B. Chiaro,
  17. R. Collins,
  18. S.Demura,
  19. A. Dunsworth,
  20. C. Erickson,
  21. B. Foxen,
  22. M. Giustina,
  23. T. Huang,
  24. S. Hong,
  25. E. Jeffrey,
  26. S. Kim,
  27. K. Kechedzhi,
  28. F. Kostritsa,
  29. P. Laptev,
  30. A. Megrant,
  31. X. Mi,
  32. J. Mutus,
  33. O. Naaman,
  34. M. Neeley,
  35. C. Neill,
  36. M.Niu,
  37. A. Paler,
  38. N. Redd,
  39. P. Roushan,
  40. T. C. White,
  41. J. Yao,
  42. P. Yeh,
  43. A. Zalcman,
  44. Yu Chen,
  45. V. N. Smelyanskiy,
  46. John M. Martinis,
  47. H. Neven,
  48. J. Kelly,
  49. A. N. Korotkov,
  50. A. G. Petukhov,
  51. and R. Barends
Quantum computing can become scalable through error correction, but logical error rates only decrease with system size when physical errors are sufficiently uncorrelated. During computation,
unused high energy levels of the qubits can become excited, creating leakage states that are long-lived and mobile. Particularly for superconducting transmon qubits, this leakage opens a path to errors that are correlated in space and time. Here, we report a reset protocol that returns a qubit to the ground state from all relevant higher level states. We test its performance with the bit-flip stabilizer code, a simplified version of the surface code for quantum error correction. We investigate the accumulation and dynamics of leakage during error correction. Using this protocol, we find lower rates of logical errors and an improved scaling and stability of error suppression with increasing qubit number. This demonstration provides a key step on the path towards scalable quantum computing.

Diabatic gates for frequency-tunable superconducting qubits

  1. R. Barends,
  2. C. M. Quintana,
  3. A. G. Petukhov,
  4. Yu Chen,
  5. D. Kafri,
  6. K. Kechedzhi,
  7. R. Collins,
  8. O. Naaman,
  9. S. Boixo,
  10. F. Arute,
  11. K. Arya,
  12. D. Buell,
  13. B. Burkett,
  14. Z. Chen,
  15. B. Chiaro,
  16. A. Dunsworth,
  17. B. Foxen,
  18. A. Fowler,
  19. C. Gidney,
  20. M. Giustina,
  21. R. Graff,
  22. T. Huang,
  23. E. Jeffrey,
  24. J. Kelly,
  25. P. V. Klimov,
  26. F. Kostritsa,
  27. D. Landhuis,
  28. E. Lucero,
  29. M. McEwen,
  30. A. Megrant,
  31. X. Mi,
  32. J. Mutus,
  33. M. Neeley,
  34. C. Neill,
  35. E. Ostby,
  36. P. Roushan,
  37. D. Sank,
  38. K. J. Satzinger,
  39. A. Vainsencher,
  40. T. White,
  41. J. Yao,
  42. P. Yeh,
  43. A. Zalcman,
  44. H. Neven,
  45. V. N. Smelyanskiy,
  46. and John M. Martinis
We demonstrate diabatic two-qubit gates with Pauli error rates down to 4.3(2)⋅10−3 in as fast as 18 ns using frequency-tunable superconducting qubits. This is achieved by synchronizing
the entangling parameters with minima in the leakage channel. The synchronization shows a landscape in gate parameter space that agrees with model predictions and facilitates robust tune-up. We test both iSWAP-like and CPHASE gates with cross-entropy benchmarking. The presented approach can be extended to multibody operations as well.

A blueprint for demonstrating quantum supremacy with superconducting qubits

  1. C. Neill,
  2. P. Roushan,
  3. K. Kechedzhi,
  4. S. Boixo,
  5. S. V. Isakov,
  6. V. Smelyanskiy,
  7. R. Barends,
  8. B. Burkett,
  9. Y. Chen,
  10. Z. Chen,
  11. B. Chiaro,
  12. A. Dunsworth,
  13. A. Fowler,
  14. B. Foxen,
  15. R. Graff,
  16. E. Jeffrey,
  17. J. Kelly,
  18. E. Lucero,
  19. A. Megrant,
  20. J. Mutus,
  21. M. Neeley,
  22. C. Quintana,
  23. D. Sank,
  24. A. Vainsencher,
  25. J. Wenner,
  26. T. C. White,
  27. H. Neven,
  28. and J.M. Martinis
Fundamental questions in chemistry and physics may never be answered due to the exponential complexity of the underlying quantum phenomena. A desire to overcome this challenge has sparked
a new industry of quantum technologies with the promise that engineered quantum systems can address these hard problems. A key step towards demonstrating such a system will be performing a computation beyond the capabilities of any classical computer, achieving so-called quantum supremacy. Here, using 9 superconducting qubits, we demonstrate an immediate path towards quantum supremacy. By individually tuning the qubit parameters, we are able to generate thousands of unique Hamiltonian evolutions and probe the output probabilities. The measured probabilities obey a universal distribution, consistent with uniformly sampling the full Hilbert-space. As the number of qubits in the algorithm is varied, the system continues to explore the exponentially growing number of states. Combining these large datasets with techniques from machine learning allows us to construct a model which accurately predicts the measured probabilities. We demonstrate an application of these algorithms by systematically increasing the disorder and observing a transition from delocalized states to localized states. By extending these results to a system of 50 qubits, we hope to address scientific questions that are beyond the capabilities of any classical computer.