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

arXiv:1801.06121 · Quantum

Real Randomized Benchmarking

A. K. Hashagen, Steven T. Flammia, D. Gross, Joel J. Wallman

Published Aug 22, 2018• 65 citations
arXivHTMLPDF

Abstract

Randomized benchmarking provides a tool for obtaining precise quantitative estimates of the average error rate of a physical quantum channel. Here we define real randomized benchmarking, which enables a separate determination of the average error rate in the real and complex parts of the channel. This provides more fine-grained information about average error rates with approximately the same cost as the standard protocol. The protocol requires only averaging over the real Clifford group, a subgroup of the full complex Clifford group, and makes use of the fact that it forms an orthogonal 2-design. It therefore allows benchmarking of fault-tolerant gates for an encoding which does not contain the full Clifford group transversally. Furthermore, our results are especially useful when considering quantum computations on rebits (or real encodings of complex computations), in which case the real Clifford group now plays the role of the complex Clifford group when studying stabilizer circuits.

DOI
10.22331/q-2018-08-22-85

Related papers

Scalable randomised benchmarking of non-Clifford gates

Andrew W. Cross, Easwar Magesan, Lev S. Bishop +2 more

Randomised benchmarking is a widely used experimental technique to characterise the average error of quantum operations. Benchmarking procedures that scale to enable the characterisation of n-qubit circuits rely on efficient procedures for manipulating those circuits and, as such, have been limited to subgroups of the Clifford group. However, universal quantum computers require additional, non-Clifford gates to approximate arbitrary unitary transformations. We define a scalable randomised benchmarking procedure over n-qubit unitary matrices that correspond to protected non-Clifford gates for a class of stabiliser codes. We present efficient methods for representing and composing group elements, sampling them uniformly and synthesising corresponding poly(n)-sized circuits. The procedure provides experimental access to two independent parameters that together characterise the average gate fidelity of a group element. A scalable procedure to determine the error of quantum operations has been developed by researchers in the United States. Andrew Cross and colleagues at the IBM T.J. Watson Research Center have expanded previously used protocols to a broader range of quantum circuits, thereby enabling error benchmarking for all common logical operations used in leading quantum computing protocols. The standard technique for error characterization in these devices is randomized benchmarking, which provides benefits such as insensitivity to measurement errors, but on the other hand only functions in a limited number of circumstances. In their theoretical study, the researchers demonstrate how randomized benchmarking approaches can be expanded to a much broader range of logical operations. The procedure can be readily implemented experimentally, and provides access to important experimental noise parameters in quantum computing.

npj Quantum Information•Apr 26, 2016•97 citations

Scalable randomized benchmarking of non-Clifford gates

Andrew W. Cross, Easwar Magesan, Lev S. Bishop +2 more

Randomized benchmarking is a widely used experimental technique to characterize the average error of quantum operations. Benchmarking procedures that scale to enable characterization of $n$-qubit circuits rely on efficient procedures for manipulating those circuits and, as such, have been limited to subgroups of the Clifford group. However, universal quantum computers require additional, non-Clifford gates to approximate arbitrary unitary transformations. We define a scalable randomized benchmarking procedure over $n$-qubit unitary matrices that correspond to protected non-Clifford gates for a class of stabilizer codes. We present efficient methods for representing and composing group elements, sampling them uniformly, and synthesizing corresponding $\mathrm{poly}(n)$-sized circuits. The procedure provides experimental access to two independent parameters that together characterize the average gate fidelity of a group element.

arXiv:1510.02720•Bulletin of the American Physical Society•Oct 9, 2015•17 citations

Estimating the fidelity of T gates using standard interleaved randomized benchmarking

Robin Harper, Steven T. Flammia

Abstract Randomized benchmarking is an important protocol for robustly characterizing the error rates of quantum gates. The technique is typically applied to the Clifford gates since they form a group that satisfies a convenient technical condition of forming a unitary 2-design, in addition to having a tight connection to fault-tolerant quantum computing and an efficient classical simulation. In order to achieve universal quantum computing one must add at least one additional gate such as the T gate (also known as the π /8 gate). Here we propose and analyze a simple variation of the standard interleaved RB protocol that can accurately estimate the average fidelity of the T gate while retaining the many advantages of a unitary 2-design and the fidelity guarantees that such a design delivers, as well as the efficient classical simulation property of the Clifford group. Our work complements prior methods that have succeeded in estimating T gate fidelities, but only by relaxing the 2-design constraint and using a more complicated data analysis.

arXiv:1608.02943•Quantum Science and Technology•Feb 9, 2017•42 citations

Complete randomized benchmarking protocol accounting for leakage errors

Tobias Chasseur, Frank K. Wilhelm

