Southwest Quantum Information and Technology

Efficient experimental verification of continuously-parameterized gate sets and analog quantum simulators

Presenting Author: Ryan Shaffer, University of California Berkeley
Contributing Author(s): Hang Ren, Emiliia Dyrenkova, Eli Megidish, Joseph Broz, Wei-Ting Chen, Christopher G. Yale, Daniel S. Lobser, Ashlyn D. Burch, Matthew N. H. Chow, Melissa C. Revelle, Susan M. Clark, Hartmut Häffner

Near-term quantum information processors will not be capable of quantum error correction, but instead will implement algorithms using the physical native interactions of the device. These interactions can be used to implement quantum gates that are often continuously-parameterized (e.g., by rotation angles), as well as to implement analog quantum simulations that seek to explore the dynamics of a particular Hamiltonian of interest. Verification of the correct operation of these gates across the allowable range of parameters is important for gaining confidence in the reliability of these devices. In this work, we introduce the randomized analog verification (RAV) technique for efficient experimental verification of continuously-parameterized quantum gate sets and analog quantum simulators. We show that fidelity estimates made via this technique have a lower variance than fidelity estimates made via cross-entropy benchmarking, which thus provides an efficiency advantage when estimating the error rate to some desired precision. We demonstrate the efficiency advantage of this technique both numerically and experimentally. We describe the experimental realization of this technique using a continuously-parameterized quantum gate set on a trapped-ion processor from Sandia QSCOUT and on a superconducting processor from IBM Q.

Read this article online: https://arxiv.org/abs/2205.13074, https://doi.org/10.1038/s41534-021-00380-8

(Session 5 : Thursday from 5:00 pm - 7:00 pm)