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.

Observation of classical-quantum crossover of 1/f flux noise and its paramagnetic temperature dependence

  1. C. M. Quintana,
  2. Yu Chen,
  3. D. Sank,
  4. A. G. Petukhov,
  5. T. C. White,
  6. Dvir Kafri,
  7. B. Chiaro,
  8. A. Megrant,
  9. R. Barends,
  10. B. Campbell,
  11. Z. Chen,
  12. A. Dunsworth,
  13. A. G. Fowler,
  14. R. Graff,
  15. E. Jeffrey,
  16. J. Kelly,
  17. E. Lucero,
  18. J. Y. Mutus,
  19. M. Neeley,
  20. C. Neill,
  21. P. J. J. O'Malley,
  22. P. Roushan,
  23. A. Shabani,
  24. A. Vainsencher,
  25. J. Wenner,
  26. H. Neven,
  27. and John M. Martinis
By analyzing the dissipative dynamics of a tunable gap flux qubit, we extract both sides of its two-sided environmental flux noise spectral density over a range of frequencies around
2kBT/h≈1GHz, allowing for the observation of a classical-quantum crossover. Below the crossover point, the symmetric noise component follows a 1/f power law that matches the magnitude of the 1/f noise near 1Hz. The antisymmetric component displays a 1/T dependence below 100mK, providing dynamical evidence for a paramagnetic environment. Extrapolating the two-sided spectrum predicts the linewidth and reorganization energy of incoherent resonant tunneling between flux qubit wells.

The Quantum Socket: Three-Dimensional Wiring for Extensible Quantum Computing

  1. J.H. Béjanin,
  2. T.G. McConkey,
  3. J.R. Rinehart,
  4. C.T. Earnest,
  5. C.R.H. McRae,
  6. D. Shiri,
  7. J.D. Bateman,
  8. Y. Rohanizadegan,
  9. B. Penava,
  10. P. Breul,
  11. S. Royak,
  12. M. Zapatka,
  13. A. G. Fowler,
  14. and M. Mariantoni
Quantum computing architectures are on the verge of scalability, a key requirement for the implementation of a universal quantum computer. The next stage in this quest is the realization
of quantum error correction codes, which will mitigate the impact of faulty quantum information on a quantum computer. Architectures with ten or more quantum bits (qubits) have been realized using trapped ions and superconducting circuits. While these implementations are potentially scalable, true scalability will require systems engineering to combine quantum and classical hardware. One technology demanding imminent efforts is the realization of a suitable wiring method for the control and measurement of a large number of qubits. In this work, we introduce an interconnect solution for solid-state qubits: The quantum socket. The quantum socket fully exploits the third dimension to connect classical electronics to qubits with higher density and better performance than two-dimensional methods based on wire bonding. The quantum socket is based on spring-mounted micro wires the three-dimensional wires that push directly on a micro-fabricated chip, making electrical contact. A small wire cross section (~1 mmm), nearly non-magnetic components, and functionality at low temperatures make the quantum socket ideal to operate solid-state qubits. The wires have a coaxial geometry and operate over a frequency range from DC to 8 GHz, with a contact resistance of ~150 mohm, an impedance mismatch of ~10 ohm, and minimal crosstalk. As a proof of principle, we fabricated and used a quantum socket to measure superconducting resonators at a temperature of ~10 mK.

Scalable in-situ qubit calibration during repetitive error detection

  1. J. Kelly,
  2. R. Barends,
  3. A. G. Fowler,
  4. A. Megrant,
  5. E. Jeffrey,
  6. T. C. White,
  7. D. Sank,
  8. J. Y. Mutus,
  9. B. Campbell,
  10. Yu Chen,
  11. Z. Chen,
  12. B. Chiaro,
  13. A. Dunsworth,
  14. E. Lucero,
  15. M. Neeley,
  16. C. Neill,
  17. P. J. J. O'Malley,
  18. C. Quintana,
  19. P. Roushan,
  20. A. Vainsencher,
  21. J. Wenner,
  22. and John M. Martinis
We present a method to optimize qubit control parameters during error detection which is compatible with large-scale qubit arrays. We demonstrate our method to optimize single or two-qubit
gates in parallel on a nine-qubit system. Additionally, we show how parameter drift can be compensated for during computation by inserting a frequency drift and using our method to remove it. We remove both drift on a single qubit and independent drifts on all qubits simultaneously. We believe this method will be useful in keeping error rates low on all physical qubits throughout the course of a computation. Our method is O(1) scalable to systems of arbitrary size, providing a path towards controlling the large numbers of qubits needed for a fault-tolerant quantum computer

Scalable Quantum Simulation of Molecular Energies

  1. P. J. J. O'Malley,
  2. R. Babbush,
  3. I. D. Kivlichan,
  4. J. Romero,
  5. J. R. McClean,
  6. R. Barends,
  7. J. Kelly,
  8. P. Roushan,
  9. A. Tranter,
  10. N. Ding,
  11. B. Campbell,
  12. Y. Chen,
  13. Z. Chen,
  14. B. Chiaro,
  15. A. Dunsworth,
  16. A. G. Fowler,
  17. E. Jeffrey,
  18. A. Megrant,
  19. J. Y. Mutus,
  20. C. Neill,
  21. C. Quintana,
  22. D. Sank,
  23. A. Vainsencher,
  24. J. Wenner,
  25. T. C. White,
  26. P. V. Coveney,
  27. P. J. Love,
  28. H. Neven,
  29. A. Aspuru-Guzik,
  30. and J.M. Martinis