Randomized benchmarking allows one to efficiently and scalably characterize the average error of a unitary 2-design such as the Clifford group $\mathcal{C}$ on a physical candidate for quantum computation, as long as there are no noncomputational leakage levels in the system. We investigate the effect of leakage errors on randomized benchmarking induced from an additional level per physical qubit and provide a modified protocol that allows us to derive reliable estimates for the error per gate in their presence. We assess the variance of the sequence fidelity corresponding to the number of random sequences needed for valid fidelity estimation. Our protocol allows for gate-dependent error channels without being restricted to perturbations. We show that our protocol is compatible with interleaved randomized benchmarking and expand to benchmarking of arbitrary gates. This setting is relevant for superconducting transmon qubits, among other systems.

arXiv:1505.00580•Physical Review A•Oct 30, 2015•41 citations

Direct Randomized Benchmarking for Multiqubit Devices

Timothy J Proctor, Arnaud Carignan-Dugas, Kenneth Rudinger +3 more

Benchmarking methods that can be adapted to multiqubit systems are essential for assessing the overall or "holistic" performance of nascent quantum processors. The current industry standard is Clifford randomized benchmarking (RB), which measures a single error rate that quantifies overall performance. But, scaling Clifford RB to many qubits is surprisingly hard. It has only been performed on one, two, and three qubits as of this writing. This reflects a fundamental inefficiency in Clifford RB: the n-qubit Clifford gates at its core have to be compiled into large circuits over the one- and two-qubit gates native to a device. As n grows, the quality of these Clifford gates quickly degrades, making Clifford RB impractical at relatively low n. In this Letter, we propose a direct RB protocol that mostly avoids compiling. Instead, it uses random circuits over the native gates in a device, which are seeded by an initial layer of Clifford-like randomization. We demonstrate this protocol experimentally on two to five qubits using the publicly available ibmqx5. We believe this to be the greatest number of qubits holistically benchmarked, and this was achieved on a freely available device without any special tuning up. Our protocol retains the simplicity and convenient properties of Clifford RB: it estimates an error rate from an exponential decay. But, it can be extended to processors with more qubits-we present simulations on 10+ qubits-and it reports a more directly informative and flexible error rate than the one reported by Clifford RB. We show how to use this flexibility to measure separate error rates for distinct sets of gates, and we use this method to estimate the average error rate of a set of cnot gates.

arXiv:1807.07975•Physical Review Letters•Jul 19, 2019•128 citations

Randomized benchmarking under different gate sets

Kristine Boone, Arnaud Carignan-Dugas, Joel J. Wallman +1 more

We provide a comprehensive analysis of the differences between two important standards for randomized benchmarking (RB): the Clifford-group RB protocol proposed originally in Emerson et al. [J. Opt. B 7, S347 (2005)] and Dankert et al. [Phys. Rev. A 80, 012304 (2009)], and a variant of that RB protocol proposed by the NIST group in Knill et al. [Phys. Rev. A 77, 012307 (2008)]. While these two protocols are frequently conflated or presumed equivalent, we prove that they produce distinct exponential fidelity decays leading to differences of up to a factor of 3 in the estimated error rates under experimentally realistic conditions. These differences arise because the NIST RB protocol does not satisfy the unitary two-design condition for the twirl in the Clifford-group protocol and thus the decay rate depends on noninvariant features of the error model. Our analysis provides an important first step toward developing definitive standards for benchmarking quantum gates and a more rigorous theoretical underpinning for the NIST protocol and other RB protocols lacking a group-structure. We conclude by discussing the potential impact of these differences for estimating fault-tolerant overheads.

