Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

APS March Meeting Abstracts

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

Ryan Shaffer, Hang Ren, Emiliia Dyrenkova, Christopher G. Yale, Daniel Lobser, Ashlyn D. Burch, Matthew N. H. Chow, Melissa Revelle, Susan Clark, Hartmut Häffner

Published Mar 1, 2023• 0 citations
Publisher
DOI
10.2172/2431887

Related papers

Efficiently Verifying Quantum Programs with Few T Gates

Youngchan Cho, Robert Rand

Lecture notes in computer science•Jan 1, 2026•1 citation

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

Ryan Shaffer, Hang Ren, Emiliia Dyrenkova +7 more

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:2205.13074•Quantum•May 4, 2023•10 citations

Model Checking for Verification of Quantum Circuits

Mingsheng Ying

arXiv:2104.11359•Lecture notes in computer science•Jan 1, 2021•15 citations

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

Ryan Shaffer, Hang Ren, Emiliia Dyrenkova +10 more

Approximate compilation of RAV inversion sequence via STOQSTOQ is a stochastic approximate compilation technique for compiling unitaries in terms of an arbitrary set of native gates, which may be fixed or parameterized. Verification of analog simulatorsError sensitivity Hardware requirements Scalability Time-reversal benchmarking Incoherent noise Implement time reversal of Hamiltonian Scalable to large n Cross-entropy benchmarking (XEB) Coherent errors, incoherent noise Implement programmable Hamiltonian terms Infeasible for n >> 50 Randomized analog verification (RAV) Coherent errors, incoherent noise Implement programmable Hamiltonian terms Infeasible for n >> 10 Verification of gate-based devices Building blocks Sequence generation

•Oct 1, 2022•0 citations

Efficient particle-conserving symmetric quantum circuits

Babatunde M. Ayeni

The variational quantum simulation technique on gate-based quantum processors can be made more efficient if symmetries of the Hamiltonian system of interest are factored into the design construction of the underlying parameterized quantum circuits (PQC) needed by the technique. In the first part of this work, we present an easy and practical approach that can be used to construct symmetric quantum circuits. The method we present can directly be adapted for any symmetry, though in the present work we focus explicitly on the examples of Z 2 , Z 3 , and particle number conservation. We show how to construct symmetric gates that respects the aforementioned symmetries. In the second part, we focus on numerical analysis of parameterized particle-conserving gates. In variational quantum simulation, for example, the variational quantum eigensolver (VQE), the symmetric gates of the PQC are parameterized. Since there are often many possible inequivalent parametrizations, it is often not immediately obvious which gate parametrization would be most efficient in general for a wide range of Hamiltonians that respect the symmetry. We streamline our analysis to particle-conserving circuits and Hamiltonians. We numerically analyze the efficiency of different particle-conserving gate parametrizations by studying two examples, namely, a physics problem of learning the ground state of Heisenberg spin chains, and an artificial problem of learning the random arbitary states sampled within the particle number conserved subspace.

arXiv:2406.12130•Physical Review A•Feb 25, 2025•1 citation

Classical Verification of Quantum Computations with Efficient Verifier

Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa

arXiv:1912.00990•Lecture notes in computer science•Jan 1, 2020•27 citations
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.
Approximate compilation of RAV inversion sequence via STOQSTOQ is a stochastic approximate compilation technique for compiling unitaries in terms of an arbitrary set of native gates, which may be fixed or parameterized. Verification of analog simulatorsError sensitivity Hardware requirements Scalability Time-reversal benchmarking Incoherent noise Implement time reversal of Hamiltonian Scalable to large n Cross-entropy benchmarking (XEB) Coherent errors, incoherent noise Implement programmable Hamiltonian terms Infeasible for n >> 50 Randomized analog verification (RAV) Coherent errors, incoherent noise Implement programmable Hamiltonian terms Infeasible for n >> 10 Verification of gate-based devices Building blocks Sequence generation
The variational quantum simulation technique on gate-based quantum processors can be made more efficient if symmetries of the Hamiltonian system of interest are factored into the design construction of the underlying parameterized quantum circuits (PQC) needed by the technique. In the first part of this work, we present an easy and practical approach that can be used to construct symmetric quantum circuits. The method we present can directly be adapted for any symmetry, though in the present work we focus explicitly on the examples of Z 2 , Z 3 , and particle number conservation. We show how to construct symmetric gates that respects the aforementioned symmetries. In the second part, we focus on numerical analysis of parameterized particle-conserving gates. In variational quantum simulation, for example, the variational quantum eigensolver (VQE), the symmetric gates of the PQC are parameterized. Since there are often many possible inequivalent parametrizations, it is often not immediately obvious which gate parametrization would be most efficient in general for a wide range of Hamiltonians that respect the symmetry. We streamline our analysis to particle-conserving circuits and Hamiltonians. We numerically analyze the efficiency of different particle-conserving gate parametrizations by studying two examples, namely, a physics problem of learning the ground state of Heisenberg spin chains, and an artificial problem of learning the random arbitary states sampled within the particle number conserved subspace.