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

Bulletin of the American Physical Society

A proposed gold standard family of protocols for benchmarking and diagnosing elementary quantum gate operations

Kristine Boone, Arnaud Carignan-Dugas, Joel J. Wallman, Ian Hincks, Dar Dahlen, Joseph Emerson

Published Mar 4, 2020• 0 citations
OpenAlex

Related papers

Concepts and methods for benchmarking quantum computers

Kristine Boone

Quantum computers have the potential to bring about a new age of technology, but in order for them to become a reality, the elephant in the room must be addressed, quantum errors. The complexity of quantum errors grows exponentially as the system size is increased; scalable characterization protocols which work under physically realistic noise are therefore needed to assess and optimize control. \n \nRandomized Benchmarking (RB) is a family of characterization protocols with the requisite qualities. RB protocols are independent of state preparation and measurement (SPAM) errors, and because they extract partial information about the error profiles in the form of figures of merit, they are scalable in the number of qubits. In this thesis, we study these figures of merit under various error models, gate-sets, and sample distributions, to further our understanding of their physical meaning, and to fine-tune the best practice for diagnosing errors in basic gate-sets. \n \nThe first study presented in this thesis looks at the physical meaning of the unitarity under physically realistic gate-dependent noise. Numerically, we demonstrate that under these realistic noise models, the unitarity obtained via Extended RB (XRB) overlaps strongly with the average of the unitarity of the errors over the set of individual operations. \n \nThe second study numerically and analytically proves that the Standard RB (SRB) decay parameter p coincides with the decay parameter of the novel figure of merit gate-set circuit fidelity. We also prove that, in the limit of high-fidelity single-qubit experiments, the disconnect between the average gate fidelity and SRB experimental results is caused by a basis mismatch between the gates and the state-preparation and measurement procedures. \n \nIn the third part of this thesis, we compare the results of two variations of the SRB protocol, one that samples uniformly (SRB) and one that samples non-uniformly (NIST RB) from the Clifford group. We prove that NIST RB produces an exponential fidelity curve that gives different infidelity results than SRB. \n \nThe fourth and final study gives a standard for assessing basic gate-sets. Experimental results are given from the assessment run on super-conducting and ion-trap devices. We also experimentally show how the systematic error bounds can be tightened by accounting for the error's degree of coherence, as well as using weaker randomizing sets.

•Jul 9, 2021•0 citations

An Effective Framework for Full-Stack Benchmarking of Quantum Computers

Michele Amoretti

•Apr 26, 2021•5 citations

A Logic for Quantum Circuits and Protocols

Manas K. Patra

Lecture notes in computer science•Jan 1, 2005•6 citations

A walk through quantum noise: a study of error signatures and characterization methods

Arnaud Carignan-Dugas

The construction of large scale quantum computing devices might be one of the most exciting \nand promising endeavors of the 21st century, but it also comes with many challenges. \nAs quantum computers are supplemented with more registers, their error profile generally \ngrows in complexity, rendering the enterprise of quantifying the reliability of quantum computations \nincreasingly difficult through naive characterization techniques. In the last decade, \na lot of efforts has been directed toward developing highly scalable benchmarking schemes. \nA leading family of characterization methods built upon scalable principles is known as randomized \nbenchmarking (RB). \nIn this thesis, many tools are presented with the objective of improving the scalability, \nand versatility of RB techniques, as well as demonstrating their reliability under various \nerror models. \nThe first part of this work investigates the connection between the error of individual \ncircuit components and the error of their composition. Before reasoning about intricate circuit \nconstructions, it is shown that there exists a well-motivated way to define decoherent \nquantum channels, and that every channel can be factorized into a unitary-decoherent composition. \nThis dichotomy carries to the circuit evolution of important error parameters by \nassuming realistic error scenarios. Those results are used to improve the confidence interval \nof RB diagnoses and to reconcile experimentally estimated parameters with physically and \noperationally meaningful quantities. \nIn the second part of this thesis, various RB schemes are either developed or more rigorously \nanalyzed. A first result consists of the introduction of “dihedral benchmarking”, a \ntechnique which, if performed in conjunction with standard RB protocols, enables the characterization \nof operations that form a universal gate-set. Finally, rigorous analysis tools are \nprovided to demonstrate the reliability of a highly scalable family of generator-based RB \nprotocols known as direct RB.

•Sep 17, 2019•0 citations

Design and Analysis of Quantum Protocols and Algorithms

Krzysztof Bar

•Jan 1, 2012•0 citations

Qutrit Randomized Benchmarking

Alexis Morvan, Vinay Ramasesh, Machiel Blok +7 more

