Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Sample-efficient verification of continuously-parameterized quantum gates for small quantum processors

Journal Article · · Quantum
 [1];  [1];  [1];  [2];  [2];  [2];  [3];  [2];  [2];  [1]
  1. University of California, Berkeley, CA (United States)
  2. Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
  3. Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States); Univ. of New Mexico, Albuquerque, NM (United States)

Most near-term quantum information processing devices will not be capable of implementing quantum error correction and the associated logical quantum gate set. Instead, quantum circuits will be implemented directly using the physical native gate set of the device. These native gates often have a parameterization (e.g., rotation angles) which provide the ability to perform a continuous range of operations. 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 demonstrate a procedure for sample-efficient verification of continuously-parameterized quantum gates for small quantum processors of up to approximately 10 qubits. This procedure involves generating random sequences of randomly-parameterized layers of gates chosen from the native gate set of the device, and then stochastically compiling an approximate inverse to this sequence such that executing the full sequence on the device should leave the system near its initial state. We show that fidelity estimates made via this technique have a lower variance than fidelity estimates made via cross-entropy benchmarking. This provides an experimentally-relevant advantage in sample efficiency when estimating the fidelity loss to some desired precision. We describe the experimental realization of this technique using continuously-parameterized quantum gate sets on a trapped-ion quantum processor from Sandia QSCOUT and a superconducting quantum processor from IBM Q, and we demonstrate the sample efficiency advantage of this technique both numerically and experimentally.

Research Organization:
Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
Sponsoring Organization:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR); USDOE National Nuclear Security Administration (NNSA); US Air Force Office of Scientific Research (AFOSR); US Army Research Office (ARO); National Science Foundation (NSF)
Grant/Contract Number:
NA0003525
OSTI ID:
2311467
Alternate ID(s):
OSTI ID: 2440366
Report Number(s):
SAND--2023-03170J
Journal Information:
Quantum, Journal Name: Quantum Vol. 7; ISSN 2521-327X
Publisher:
Quantum Science Open CommunityCopyright Statement
Country of Publication:
United States
Language:
English

References (52)

Data and code for: "Scalable randomized benchmarking of quantum computers using mirror circuits" dataset January 2021
Random Quantum Circuits are Approximate 2-designs journal July 2009
Verification of Quantum Computation: An Overview of Existing Approaches journal July 2018
A simple formula for the average gate fidelity of a quantum dynamical operation journal October 2002
ScaffCC: Scalable compilation and analysis of quantum programs journal June 2015
Experimental one-way quantum computing journal March 2005
Demonstration of a small programmable quantum computer with atomic qubits journal August 2016
Efficient quantum state tomography journal December 2010
Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography journal February 2017
Efficient tomography of a quantum many-body system journal September 2017
Characterizing large-scale quantum computers via cycle benchmarking journal November 2019
Practical verification protocols for analog quantum simulators journal March 2021
Characterizing quantum supremacy in near-term devices journal April 2018
Quantum supremacy using a programmable superconducting processor journal October 2019
Efficient discrete approximations of quantum gates journal September 2002
Quantum computations: algorithms and error correction journal December 1997
Compiling quantum algorithms for architectures with multi-qubit gates journal June 2016
Noise resilience of variational quantum compiling journal April 2020
Scalable noise estimation with random unitary operators journal September 2005
Phase control of trapped ion quantum gates journal September 2005
Monte Carlo sampling methods using Markov chains and their applications journal April 1970
Character Randomized Benchmarking for Non-Multiplicity-Free Groups With Applications to Subspace, Leakage, and Matchgate Randomized Benchmarking journal March 2021
Elementary gates for quantum computation journal November 1995
Arbitrarily accurate composite pulse sequences journal November 2004
Randomized benchmarking of quantum gates journal January 2008
Optimal control of entangling operations for trapped-ion quantum computing journal January 2009
Self-consistent quantum process tomography journal June 2013
Complete randomized benchmarking protocol accounting for leakage errors journal October 2015
Noise tailoring for scalable quantum computation via randomized compiling journal November 2016
Hybrid benchmarking of arbitrary quantum gates journal June 2017
Randomized benchmarking under different gate sets journal March 2019
Entanglement of Atomic Qubits Using an Optical Frequency Comb journal April 2010
Efficient Measurement of Quantum Dynamics via Compressive Sensing journal March 2011
Quantum Simulation of Time-Dependent Hamiltonians and the Convenient Illusion of Hilbert Space journal April 2011
Direct Randomized Benchmarking for Multiqubit Devices journal July 2019
Scalable Randomized Benchmarking of Quantum Computers Using Mirror Circuits journal October 2022
Multiparticle Entanglement of Hot Trapped Ions journal March 1999
Quantum Computation with Ions in Thermal Motion journal March 1999
Random Compiler for Fast Hamiltonian Simulation journal August 2019
Reducing quantum computations to elementary unitary operations journal January 2001
Engineering the Quantum Scientific Computing Open User Testbed journal January 2021
Stochastic superoptimization
  • Schkufza, Eric; Sharma, Rahul; Aiken, Alex
  • Proceedings of the eighteenth international conference on Architectural support for programming languages and operating systems - ASPLOS '13 https://doi.org/10.1145/2451116.2451150
conference January 2013
Beat note stabilization of mode-locked lasers for quantum information processing journal January 2014
Quantum Computing in the NISQ era and beyond journal August 2018
Quantum-assisted quantum compiling journal May 2019
Hamiltonian Simulation by Qubitization journal July 2019
Faster quantum simulation by randomization journal September 2019
Compilation by stochastic Hamiltonian sparsification journal February 2020
Gate Set Tomography journal October 2021
Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates journal February 2022
Quantum supremacy using a programmable superconducting processor dataset January 2019
Scalable Randomized Benchmarking of Quantum Computers using Mirror Circuits dataset January 2021

Similar Records

Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits
Journal Article · Fri Sep 27 00:00:00 EDT 2024 · Physical Review Applied · OSTI ID:2461667

Noise-aware circuit compilations for a continuously parameterized two-qubit gateset
Journal Article · Fri Aug 22 00:00:00 EDT 2025 · Physical Review Applied · OSTI ID:2586994