Realizing Quantum Convolutional Neural Networks on a Superconducting Quantum Processor to Recognize Quantum Phases

  1. Johannes Herrmann,
  2. Sergi Masot Llima,
  3. Ants Remm,
  4. Petr Zapletal,
  5. Nathan A. McMahon,
  6. Colin Scarato,
  7. Francois Swiadek,
  8. Christian Kraglund Andersen,
  9. Christoph Hellings,
  10. Sebastian Krinner,
  11. Nathan Lacroix,
  12. Stefania Lazar,
  13. Michael Kerschbaum,
  14. Dante Colao Zanuz,
  15. Graham J. Norris,
  16. Michael J. Hartmann,
  17. Andreas Wallraff,
  18. and Christopher Eichler
Quantum computing crucially relies on the ability to efficiently characterize the quantum states output by quantum hardware. Conventional methods which probe these states through direct
measurements and classically computed correlations become computationally expensive when increasing the system size. Quantum neural networks tailored to recognize specific features of quantum states by combining unitary operations, measurements and feedforward promise to require fewer measurements and to tolerate errors. Here, we realize a quantum convolutional neural network (QCNN) on a 7-qubit superconducting quantum processor to identify symmetry-protected topological (SPT) phases of a spin model characterized by a non-zero string order parameter. We benchmark the performance of the QCNN based on approximate ground states of a family of cluster-Ising Hamiltonians which we prepare using a hardware-efficient, low-depth state preparation circuit. We find that, despite being composed of finite-fidelity gates itself, the QCNN recognizes the topological phase with higher fidelity than direct measurements of the string order parameter for the prepared states.

Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets

  1. Nathan Lacroix,
  2. Christoph Hellings,
  3. Christian Kraglund Andersen,
  4. Agustin Di Paolo,
  5. Ants Remm,
  6. Stefania Lazar,
  7. Sebastian Krinner,
  8. Graham J. Norris,
  9. Mihai Gabureac,
  10. Alexandre Blais,
  11. Christopher Eichler,
  12. and Andreas Wallraff
Variational quantum algorithms are believed to be promising for solving computationally hard problems and are often comprised of repeated layers of quantum gates. An example thereof
is the quantum approximate optimization algorithm (QAOA), an approach to solve combinatorial optimization problems on noisy intermediate-scale quantum (NISQ) systems. Gaining computational power from QAOA critically relies on the mitigation of errors during the execution of the algorithm, which for coherence-limited operations is achievable by reducing the gate count. Here, we demonstrate an improvement of up to a factor of 3 in algorithmic performance as measured by the success probability, by implementing a continuous hardware-efficient gate set using superconducting quantum circuits. This gate set allows us to perform the phase separation step in QAOA with a single physical gate for each pair of qubits instead of decomposing it into two CZ-gates and single-qubit gates. With this reduced number of physical gates, which scales with the number of layers employed in the algorithm, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances mapped onto three and seven qubits, using up to a total of 399 operations and up to 9 layers. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.

Repeated Quantum Error Detection in a Surface Code

  1. Christian Kraglund Andersen,
  2. Ants Remm,
  3. Stefania Lazar,
  4. Sebastian Krinner,
  5. Nathan Lacroix,
  6. Graham J. Norris,
  7. Mihai Gabureac,
  8. Christopher Eichler,
  9. and Andreas Wallraff
The realization of quantum error correction is an essential ingredient for reaching the full potential of fault-tolerant universal quantum computation. Using a range of different schemes,
logical qubits can be redundantly encoded in a set of physical qubits. One such scalable approach is based on the surface code. Here we experimentally implement its smallest viable instance, capable of repeatedly detecting any single error using seven superconducting qubits, four data qubits and three ancilla qubits. Using high-fidelity ancilla-based stabilizer measurements we initialize the cardinal states of the encoded logical qubit with an average logical fidelity of 96.1%. We then repeatedly check for errors using the stabilizer readout and observe that the logical quantum state is preserved with a lifetime and coherence time longer than those of any of the constituent qubits when no errors are detected. Our demonstration of error detection with its resulting enhancement of the conditioned logical qubit coherence times in a 7-qubit surface code is an important step indicating a promising route towards the realization of quantum error correction in the surface code.

