# Interleaved Randomised Benchmarking

Interleaved Randomized benchmarking is a scalable experimental protocol for estimating the average error of individual quantum computational gates. This protocol consists of interleaving random Clifford gates between the gate of interest and provides an estimate as well as theoretical bounds for the average error of the gate under test, so long as the average noise variation over all Clifford gates is small. This technique takes into account both state preparation and measurement errors and is scalable in the number of qubits.

**Tags:** Certification Protocol, Randomised Benchmarking, Clifford group

## Contents

## Assumptions[edit]

- The measurements performed are trusted.
- Noise model can be assumed to be gate and time-dependent or gate and time-independent.
- The noise model is independent and identically distributed (IID).

## Outline[edit]

Standard Randomised Benchmarking method involves applying many random sequences of gates of varying lengths to a standard initial state. Each sequence ends with a randomized measurement that determines whether the correct final state was obtained. The average computationally relevant error per gate is obtained from the increase in error probability of the final measurements as a function of sequence length. The random gates are taken from the Clifford group. The restriction to the Clifford group ensures that the measurements can be of one-qubit Pauli operators that yield at least one deterministic one-bit answer in the absence of errors.

The multi-qubit RB protocol described in Standard Randomised Benchmarking is restricted to benchmark only the full Clifford group on qubits. While this provides a significant step towards scalable benchmarking of a quantum information processor, it is desirable in many cases to benchmark individual gates in Clifford group rather than the entire set. Interleaving randomised benchmarking is a protocol which consists of interleaving random gates between the gate of interest, which is used to estimate the average error of individual quantum computational gates.

To benchmark a specific Clifford element (an individual gate), the following steps are involved:

**Step 1**: Implement Standard Randomised Benchmarking to get a model for the fidelity and to calculate the average error rate

- A fixed sequence length is selected at random. A random sequence of this length is chosen from the Clifford group.
- The operations are applied to the initial state corresponding to the selected sequence and then a final operator is applied which inverts all the previous operations.
- The final state is then measured to check if it matches the initial state. This process is performed several times with the same sequence to estimate the survival probability (the probability that the final state which returns to its initial state).
- Other random sequences of the same fixed sequence length are picked and the above-mentioned process is repeated to calculate the corresponding survival probability. This is then used to calculate the average survival probability for the sequence length.
- The same procedure is repeated for multiple different randomly selected sequence lengths.
- The observed survival probabilities are then plotted against the sequence length and then this is fit to an exponential decay curve, which is used to estimate the depolarizing parameter and sequence fidelity and also to calculate the average error rate which is the metric for randomized benchmarking.

**Step 2**: Procedure to estimate the new sequence fidelity by including the Clifford element to be benchmarked in the sequence

- Now, for a random fixed sequence length, choose a sequence where the first Clifford element is selected uniformly at random from the Clifford group and the second element is always chosen to be the specific Clifford element we want to benchmark.
- Final gate is chosen to be the inverse of the composition mentioned in the step above. The final state is then measured to check if it matches the initial state. This process is performed several times with the same sequence to estimate the survival probability (the probability that the final state which returns to its initial state).
- Other random sequences of the same fixed sequence length are picked and the above-mentioned process is repeated to calculate the corresponding survival probability. This is then used to calculate the average survival probability for the sequence length.
- The same procedure is repeated for multiple different randomly selected sequence lengths.
- The observed survival probabilities are then plotted against the sequence length, to obtain a zeroth or first-order model of the new sequence fidelity, from which the new depolarizing parameter is estimated.

**Step 3**: Estimate the gate error of the selected Clifford element to be benchmarked

- From the values obtained for the depolarizing parameter and the new depolarizing parameter, using the average gate fidelity, a point estimate is obtained for the gate error. The gate error would lie in a certain range of this estimate. One interpretation of this error is that it arises from imperfect random gates.

## Hardware Requirements[edit]

- Quantum computational resources to perform Clifford gates.
- Trusted Measurement device.

## Notation[edit]