We report the first electronic structure calculation performed on a quantum computer without exponentially costly precompilation. We use a programmable array of superconducting qubits
to compute the energy surface of molecular hydrogen using two distinct quantum algorithms. First, we experimentally execute the unitary coupled cluster method using the variational quantum eigensolver. Our efficient implementation predicts the correct dissociation energy to within chemical accuracy of the numerically exact result. Next, we experimentally demonstrate the canonical quantum algorithm for chemistry, which consists of Trotterization and quantum phase estimation. We compare the experimental performance of these approaches to show clear evidence that the variational quantum eigensolver is robust to certain errors, inspiring hope that quantum simulation of classically intractable molecules may be viable in the near future.

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.

Digital quantum simulation of fermionic models with a superconducting circuit

  1. R. Barends,
  2. L. Lamata,
  3. J. Kelly,
  4. L. García-Álvarez,
  5. A. G. Fowler,
  6. A. Megrant,
  7. E. Jeffrey,
  8. T. C. White,
  9. D. Sank,
  10. J. Y. Mutus,
  11. B. Campbell,
  12. Yu Chen,
  13. Z. Chen,
  14. B. Chiaro,
  15. A. Dunsworth,
  16. I.-C. Hoi,
  17. C. Neill,
  18. P. J. J. O'Malley,
  19. C. Quintana,
  20. P. Roushan,
  21. A. Vainsencher,
  22. J. Wenner,
  23. E. Solano,
  24. and John M. Martinis
Simulating quantum physics with a device which itself is quantum mechanical, a notion Richard Feynman originated, would be an unparallelled computational resource. However, the universal
quantum simulation of fermionic systems is daunting due to their particle statistics, and Feynman left as an open question whether it could be done, because of the need for non-local control. Here, we implement fermionic interactions with digital techniques in a superconducting circuit. Focusing on the Hubbard model, we perform time evolution with constant interactions as well as a dynamic phase transition with up to four fermionic modes encoded in four qubits. The implemented digital approach is universal and allows for the efficient simulation of fermions in arbitrary spatial dimensions. We use in excess of 300 single-qubit and two-qubit gates, and reach global fidelities which are limited by gate errors. This demonstration highlights the feasibility of the digital approach and opens a viable route towards analog-digital quantum simulation of interacting fermions and bosons in large-scale solid state systems.

State preservation by repetitive error detection in a superconducting quantum circuit

  1. J. Kelly,
  2. R. Barends,
  3. A. G. Fowler,
  4. A. Megrant,
  5. E. Jeffrey,
  6. T. C. White,
  7. D. Sank,
  8. J. Y. Mutus,
  9. B. Campbell,
  10. Yu Chen,
  11. Z. Chen,
  12. B. Chiaro,
  13. A. Dunsworth,
  14. I.-C. Hoi,
  15. C. Neill,
  16. P. J. J. O'Malley,
  17. C. Quintana,
  18. P. Roushan,
  19. A. Vainsencher,
  20. J. Wenner,
  21. A. N. Cleland,
  22. and John M. Martinis
Quantum computing becomes viable when a quantum state can be preserved from environmentally-induced error. If quantum bits (qubits) are sufficiently reliable, errors are sparse and
quantum error correction (QEC) is capable of identifying and correcting them. Adding more qubits improves the preservation by guaranteeing increasingly larger clusters of errors will not cause logical failure – a key requirement for large-scale systems. Using QEC to extend the qubit lifetime remains one of the outstanding experimental challenges in quantum computing. Here, we report the protection of classical states from environmental bit-flip errors and demonstrate the suppression of these errors with increasing system size. We use a linear array of nine qubits, which is a natural precursor of the two-dimensional surface code QEC scheme, and track errors as they occur by repeatedly performing projective quantum non-demolition (QND) parity measurements. Relative to a single physical qubit, we reduce the failure rate in retrieving an input state by a factor of 2.7 for five qubits and a factor of 8.5 for nine qubits after eight cycles. Additionally, we tomographically verify preservation of the non-classical Greenberger-Horne-Zeilinger (GHZ) state. The successful suppression of environmentally-induced errors strongly motivates further research into the many exciting challenges associated with building a large-scale superconducting quantum computer.

Optimal quantum control using randomized benchmarking

  1. J. Kelly,
  2. R. Barends,
  3. B. Campbell,
  4. Y. Chen,
  5. Z. Chen,
  6. B. Chiaro,
  7. A. Dunsworth,
  8. A. G. Fowler,
  9. I.-C. Hoi,
  10. E. Jeffrey,
  11. A. Megrant,
  12. J. Mutus,
  13. C. Neill,
  14. P. J. J. O'Malley,
  15. C. Quintana,
  16. P. Roushan,
  17. D. Sank,
  18. A. Vainsencher,
  19. J. Wenner,
  20. T. C. White,
  21. A. N. Cleland,
  22. and John M. Martinis
We present a method for optimizing quantum control in experimental systems, using a subset of randomized benchmarking measurements to rapidly infer error. This is demonstrated to improve
single- and two-qubit gates, minimize gate bleedthrough, where a gate mechanism can cause errors on subsequent gates, and identify control crosstalk in superconducting qubits. This method is able to correct parameters to where control errors no longer dominate, and is suitable for automated and closed-loop optimization of experimental systems

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.