Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSampling Strategy Optimization for Randomized Benchmarking
118
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Randomized benchmarking (RB) is a widely used method for estimating the average fidelity of gates implemented on a quantum computing device. The stochastic error of the average gate fidelity estimated by RB depends on the sampling strategy (i.e., how to sample sequences to be run in the protocol). The sampling strategy is determined by a set of configurable parameters (an RB configuration) that includes Clifford lengths (a list of the number of independent Clifford gates in a sequence) and the number of sequences for each Clifford length. The RB configuration is often chosen heuristically and there has been little research on its best configuration. Therefore, we propose a method for fully optimizing an RB configuration so that the confidence interval of the estimated fidelity is minimized while not increasing the total execution time of sequences. By experiments on real devices, we demonstrate the efficacy of the optimization method against heuristic selection in reducing the variance of the estimated fidelity.
rate research
Read More
To improve the performance of multi-qubit algorithms on quantum devices it is critical to have methods for characterizing non-local quantum errors such as crosstalk. To address this issue, we propose and test an extension to the analysis of simultaneous randomized benchmarking data -- correlated randomized benchmarking. We fit the decay of correlated polarizations to a composition of fixed-weight depolarizing maps to characterize the locality and weight of crosstalk errors. From these errors we introduce a crosstalk metric which indicates the distance to the closest map with only local errors. We demonstrate this technique experimentally with a four-qubit superconducting device and utilize correlated RB to validate crosstalk reduction when we implement an echo sequence.
Any technology requires precise benchmarking of its components, and the quantum technologies are no exception. Randomized benchmarking allows for the relatively resource economical estimation of the average gate fidelity of quantum gates from the Clifford group, assuming identical noise levels for all gates, making use of suitable sequences of randomly chosen Clifford gates. In this work, we report significant progress on randomized benchmarking, by showing that it can be done for individual quantum gates outside the Clifford group, even for varying noise levels per quantum gate. This is possible at little overhead of quantum resources, but at the expense of a significant classical computational cost. At the heart of our analysis is a representation-theoretic framework that we develop here which is brought into contact with classical estimation techniques based on bootstrapping and matrix pencils. We demonstrate the functioning of the scheme at hand of benchmarking tensor powers of T-gates. Apart from its practical relevance, we expect this insight to be relevant as it highlights the role of assumptions made on unknown noise processes when characterizing quantum gates at high precision.
Randomized benchmarking (RB) protocols are standard tools for characterizing quantum devices. Prior analyses of RB protocols have not provided a complete method for analyzing realistic data, resulting in a variety of ad-hoc methods. The main confounding factor in rigorously analyzing data from RB protocols is an unknown and noise-dependent distribution of survival probabilities over random sequences. We propose a hierarchical Bayesian method where these survival distributions are modeled as nonparametric Dirichlet process mixtures. Our method infers parameters of interest without additional assumptions about the underlying physical noise process. We show with numerical examples that our method works robustly for both standard and highly pathological error models. Our method also works reliably at low noise levels and with little data because we avoid the asymptotic assumptions of commonly used methods such as least-squares fitting. For example, our method produces a narrow and consistent posterior for the average gate fidelity from ten random sequences per sequence length in the standard RB protocol.
The term randomized benchmarking refers to a collection of protocols that in the past decade have become the gold standard for characterizing quantum gates. These protocols aim at efficiently estimating the quality of a set of quantum gates in a way that is resistant to state preparation and measurement errors, and over the years ma
As quantum circuits increase in size, it is critical to establish scalable multiqubit fidelity metrics. Here we investigate three-qubit randomized benchmarking (RB) with fixed-frequency transmon qubits coupled to a common bus with pairwise microwave-activated interactions (cross-resonance). We measure, for the first time, a three-qubit error per Clifford of 0.106 for all-to-all gate connectivity and 0.207 for linear gate connectivity. Furthermore, by introducing mixed dimensionality simultaneous RB --- simultaneous one- and two-qubit RB --- we show that the three-qubit errors can be predicted from the one- and two-qubit errors. However, by introducing certain coherent errors to the gates we can increase the three-qubit error to 0.302, an increase that is not predicted by a proportionate increase in the one- and two-qubit errors from simultaneous RB. This demonstrates three-qubit RB as a unique multiqubit metric.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