- : Depolarizing parameter
- : New depolarizing parameter for the specific Clifford element to be benchmarked
- : Dimension of Hilbert space
- : Average fidelity,
- : Average error rate,
- : Selected sequence length
- : Total randomly selected sequence of sequence length
- Clif: Clifford group
- C: Selected Clifford element to be benchmarked
- C: Random element of Clifford group
- = : Random sequence of operations of length
- : Superoperator representing the sequence with alternating
- : Number of different data points to get the error model
- : Implementation of C at time j (1 j M) results in this error map. are the different time-dependent noise operators affecting C.
- : Associated noise operator of the Clifford element
- : The gate error of
- : Error range of
- : initial state
- : POVM element which takes into account the measurement error.
- : Survival probability of a sequence. is a quantum state that takes into account errors in preparing
- : Averaged sequence fidelity for gate and time independent error model
- : Averaged sequence fidelity for gate and time dependent error model. In this model, the parameter is a measure of the degree of gate-dependence in the error.
- : New zeroth order averaged sequence fidelity for
- : New first order Averaged sequence fidelity for
- : Coefficients that absorb the state preparation and measurement errors as well as the error on the final gate for gate and time independent error model
- : Coefficients that absorb the state preparation and measurement errors as well as the error on the final gate for gate and time dependent error model.
- :

## Properties[edit]

**Figure of merit**: average gate error- This protocol is used to estimate the average error of individual quantum computational gate
- In the limits of either perfect random gates or that the average error of all gates is depolarizing, this protocol estimates the gate error perfectly
- In the completely general case where the random gates have arbitrary errors with small average variation, this protocol provides explicit bounds for the error of the gate. These bounds give direct information regarding the quality of computational gates and thus useful information about reaching thresholds for fault-tolerant quantum computation.
- This is a scalable protocol with the time complexity
- The errors which are considered here are State preparation and measurement errors, error on the final gate, which are gate and time-independent errors. Gate and time-dependent errors can also be taken into consideration. This method is insensitive to SPAM error.
- The random gates used to benchmark the specific Clifford gate are picked from the Clifford group.
- For noise estimation, the uniform probability distribution over Clifford group comprises a unitary 2-design.

## Procedure Description[edit]

**Step 1**: Standard Randomised Benchmarking

**Output**: Figure of merit:

- For :
- Pick random sequence length
- For sequences:
- For :
- If , apply inverse operator of previous operations
- else, apply random operation C

- Thus, and is uniquely determined by
- Measure survival probability

- For :
- Estimate average survival probability over all sequences, where

- Fit the results for the averaged sequence fidelity for all into the models:
- For gate and time independent error model:
- For gate and time dependent error model:

- For gate and time independent error model:
- is extracted from the model and is estimated,

**Step 2**: Estimate gate error of selected Clifford element C

**Input**: C

**Output**: gate error of :

- For :
- Pick random sequence length
- For sequences:
- For :
- If , apply inverse operator of previous operations
- else If , apply random operation C
- else, apply C

- Thus C
- Measure the survival probability

- For :
- Estimate average survival probability over all sequences, where

- Fit the results for the averaged sequence fidelity for all into the models, to find :
- For gate and time independent error model:
- For gate and time dependent error model:

- For gate and time independent error model:
- Estimate
- lies in the range , where

## Further Information[edit]

- Fitting models are described and derived as seen in E. Mageson et al. The coefficients derived are:
- = Tr
- = Tr
- = Tr + Tr
- = Tr
- = Tr

- The case where Randomized benchmarking fails: Suppose the noise is time dependent and for each . Then for every even though there is a substantial error on each and so benchmarking fails.
- Wallman, Granade, Harper, F., NJP 2015 Purity benchmarking: A unitarity can be estimated via purity benchmarking, which is an RB-like experiment that estimates a decay rate.

## Related Papers[edit]

- E.Knill et al (2007) arXiv:0707.0963: gate and time-independent noise model
- E. Mageson et al (2011) arXiv:1009.3639: multi-parameter model
- Magesan et al. PRL (2012): Interleaved Randomized Benchmarking

**contributed by Rhea Parekh*