Deterministic Benchmarking of CZ gates

ORAL

Abstract

2 qubit gates form the cornerstone of quantum error correction and quantum algorithms, but are also one of the biggest, potentially fixable, components in error budgets in current systems. Current benchmarking protocols provide information about gate performance in an "extreme" sense: Randomized Benchmarking condenses the gate performance into a single infidelity number, while Gate Set Tomography unpacks the same performance into a metric composed of exponential numbers. We propose a CZ gate benchmarking technique, which extends previous work on 1 qubit gate deterministic benchmarking (DB), and instead characterizes the performance in terms of coherent and incoherent error mechanisms. We experimentally demonstrate DB for CZ gates using superconducting transmon qubits and support these results with simple analytical models and master equation simulations. Our findings also point mitigation strategies for CZ gates, specifically for the coherent error mechanisms.

*This material is based upon work supported by, or in part by, the U. S. Army Research Laboratory and the U. S. Army Research Office under contract/grant number W911NF2310255.

Presenters

  • Kumar Saurav

    • University of Southern California

Authors

  • Kumar Saurav

    • University of Southern California
  • Arian Vezvaee

    • University of Southern California
  • Junyoung An

    • Massachusetts Institute of Technology
  • Daria Kowsari

    • University of Southern California
  • David Pahl

    • Massachusetts Institute of Technology
  • Lukas Pahl

    • Massachusetts Institute of Technology
  • Eli Levenson-Falk

    • University of Southern California
  • Jeffrey A Grover

    • Massachusetts Institute of Technology
  • William D Oliver

    • Massachusetts Institute of Technology
  • Daniel A Lidar

    • University of Southern California