Ternary quantum processors offer significant potential computational advantages over conventional qubit technologies, leveraging the encoding and processing of quantum information in qutrits (three-level systems). To evaluate and compare the performance of such emerging quantum hardware it is essential to have robust benchmarking methods suitable for a higher-dimensional Hilbert space. We demonstrate extensions of industry standard randomized benchmarking (RB) protocols, developed and used extensively for qubits, suitable for ternary quantum logic. Using a superconducting five-qutrit processor, we find an average single-qutrit process infidelity of 3.8×10^{-3}. Through interleaved RB, we characterize a few relevant gates, and employ simultaneous RB to fully characterize crosstalk errors. Finally, we apply cycle benchmarking to a two-qutrit CSUM gate and obtain a two-qutrit process fidelity of 0.85. Our results present and demonstrate RB-based tools to characterize the performance of a qutrit processor, and a general approach to diagnose control errors in future qudit hardware.

arXiv:2008.09134•Physical Review Letters•May 27, 2021•141 citations
Quantum computers have the potential to bring about a new age of technology, but in order for them to become a reality, the elephant in the room must be addressed, quantum errors. The complexity of quantum errors grows exponentially as the system size is increased; scalable characterization protocols which work under physically realistic noise are therefore needed to assess and optimize control. \n \nRandomized Benchmarking (RB) is a family of characterization protocols with the requisite qualities. RB protocols are independent of state preparation and measurement (SPAM) errors, and because they extract partial information about the error profiles in the form of figures of merit, they are scalable in the number of qubits. In this thesis, we study these figures of merit under various error models, gate-sets, and sample distributions, to further our understanding of their physical meaning, and to fine-tune the best practice for diagnosing errors in basic gate-sets. \n \nThe first study presented in this thesis looks at the physical meaning of the unitarity under physically realistic gate-dependent noise. Numerically, we demonstrate that under these realistic noise models, the unitarity obtained via Extended RB (XRB) overlaps strongly with the average of the unitarity of the errors over the set of individual operations. \n \nThe second study numerically and analytically proves that the Standard RB (SRB) decay parameter p coincides with the decay parameter of the novel figure of merit gate-set circuit fidelity. We also prove that, in the limit of high-fidelity single-qubit experiments, the disconnect between the average gate fidelity and SRB experimental results is caused by a basis mismatch between the gates and the state-preparation and measurement procedures. \n \nIn the third part of this thesis, we compare the results of two variations of the SRB protocol, one that samples uniformly (SRB) and one that samples non-uniformly (NIST RB) from the Clifford group. We prove that NIST RB produces an exponential fidelity curve that gives different infidelity results than SRB. \n \nThe fourth and final study gives a standard for assessing basic gate-sets. Experimental results are given from the assessment run on super-conducting and ion-trap devices. We also experimentally show how the systematic error bounds can be tightened by accounting for the error's degree of coherence, as well as using weaker randomizing sets.
The construction of large scale quantum computing devices might be one of the most exciting \nand promising endeavors of the 21st century, but it also comes with many challenges. \nAs quantum computers are supplemented with more registers, their error profile generally \ngrows in complexity, rendering the enterprise of quantifying the reliability of quantum computations \nincreasingly difficult through naive characterization techniques. In the last decade, \na lot of efforts has been directed toward developing highly scalable benchmarking schemes. \nA leading family of characterization methods built upon scalable principles is known as randomized \nbenchmarking (RB). \nIn this thesis, many tools are presented with the objective of improving the scalability, \nand versatility of RB techniques, as well as demonstrating their reliability under various \nerror models. \nThe first part of this work investigates the connection between the error of individual \ncircuit components and the error of their composition. Before reasoning about intricate circuit \nconstructions, it is shown that there exists a well-motivated way to define decoherent \nquantum channels, and that every channel can be factorized into a unitary-decoherent composition. \nThis dichotomy carries to the circuit evolution of important error parameters by \nassuming realistic error scenarios. Those results are used to improve the confidence interval \nof RB diagnoses and to reconcile experimentally estimated parameters with physically and \noperationally meaningful quantities. \nIn the second part of this thesis, various RB schemes are either developed or more rigorously \nanalyzed. A first result consists of the introduction of “dihedral benchmarking”, a \ntechnique which, if performed in conjunction with standard RB protocols, enables the characterization \nof operations that form a universal gate-set. Finally, rigorous analysis tools are \nprovided to demonstrate the reliability of a highly scalable family of generator-based RB \nprotocols known as direct RB.
Ternary quantum processors offer significant potential computational advantages over conventional qubit technologies, leveraging the encoding and processing of quantum information in qutrits (three-level systems). To evaluate and compare the performance of such emerging quantum hardware it is essential to have robust benchmarking methods suitable for a higher-dimensional Hilbert space. We demonstrate extensions of industry standard randomized benchmarking (RB) protocols, developed and used extensively for qubits, suitable for ternary quantum logic. Using a superconducting five-qutrit processor, we find an average single-qutrit process infidelity of 3.8×10^{-3}. Through interleaved RB, we characterize a few relevant gates, and employ simultaneous RB to fully characterize crosstalk errors. Finally, we apply cycle benchmarking to a two-qutrit CSUM gate and obtain a two-qutrit process fidelity of 0.85. Our results present and demonstrate RB-based tools to characterize the performance of a qutrit processor, and a general approach to diagnose control errors in future qudit hardware.