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:2207.07272 · Physical Review X

Demonstrating Scalable Randomized Benchmarking of Universal Gate Sets

Jordan Hines, Marie Lu, Ravi Naik, Akel Hashim, Jean-Loup Ville, Bradley Mitchell, John Mark Kreikebaum, David Santiago, Stefan Seritan, Erik Nielsen, Robin Blume-Kohout, Kevin C Young, Irfan A. Siddiqi, K. Birgitta Whaley, Timothy J Proctor

Published Nov 14, 2023• 33 citations
arXivHTMLPDF

Abstract

Randomized benchmarking (RB) protocols are the most widely used methods for assessing the performance of quantum gates.However, the existing RB methods either do not scale to many qubits or cannot benchmark a universal gate set.Here, we introduce and demonstrate a technique for scalable RB of many universal and continuously parametrized gate sets, using a class of circuits called randomized mirror circuits.Our technique can be applied to a gate set containing an entangling Clifford gate and the set of arbitrary single-qubit gates, as well as gate sets containing controlled rotations about the Pauli axes.We use our technique to benchmark universal gate sets on four qubits of the Advanced Quantum Testbed, including a gate set containing a controlled-S gate and its inverse, and we investigate how the observed error rate is impacted by the inclusion of non-Clifford gates.Finally, we demonstrate that our technique scales to many qubits with experiments on a 27-qubit IBM Q processor.We use our technique to quantify the impact of crosstalk on this 27-qubit device, and we find that it contributes approximately 2=3 of the total error per gate in random many-qubit circuit layers.

DOI
10.1103/physrevx.13.041030

Related papers

Scalable Randomized Benchmarking of Quantum Computers Using Mirror Circuits

Timothy J Proctor, Stefan Seritan, Kenneth Rudinger +3 more

The performance of quantum gates is often assessed using some form of randomized benchmarking. However, the existing methods become infeasible for more than approximately five qubits. Here we show how to use a simple and customizable class of circuits-randomized mirror circuits-to perform scalable, robust, and flexible randomized benchmarking of Clifford gates. We show that this technique approximately estimates the infidelity of an average many-qubit logic layer, and we use simulations of up to 225 qubits with physically realistic error rates in the range 0.1%-1% to demonstrate its scalability. We then use up to 16 physical qubits of a cloud quantum computing platform to demonstrate that our technique can reveal and quantify crosstalk errors in many-qubit circuits.

arXiv:2112.09853•Physical Review Letters•Oct 6, 2022•97 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

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

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

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

Coherent randomized benchmarking

Jorge Miguel-Ramiro, Alexander Pirker, Wolfgang Dür

Randomized benchmarking is a powerful technique to efficiently estimate the performance and reliability of quantum gates, circuits, and devices. Here, we propose to perform randomized benchmarking in a coherent way, where superpositions of different random sequences rather than independent samples are used. We show that this leads to a uniform and simple protocol having significant advantages with respect to gates that can be benchmarked, and in terms of efficiency and scalability. We show that, e.g., universal gate sets, the set of $n$-qudit Pauli operators or more general sets including arbitrary unitaries, as well as a particular $n$-qudit Clifford gate using only the Pauli set, can be efficiently benchmarked. The price to pay is an additional complexity to add control to the involved quantum operations. However, we demonstrate that this can be done by using auxiliary degrees of freedom that are naturally available in basically any physical realization, and are independent of the gates to be tested.

arXiv:2010.13810•Physical Review Research•Jul 9, 2021•4 citations
Randomized benchmarking (RB) protocols are the most widely used methods for assessing the performance of quantum gates.However, the existing RB methods either do not scale to many qubits or cannot benchmark a universal gate set.Here, we introduce and demonstrate a technique for scalable RB of many universal and continuously parametrized gate sets, using a class of circuits called randomized mirror circuits.Our technique can be applied to a gate set containing an entangling Clifford gate and the set of arbitrary single-qubit gates, as well as gate sets containing controlled rotations about the Pauli axes.We use our technique to benchmark universal gate sets on four qubits of the Advanced Quantum Testbed, including a gate set containing a controlled-S gate and its inverse, and we investigate how the observed error rate is impacted by the inclusion of non-Clifford gates.Finally, we demonstrate that our technique scales to many qubits with experiments on a 27-qubit IBM Q processor.We use our technique to quantify the impact of crosstalk on this 27-qubit device, and we find that it contributes approximately 2=3 of the total error per gate in random many-qubit circuit layers.
The performance of quantum gates is often assessed using some form of randomized benchmarking. However, the existing methods become infeasible for more than approximately five qubits. Here we show how to use a simple and customizable class of circuits-randomized mirror circuits-to perform scalable, robust, and flexible randomized benchmarking of Clifford gates. We show that this technique approximately estimates the infidelity of an average many-qubit logic layer, and we use simulations of up to 225 qubits with physically realistic error rates in the range 0.1%-1% to demonstrate its scalability. We then use up to 16 physical qubits of a cloud quantum computing platform to demonstrate that our technique can reveal and quantify crosstalk errors in many-qubit circuits.
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.
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.
Randomized benchmarking is a powerful technique to efficiently estimate the performance and reliability of quantum gates, circuits, and devices. Here, we propose to perform randomized benchmarking in a coherent way, where superpositions of different random sequences rather than independent samples are used. We show that this leads to a uniform and simple protocol having significant advantages with respect to gates that can be benchmarked, and in terms of efficiency and scalability. We show that, e.g., universal gate sets, the set of nnn-qudit Pauli operators or more general sets including arbitrary unitaries, as well as a particular nnn-qudit Clifford gate using only the Pauli set, can be efficiently benchmarked. The price to pay is an additional complexity to add control to the involved quantum operations. However, we demonstrate that this can be done by using auxiliary degrees of freedom that are naturally available in basically any physical realization, and are independent of the gates to be tested.