Entanglement Stabilization using Parity Detection and Real-Time Feedback in Superconducting Circuits

  1. Christian Kraglund Andersen,
  2. Ants Remm,
  3. Stefania Balasiu,
  4. Sebastian Krinner,
  5. Johannes Heinsoo,
  6. Jean-Claude Besse,
  7. Mihai Gabureac,
  8. Andreas Wallraff,
  9. and Christopher Eichler
Fault tolerant quantum computing relies on the ability to detect and correct errors, which in quantum error correction codes is typically achieved by projectively measuring multi-qubit
parity operators and by conditioning operations on the observed error syndromes. Here, we experimentally demonstrate the use of an ancillary qubit to repeatedly measure the ZZ and XX parity operators of two data qubits and to thereby project their joint state into the respective parity subspaces. By applying feedback operations conditioned on the outcomes of individual parity measurements, we demonstrate the real-time stabilization of a Bell state with a fidelity of F≈74% in up to 12 cycles of the feedback loop. We also perform the protocol using Pauli frame updating and, in contrast to the case of real-time stabilization, observe a steady decrease in fidelity from cycle to cycle. The ability to stabilize parity over multiple feedback rounds with no reduction in fidelity provides strong evidence for the feasibility of executing stabilizer codes on timescales much longer than the intrinsic coherence times of the constituent qubits.

Engineering cryogenic setups for 100-qubit scale superconducting circuit systems

  1. Sebastian Krinner,
  2. Simon Storz,
  3. Philipp Kurpiers,
  4. Paul Magnard,
  5. Johannes Heinsoo,
  6. Raphael Keller,
  7. Janis Luetolf,
  8. Christopher Eichler,
  9. and Andreas Wallraff
A robust cryogenic infrastructure in form of a wired, thermally optimized dilution refrigerator is essential for present and future solid-state based quantum processors. Here, we engineer
an extensible cryogenic setup, which minimizes passive and active heat loads, while guaranteeing rapid qubit control and readout. We review design criteria for qubit drive lines, flux lines, and output lines used in typical experiments with superconducting circuits and describe each type of line in detail. The passive heat load of stainless steel and NbTi coaxial cables and the active load due to signal dissipation are measured, validating our robust and extensible concept for thermal anchoring of attenuators, cables, and other microwave components. Our results are important for managing the heat budget of future large-scale quantum computers based on superconducting circuits.

Rapid high-fidelity multiplexed readout of superconducting qubits

  1. Johannes Heinsoo,
  2. Christian Kraglund Andersen,
  3. Ants Remm,
  4. Sebastian Krinner,
  5. Theodore Walter,
  6. Yves Salathé,
  7. Simone Gasperinetti,
  8. Jean-Claude Besse,
  9. Anton Potočnik,
  10. Christopher Eichler,
  11. and Andreas Wallraff
The duration and fidelity of qubit readout is a critical factor for applications in quantum information processing as it limits the fidelity of algorithms which reuse qubits after measurement
or apply feedback based on the measurement result. Here we present fast multiplexed readout of five qubits in a single 1.2 GHz wide readout channel. Using a readout pulse length of 80 ns and populating readout resonators for less than 250 ns we find an average correct assignment probability for the five measured qubits to be 97%. The differences between the individual readout errors and those found when measuring the qubits simultaneously are within 1%. We employ individual Purcell filters for each readout resonator to suppress off-resonant driving, which we characterize by the dephasing imposed on unintentionally measured qubits. We expect the here presented readout scheme to become particularly useful for the selective readout of individual qubits in multi-qubit quantum processors.