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

Advances in intelligent systems and computing

Randomized Benchmarking of Quantum Gates on a GPU

Syed Zawad, Feng Yan, Rui Wu, Lee Barford, Frederick C. Harris

Published Jan 1, 2019• 0 citations
Publisher
DOI
10.1007/978-3-030-14070-0_42

Related papers

Randomized benchmarking of quantum gates implemented by electron spin resonance

Daniel K. Park, Guanru Feng, Robabeh Rahimi +2 more

arXiv:1510.04779•Journal of Magnetic Resonance•Apr 29, 2016•15 citations

A New Universal Quantum Gates and Its Simulation on GPGPU

Huimin Luo, Jiabin Yuan, Wenjing Dai

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

Characterization of Quantum Gate Noise Using Randomized Benchmarking

Goutam Paul

Benchmarking noise in quantum gates is crucial for developing dependable quantum computers, as noise directly affects gate fidelity and computational accuracy. Randomized benchmarking (RB) protocols, which evaluate performance through random gate sequences, provide a reliable way to quantify average error rates due to their scalability and robustness in averaging out complex, device-specific noise. In this talk, we will discuss several variants of randomized benchmarking protocols including an overview of our recent work in this area.

River Publishers eBooks•Jan 26, 2026•0 citations

Randomized benchmarking of many-qubit devices

Timothy J Proctor, Kenneth Rudinger, Robin Blume-Kohout +3 more

APS•Jan 1, 2019•0 citations

Demonstrating scalable benchmarking of universal gate sets.

Jordan Hines, Marie Lu, Ravi Naik +10 more

Many-qubit errors such as crosstalk are not apparent in low-width circuits Randomized Benchmarking (RB) [1] and Random Circuit Sampling (RCS) [2] characterize average gate performance • Large gate overhead (RB) • High computational cost for universal gate sets (RB, RCS) Circuit mirroring [3]: Flexible technique for designing scalable benchmarks Scalable Randomized Benchmarking

•Mar 1, 2022•0 citations

A framework for randomized benchmarking over compact groups

Linghang Kong

Characterization of experimental systems is an essential step in developing and improving quantum hardware. A collection of protocols known as Randomized Benchmarking (RB) was developed in the past decade, which provides an efficient way to measure error rates in quantum systems. In a recent paper (arxiv:2010.07974), a general framework for RB was proposed, which encompassed most of the known RB protocols and overcame the limitation on error models in previous works. However, even this general framework has a restriction: it can only be applied to a finite group of gates. This does not meet the need posed by experiments, in particular the demand for benchmarking non-Clifford gates and continuous gate sets on quantum devices. In this work we generalize the RB framework to continuous groups of gates and show that as long as the noise level is reasonably small, the output can be approximated as a linear combination of matrix exponential decays. As an application, we numerically study the fully randomized benchmarking protocol (i.e. RB with the entire unitary group as the gate set) enabled by our proof. This provides a unified way to estimate the gate fidelity for any quantum gate in an experiment.

arXiv:2111.10357•Nov 19, 2021•4 citations
Benchmarking noise in quantum gates is crucial for developing dependable quantum computers, as noise directly affects gate fidelity and computational accuracy. Randomized benchmarking (RB) protocols, which evaluate performance through random gate sequences, provide a reliable way to quantify average error rates due to their scalability and robustness in averaging out complex, device-specific noise. In this talk, we will discuss several variants of randomized benchmarking protocols including an overview of our recent work in this area.
Characterization of experimental systems is an essential step in developing and improving quantum hardware. A collection of protocols known as Randomized Benchmarking (RB) was developed in the past decade, which provides an efficient way to measure error rates in quantum systems. In a recent paper (arxiv:2010.07974), a general framework for RB was proposed, which encompassed most of the known RB protocols and overcame the limitation on error models in previous works. However, even this general framework has a restriction: it can only be applied to a finite group of gates. This does not meet the need posed by experiments, in particular the demand for benchmarking non-Clifford gates and continuous gate sets on quantum devices. In this work we generalize the RB framework to continuous groups of gates and show that as long as the noise level is reasonably small, the output can be approximated as a linear combination of matrix exponential decays. As an application, we numerically study the fully randomized benchmarking protocol (i.e. RB with the entire unitary group as the gate set) enabled by our proof. This provides a unified way to estimate the gate fidelity for any quantum gate in an experiment.