Sample-efficient verification of continuously-parameterized quantum gates for small quantum processors
Ryan Shaffer, Hang Ren, Emiliia Dyrenkova, Christopher G. Yale, Daniel, S. Lobser, Ashlyn D. Burch, Matthew N. H. Chow, Melissa C. Revelle, Susan M., Clark, Hartmut H\"affner

TL;DR
This paper presents a sample-efficient method for verifying the accuracy of continuously-parameterized quantum gates on small quantum processors, demonstrating advantages over existing benchmarking techniques through experiments on ion-trap and superconducting devices.
Contribution
It introduces a novel stochastic compilation-based verification method for continuous quantum gates, improving sample efficiency and fidelity estimation accuracy.
Findings
Fidelity estimates have lower variance than cross-entropy benchmarking.
The method is experimentally demonstrated on ion-trap and superconducting processors.
Sample efficiency advantage is confirmed both numerically and experimentally.
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,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Neural Networks and Applications
