Sample-efficient verification of continuously-parameterized quantum gates for small quantum processors
arXiv:2205.13074 · doi:10.22331/q-2023-05-04-997
Abstract
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.
arXiv comment29 pages, 12 figures. This manuscript supersedes arXiv:2101.04474
References in corpus (45)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Elementary gates for quantum computation
- Experimental One-Way Quantum Computing
- Characterizing Quantum Supremacy in Near-Term Devices
- Quantum computation with ions in thermal motion
- Randomized Benchmarking of Quantum Gates
- Multi-particle entanglement of hot trapped ions
- Hamiltonian Simulation by Qubitization
- Demonstration of a small programmable quantum computer with atomic qubits
- A simple formula for the average gate fidelity of a quantum dynamical operation
- Efficient quantum state tomography
- Noise tailoring for scalable quantum computation via randomized compiling
- Scalable Noise Estimation with Random Unitary Operators
- Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
- Quantum-assisted quantum compiling
- A random compiler for fast Hamiltonian simulation
- Random Quantum Circuits are Approximate 2-designs
- Self-Consistent Quantum Process Tomography
- Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
- Characterizing large-scale quantum computers via cycle benchmarking
- Efficient tomography of a quantum many-body system
- Arbitrarily accurate composite pulses
- Efficient measurement of quantum dynamics via compressive sensing
- Gate Set Tomography
- Noise Resilience of Variational Quantum Compiling
- Faster quantum simulation by randomization
- Verification of quantum computation: An overview of existing approaches
- Phase Control of Trapped Ion Quantum Gates
- Entanglement of Atomic Qubits using an Optical Frequency Comb
- ScaffCC: Scalable Compilation and Analysis of Quantum Programs
- Efficient Discrete Approximations of Quantum Gates
- Direct randomized benchmarking for multi-qubit devices
- Optimal control of entangling operations for trapped ion quantum computing
- Compiling quantum algorithms for architectures with multi-qubit gates
- Scalable randomized benchmarking of quantum computers using mirror circuits
- Compilation by stochastic Hamiltonian sparsification
- Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
- Engineering the Quantum Scientific Computing Open User Testbed (QSCOUT): Design details and user guide
- A complete Randomized Benchmarking Protocol accounting for Leakage Errors
- Beat note stabilization of mode-locked lasers for quantum information processing
- Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
- Randomized Benchmarking under Different Gatesets
- Hybrid benchmarking of arbitrary quantum gates
- Practical verification protocols for analog quantum simulators
Cited by in corpus (5)
- Demonstrating scalable randomized benchmarking of universal gate sets
- Benchmarking bosonic modes for quantum information with randomized displacements
- Multi-Mode Global Driving of Trapped Ions for Quantum Circuit Synthesis
- An Error Mitigated Non-Orthogonal Quantum Eigensolver via Shadow Tomography
- Noise-Aware Circuit Compilations for a Continuously Parameterized Two-Qubit Gateset