Demonstrating Scalable Randomized Benchmarking of Universal Gate Sets
[1];
[2];
[3];
[5]
- University of California, Berkeley, CA (United States); Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States). Quantum Performance Laboratory
- University of California, Berkeley, CA (United States)
- University of California, Berkeley, CA (United States); Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States). Computational Research Division
- University of California, Berkeley, CA (United States); Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States). Materials Sciences Division
- Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States). Quantum Performance Laboratory
- University of California, Berkeley, CA (United States); Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States). Computational Research Division; Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States). Materials Sciences Division
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.
- Research Organization:
- Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States); Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR); USDOE Laboratory Directed Research and Development (LDRD) Program; USDOE National Nuclear Security Administration (NNSA)
- Grant/Contract Number:
- AC02-05CH11231; NA0003525; NA-0003525
- OSTI ID:
- 2205706
- Alternate ID(s):
- OSTI ID: 2350930
- Journal Information:
- Physical Review. X, Vol. 13, Issue 4; ISSN 2160-3308
- Publisher:
- American Physical Society (APS)Copyright Statement
- Country of Publication:
- United States
- Language:
- English
Similar Records
Fully Scalable Randomized Benchmarking Without Motion Reversal
Clifford Circuit Optimization with Templates and Symbolic Pauli Gates