arXiv:1811.01920•Physical Review A•Mar 20, 2019•20 citations
Randomized benchmarking provides a tool for obtaining precise quantitative estimates of the average error rate of a physical quantum channel. Here we define real randomized benchmarking, which enables a separate determination of the average error rate in the real and complex parts of the channel. This provides more fine-grained information about average error rates with approximately the same cost as the standard protocol. The protocol requires only averaging over the real Clifford group, a subgroup of the full complex Clifford group, and makes use of the fact that it forms an orthogonal 2-design. It therefore allows benchmarking of fault-tolerant gates for an encoding which does not contain the full Clifford group transversally. Furthermore, our results are especially useful when considering quantum computations on rebits (or real encodings of complex computations), in which case the real Clifford group now plays the role of the complex Clifford group when studying stabilizer circuits.
Randomised benchmarking is a widely used experimental technique to characterise the average error of quantum operations. Benchmarking procedures that scale to enable the characterisation of n-qubit circuits rely on efficient procedures for manipulating those circuits and, as such, have been limited to subgroups of the Clifford group. However, universal quantum computers require additional, non-Clifford gates to approximate arbitrary unitary transformations. We define a scalable randomised benchmarking procedure over n-qubit unitary matrices that correspond to protected non-Clifford gates for a class of stabiliser codes. We present efficient methods for representing and composing group elements, sampling them uniformly and synthesising corresponding poly(n)-sized circuits. The procedure provides experimental access to two independent parameters that together characterise the average gate fidelity of a group element. A scalable procedure to determine the error of quantum operations has been developed by researchers in the United States. Andrew Cross and colleagues at the IBM T.J. Watson Research Center have expanded previously used protocols to a broader range of quantum circuits, thereby enabling error benchmarking for all common logical operations used in leading quantum computing protocols. The standard technique for error characterization in these devices is randomized benchmarking, which provides benefits such as insensitivity to measurement errors, but on the other hand only functions in a limited number of circumstances. In their theoretical study, the researchers demonstrate how randomized benchmarking approaches can be expanded to a much broader range of logical operations. The procedure can be readily implemented experimentally, and provides access to important experimental noise parameters in quantum computing.
Randomized benchmarking is a widely used experimental technique to characterize the average error of quantum operations. Benchmarking procedures that scale to enable characterization of nnn-qubit circuits rely on efficient procedures for manipulating those circuits and, as such, have been limited to subgroups of the Clifford group. However, universal quantum computers require additional, non-Clifford gates to approximate arbitrary unitary transformations. We define a scalable randomized benchmarking procedure over nnn-qubit unitary matrices that correspond to protected non-Clifford gates for a class of stabilizer codes. We present efficient methods for representing and composing group elements, sampling them uniformly, and synthesizing corresponding poly(n)\mathrm{poly}(n)poly(n)-sized circuits. The procedure provides experimental access to two independent parameters that together characterize the average gate fidelity of a group element.
Abstract Randomized benchmarking is an important protocol for robustly characterizing the error rates of quantum gates. The technique is typically applied to the Clifford gates since they form a group that satisfies a convenient technical condition of forming a unitary 2-design, in addition to having a tight connection to fault-tolerant quantum computing and an efficient classical simulation. In order to achieve universal quantum computing one must add at least one additional gate such as the T gate (also known as the π /8 gate). Here we propose and analyze a simple variation of the standard interleaved RB protocol that can accurately estimate the average fidelity of the T gate while retaining the many advantages of a unitary 2-design and the fidelity guarantees that such a design delivers, as well as the efficient classical simulation property of the Clifford group. Our work complements prior methods that have succeeded in estimating T gate fidelities, but only by relaxing the 2-design constraint and using a more complicated data analysis.
Randomized benchmarking allows one to efficiently and scalably characterize the average error of a unitary 2-design such as the Clifford group C\mathcal{C}C on a physical candidate for quantum computation, as long as there are no noncomputational leakage levels in the system. We investigate the effect of leakage errors on randomized benchmarking induced from an additional level per physical qubit and provide a modified protocol that allows us to derive reliable estimates for the error per gate in their presence. We assess the variance of the sequence fidelity corresponding to the number of random sequences needed for valid fidelity estimation. Our protocol allows for gate-dependent error channels without being restricted to perturbations. We show that our protocol is compatible with interleaved randomized benchmarking and expand to benchmarking of arbitrary gates. This setting is relevant for superconducting transmon qubits, among other systems.
Benchmarking methods that can be adapted to multiqubit systems are essential for assessing the overall or "holistic" performance of nascent quantum processors. The current industry standard is Clifford randomized benchmarking (RB), which measures a single error rate that quantifies overall performance. But, scaling Clifford RB to many qubits is surprisingly hard. It has only been performed on one, two, and three qubits as of this writing. This reflects a fundamental inefficiency in Clifford RB: the n-qubit Clifford gates at its core have to be compiled into large circuits over the one- and two-qubit gates native to a device. As n grows, the quality of these Clifford gates quickly degrades, making Clifford RB impractical at relatively low n. In this Letter, we propose a direct RB protocol that mostly avoids compiling. Instead, it uses random circuits over the native gates in a device, which are seeded by an initial layer of Clifford-like randomization. We demonstrate this protocol experimentally on two to five qubits using the publicly available ibmqx5. We believe this to be the greatest number of qubits holistically benchmarked, and this was achieved on a freely available device without any special tuning up. Our protocol retains the simplicity and convenient properties of Clifford RB: it estimates an error rate from an exponential decay. But, it can be extended to processors with more qubits-we present simulations on 10+ qubits-and it reports a more directly informative and flexible error rate than the one reported by Clifford RB. We show how to use this flexibility to measure separate error rates for distinct sets of gates, and we use this method to estimate the average error rate of a set of cnot gates.
We provide a comprehensive analysis of the differences between two important standards for randomized benchmarking (RB): the Clifford-group RB protocol proposed originally in Emerson et al. [J. Opt. B 7, S347 (2005)] and Dankert et al. [Phys. Rev. A 80, 012304 (2009)], and a variant of that RB protocol proposed by the NIST group in Knill et al. [Phys. Rev. A 77, 012307 (2008)]. While these two protocols are frequently conflated or presumed equivalent, we prove that they produce distinct exponential fidelity decays leading to differences of up to a factor of 3 in the estimated error rates under experimentally realistic conditions. These differences arise because the NIST RB protocol does not satisfy the unitary two-design condition for the twirl in the Clifford-group protocol and thus the decay rate depends on noninvariant features of the error model. Our analysis provides an important first step toward developing definitive standards for benchmarking quantum gates and a more rigorous theoretical underpinning for the NIST protocol and other RB protocols lacking a group-structure. We conclude by discussing the potential impact of these differences for estimating fault-tolerant overheads.