• Open Access

Demonstrating Scalable Randomized Benchmarking of Universal Gate Sets

Jordan Hines, Marie Lu, Ravi K. Naik, Akel Hashim, Jean-Loup Ville, Brad Mitchell, John Mark Kriekebaum, David I. Santiago, Stefan Seritan, Erik Nielsen, Robin Blume-Kohout, Kevin Young, Irfan Siddiqi, Birgitta Whaley, and Timothy Proctor
Phys. Rev. X 13, 041030 – Published 14 November 2023

Abstract

Randomized benchmarking (RB) protocols are the most widely used methods for assessing the performance of quantum gates. However, the existing RB methods either do not scale to many qubits or cannot benchmark a universal gate set. Here, we introduce and demonstrate a technique for scalable RB of many universal and continuously parametrized gate sets, using a class of circuits called randomized mirror circuits. Our technique can be applied to a gate set containing an entangling Clifford gate and the set of arbitrary single-qubit gates, as well as gate sets containing controlled rotations about the Pauli axes. We use our technique to benchmark universal gate sets on four qubits of the Advanced Quantum Testbed, including a gate set containing a controlled-S gate and its inverse, and we investigate how the observed error rate is impacted by the inclusion of non-Clifford gates. Finally, we demonstrate that our technique scales to many qubits with experiments on a 27-qubit IBM Q processor. We use our technique to quantify the impact of crosstalk on this 27-qubit device, and we find that it contributes approximately 2/3 of the total error per gate in random many-qubit circuit layers.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
9 More
  • Received 21 July 2022
  • Revised 9 June 2023
  • Accepted 25 August 2023

DOI:https://doi.org/10.1103/PhysRevX.13.041030

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article’s title, journal citation, and DOI.

Published by the American Physical Society

Physics Subject Headings (PhySH)

Quantum Information, Science & Technology

Authors & Affiliations

Jordan Hines1,2,*, Marie Lu3,∥, Ravi K. Naik3,4, Akel Hashim3,4, Jean-Loup Ville3,†, Brad Mitchell3,4, John Mark Kriekebaum3,5,‡, David I. Santiago3,4, Stefan Seritan2, Erik Nielsen2,¶, Robin Blume-Kohout2, Kevin Young2, Irfan Siddiqi3,4,5, Birgitta Whaley6, and Timothy Proctor2,§

  • 1Department of Physics, University of California, Berkeley, California 94720, USA
  • 2Quantum Performance Laboratory, Sandia National Laboratories, Albuquerque, New Mexico 87185, USA, and Livermore, California 94550, USA
  • 3Quantum Nanoelectronics Laboratory, Department of Physics, University of California, Berkeley, California 94720, USA
  • 4Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, California 94720, USA
  • 5Materials Sciences Division, Lawrence Berkeley National Laboratory, Berkeley, California 94720, USA
  • 6Department of Chemistry, University of California, Berkeley, California 94720, USA

  • *jordanh@berkeley.edu
  • Present address: Alice & Bob, 53 Boulevard du General Martial Valin, 75015 Paris, France.
  • Present address: Google Quantum AI, Mountain View, California, 94043, USA.
  • §tjproct@sandia.gov
  • Present address: PsiQuantum, Palo Alto, California, 94304, USA.
  • Present address: IonQ, College Park, Maryland, 20740, USA.

Popular Summary

Quantum computers are scaling up rapidly, and with that comes a need to measure the performance of large-scale quantum devices. Randomized benchmarking protocols, the most widely used methods today, are limited in scalability, as they require hard classical computations unless limited to quantum gates that are easy to simulate classically. To fully assess a quantum computer, researchers need to study universal gate sets, which can perform general quantum computations. Our benchmarking technique, mirror randomized benchmarking (MRB) of universal gate sets, overcomes this classical computation roadblock and can scale to thousands of qubits on a variety of universal gate sets.

We use MRB of universal gate sets to study multiple gate sets on two processors, providing experimental evidence that it is a reliable method for measuring average error. We perform our experiments on up to 27 qubits and use our results to understand the magnitude of various types of errors. Our results show that MRB on many qubits reveals and quantifies crosstalk, a major error source in current processors that is not fully captured by running one- and two-qubit circuits. We find that such errors dominate in the many-qubit regime on a 27-qubit IBM Q processor, highlighting the importance of scalable benchmarks.

MRB with universal gate sets will allow experimentalists to assess the performance of more qubits and a wider variety of gates on their quantum processors than existing techniques. Additionally, our method can be adapted to create other benchmarks, providing further interesting information about quantum processors.

Key Image

Article Text

Click to Expand

References

Click to Expand
Issue

Vol. 13, Iss. 4 — October - December 2023

Subject Areas
Reuse & Permissions
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review X

Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

×

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×