^{1}

^{*}

^{1}

^{1}

^{1}

In this paper, we report the observation and characterisation of a systematic error in the implementation of
*U*
_{3} gates in the IBM quantum computers. By measuring the effect of this gate for various rotation angles the error appears as an over-rotation, whose magnitude does not correlate with IBM’s cited errors calculated using Clifford randomized benchmarking. We propose a simple mitigation procedure to limit the effects of this error. We show that using a simple mitigation strategy one can obtain improved results in the observed value for the CHSH inequality, measured in a cloud-based quantum computer. This work highlights the utility of simple mitigation strategies for short-depth quantum circuits.

The field of quantum computing has the potential to transform a wide variety of scientific fields including material science and quantum chemistry. Hardware noise in the computation presents a big problem for quantum computing as noise in general destroys coherence and entanglement in the quantum state, which is essential for a successful quantum algorithm. In order to address this problem, quantum error correction uses extra qubits to detect and correct errors introduced by the effects of noise. Error correction is essential in the development of fully functional quantum computers. However, existing hardware does not meet the requirements to implement fault-tolerant quantum error correction, outside of small preliminary studies [

Error mitigation aims to reduce the effect of noise rather than remove it completely. There are many distinct approaches towards this goal, with two common methods being: optimizing quantum circuits through compilation and machine learning [

Errors occur due to a multitude of factors in both the qubits themselves and the control hardware. Qubits are not completely isolated from their environment, leading to thermal relaxation and the decoherence of their state. Gate errors result from miscalibration or imperfections in the control hardware and their interactions with the qubits. Furthermore, the readout procedure can misidentify or alter the final qubit state such that the measured value does not accurately reflect the collapsed state [

Here we present a remarkably simple technique to mitigate the effect of over-rotations in short-depth quantum circuits. The method is based on first running diagnostic circuits which quantify the error. Then, using the quantified error the experimenter can run a modified circuit of interest to mitigate the effect of the over-rotation. We show that simple approaches, such as that presented, here can still offer an experimental advantage when implemented in real quantum hardware.

First, we introduce the mathematical description of several basic single qubit. Then we show how over-rotations can be characterised and their effects mitigated. This is followed by a simple experimental demonstration of our method where we measure the CHSH inequalities in real quantum hardware using the IBM cloud quantum computing service. Finally, we present a discussion of our method and the results obtained as well as future directions.

A single qubit pure state can be represented as:

| ψ 〉 = cos ( θ 2 ) | 0 〉 + e i ϕ sin ( θ 2 ) | 1 〉 . (1)

which can be visualized as a point on the Bloch sphere at polar angle θ and azimuthal angle ϕ .

During computation, a given number of one and two qubit gates are performed on a set of qubits. In the zero-noise limit this has the effect of changing the state by some unitary operation U. Any unitary is decomposed into the physical gate set of the device, S . When implemented in the IBMQ quantum computer this set is given by S = { U 1 ( ω ) , R x ( ± π / 2 ) , C X } , where ω is any angle. The gate U 1 ( ω ) is equivalent to R z ( ω ) up to a global phase factor and is implemented virtually within IBMQ. This is achieved by using frame changes with near-perfect execution [

U 3 ( θ , ϕ , λ ) = ( cos ( θ / 2 ) − e i λ sin ( θ / 2 ) e i ϕ sin ( θ / 2 ) e i ( λ + ϕ ) cos ( θ / 2 ) ) , (2)

can be decomposed as follows:

U 3 ( θ , ϕ , λ ) = R z ( ϕ ) R x ( − π 2 ) R z ( θ ) R x ( π 2 ) R z ( λ ) , (3)

where the R z gates are implemented virtually (VZ), and the R x ( ± π / 2 ) by a pulse [

Once execution of the required gates is complete, the quantum computer measures the qubits, collapsing the state, and outputs the results. The computation is repeated and a vector of counts v → e x p , length 2^{n} (where n is the number of qubits), is obtained. Relaxation, imperfect coupling of the readout resonator and signal amplification lead to errors in the measurement process [

M c a l = ( p 0 1 − p 1 1 − p 0 p 1 ) , (4)

where p 0 and p 1 are the probabilities that a prepared | 0 〉 is measured as | 0 〉 and a prepared state | 1 〉 is measured as | 1 〉 respectively. This technique can be extended to multi-qubit states using a tensor product or correlated Markov noise approaches [

The calibration matrix can then be used to mitigate errors associated with the readout either directly by: 1) inversion or through 2) bounded minimization.

1) Inversion is done by inverting the calibration matrix as such: M c a l − 1 v → e x p = v → t h , where v → e x p , v → t h are the experimental and ideal vectors of the counts.

2) Bounded minimization uses bounded least squares optimization: min v → t h | M c a l v → t h − v → e x p | , where bounds ensure the probabilities calculated from v → t h are positive and correctly normalised.

These techniques share the assumption that the error rate in state preparation is much lower than the readout error. This is not without merit as single gate errors cited in IBM, Google and Rigetti are all below 0.5% while their readout errors are around 1% - 5% [

In this paper we highlight a systematic error in the execution of the U_{3} gate in IBM’s cloud-based computers, which appears as a shift in the angle θ when implementing the gate U 3 ( θ , ϕ , λ ) . We propose to mitigate the previous error using an angular shift in θ in the U_{3} gate. We illustrate the functionality of this mitigation method by measuring the CHSH inequality on data from a real device.

1) Sweeping a Meridian

To explore the reliability of the U_{3} gate we applied it to the 0 state with λ = π / 2 , ϕ = − π / 2 and various angles θ in the interval [ 0, π ] (see Equation (2)).

This represents a rotation about the X axis ( R x ( θ ) ) on the Bloch sphere that sweeps a whole meridian. The gate is followed by a measurement in the Z basis

IBM’s calibration method consists in measuring the states 0 and | 1 〉 = R x ( π ) | 0 〉 , extracting the values of p 0 and p 1 to build the matrix M c a l given in (4). The experimental 0 count for any given θ ( P 0 ( θ ) ), ignoring all errors apart from readout, can be described by

P 0 ( θ ) = p 0 cos 2 θ 2 + ( 1 − p 1 ) sin 2 θ 2 . (5)

We shall refer to this formula as the IBM-fit. Observe that (5) reproduces by construction the experimental data p 0 and 1 − p 1 for θ = 0 and π respectively. To test the reliability of this formula we divide [ 0, π ] in 30 intervals and measure P 0 ( θ i ) for θ i = π i / 30 with i = 0 , 1 , ⋯ , 30 . The results obtained for the qubit 9 of the Cambridge QC, with 8192 shots per angle, are plotted in

P 0 ( θ ) = p ′ 0 cos 2 θ + α 2 + ( 1 − p ′ 1 ) sin 2 θ + α 2 . (6)

Here, the angle θ is shifted by a parameter α that takes small values, as we shall see below. The probabilities p 0 and p 1 , appearing in (5), have been replaced by p ′ 0 and p ′ 1 to allow for a more accurate description of the experimental results in the range θ ∈ [ 0, π ] . The numerical values of α , p ′ 0 and p ′ 1 are determined using a least-square fit of the set { P 0 ( θ i ) } i = 0 30 using Equation (6). We shall denote this approach as the Shift-fit method.

To quantify the performance of the fits we use the coefficient of determination R^{2} that is defined as

R fit 2 = 1 − ∑ n = 0 30 ( P 0 exp ( θ n ) − P 0 fit ( θ n ) ) 2 ∑ n = 0 30 ( P 0 exp ( θ n ) − P ¯ 0 exp ) 2 (7)

where P 0 exp ( θ n ) is the experimental probability of the | 0 〉 counts at angle θ n , and P ¯ 0 exp its average. The R^{2} estimator is customarily expressed in percentages, thus a perfect fit, implies a R fit 2 × 100 = 100 % of predictibilty. The data given in ^{2} equal to 97.6% for the IBM-fit and 99.9% for the Shift-fit.

2) Several Sweeps: Jobs

The results presented in

To assess the reliability of the Shift-fit method we consider a set of n s consecutive sweeps that we denote a job. The number of sweeps n s can depend on the job (see

The result of each job is a set of parameters { α s , p ′ 0 , s , p ′ 1 , s } s = 1 n s , which according to the previous assumption, should be similar.

Item 1) is in rough agreement with the stability assumption made above, while item 2) can be attributed to different calibrations during the time delay between different jobs.

The distribution has a mean α of −0.14 (7), where the number in brackets is the standard deviation on the last digit shown. This mean does not properly reflect how α behaves within a single job, as for example the single run in

We also find that overall the average R^{2} for the Shift-fit and IBM fit are 99.9% and 97.0% respectively leading to the conclusion that including an α shift results in a more accurate description of the raw data in general. Finally it is worth noting that we have not found correlation between the shift observed and IBM quoted errors.

In

We have also explored other meridians with our the Shift-fit method and found a negligible dependence on the meridian. Through testing the same qubits in the same job in all the computers with ten equally spaced ϕ from 0 to 2 π we saw a no shifts greater than the standard deviation from the mean and there was no trend of increase with a change in ϕ .

3) Mitigation

As explained above, the parameter α represents a systematic error that affects the rotation angle θ of the U 3 ( θ , ϕ , λ ) gate. A naive way to mitigate it is to replace θ by θ − α , hoping that this displacement will compensate the error. The corresponding mitigated circuit is

Computer | Qubit | α | p ′ 0 | p ′ 1 |
---|---|---|---|---|

Roch | 3 | 0.32 (6) | 0.83 (4) | 0.80 (2) |

2*Johan | 1 | −0.26 (7) | 0.97 (1) | 0.95 (2) |

8 | 0.12 (5) | 0.98 (2) | 0.96 (2) | |

Camb | 9 | −0.14 (7) | 0.82 (2) | 0.81 (2) |

Lond | 2 | −0.12 (5) | 0.99 (1) | 0.91 (3) |

Paris | 5 | −0.08 (1) | 0.90 (1) | 0.89 (2) |

To implement the α mitigation a python software suite was written to perform these calibrations and implement the shift on subsequent experiments [

^{2} values for the Shift-fit were above 99% in all cases. These results assess the effect of the mitigation method.

4) Repeated Gates and Different Initial States

We now explore the dependence of the α shift with the number of gates applied in a consecutive sequence. To this end we decompose a rotation R x ( θ ) into M rotations of angle θ / M , as shown in the circuit of

We have also studied sweeps starting, not from | 0 〉 , but from the states obtained acting on | 0 〉 with R x ( π / 4 ) , R x ( π / 2 ) and R x ( 3 π / 4 ) . The results plotted in

In this section we propose an explanation of the shift-fit effect based on a potential error in the implementation of the gates R x ( ± π / 2 ) . In the ideal case these gates are realized as e ∓ i t Ω / 2 σ X , where Ω is the pulse amplitude and Ω t = π / 2 . An off resonance error (ORR) in the R x gate pulse can be modeled as follows [

R x ( ± π / 2 , δ ) = exp [ i π 4 ( ∓ σ X + δ σ Z ) ] = ( cos π d 4 − i δ d sin π d 4 ∓ i d sin π d 4 ∓ i d sin π d 4 cos π d 4 + i δ d sin π d 4 ) (8)

where d = 1 + δ 2 . Replacing these gates into (3) we obtain a gate U 3 ( θ , − π 2 , π 2 , δ ) that includes the ORR error. Finally, we apply the calibration matrix M c a l , to obtain the probability of measuring the | 0 〉 state for various angles θ

P 0 ORR ( θ , δ ) = 1 + p 0 − p 1 2 + p 0 + p 1 − 1 2 [ ( 1 − 2 δ 2 ) cos θ − 2 δ sin θ ] + O ( δ 3 ) , (9)

where we have assumed that δ is a small parameter. Starting from Equation (6) and expanding in powers of α gives

P 0 shift ( θ , δ ) = 1 + p 0 − p 1 2 + p 0 + p 1 − 1 2 [ ( 1 − α 2 2 ) cos θ − α sin θ ] + O ( α 3 ) . (10)

These two expressions are equivalent up to O ( δ 3 ) assuming α = 2 δ and the using the same calibration matrix. This means that the VZ gates can indeed be used to correct for this by replacing the θ parameter in Equation (3) with θ − α , which is equivalent to altering the θ in the U_{3} gate.

It appears that the shift observed is well described by the appearance of ORR errors in the R x gates. However, upon multiple action of these gates, one would expect the errors to accumulate, resulting in a shift that grows proportionally with the number of applied gates. As previously demonstrated, this is not observed (see

We shall show that despite the previous complications, the α mitigation improves observed CHSH inequalities, suggesting the simple mitigation strategy we present could be useful in short-depth circuits.

The CHSH inequality involves running 4 separate circuits which each consist of a Bell state preparation followed by measurements in four appropriately chosen bases (

Computer | Qubits | α 0 | α 1 | C r a w | C c o r r |
---|---|---|---|---|---|

Johan | 6, 7 | 0.052 (7) | −0.072 (7) | 2.52 (2) | 2.62 (2) |

Lond | 1, 3 | −0.02 (1) | −0.04 (1) | 2.21 (2) | 2.26 (2) |

Lond | 1, 2 | 0.23 (1) | 0.12 (7) | 2.24 (2) | 2.46 (2) |

Roch | 3, 4 | −0.07 (1) | −0.012 (7) | 2.22 (4) | 2.26 (5) |

Roch | 44, 51 | 0.032 (5) | −0.026 (4) | 1.5 (1) | 1.82 (8) |

Roch | 48, 52 | 0.006 (3) | −0.05 (1) | 1.23 (3) | 1.25 (3) |

Paris | 8, 9 | 0.007 (7) | 0.012 (2) | 2.51 (2) | 2.51 (2) |

Camb | 9, 10 | −0.02 (1) | 0.011 (5) | 2.06 (1) | 2.085 (9) |

C = 〈 A B 〉 + 〈 A B ′ 〉 + 〈 A ′ B 〉 − 〈 A ′ B ′ 〉 (11)

where 4 system observables are shown as A , A ′ and B , B ′ , these letters simply represent different measurement bases of the bipartite system comprising of A and B. 〈 A B 〉 is the correlated expectation for two of those observables. For a system with a hidden variable or classical correlations, | C | is bounded at 2. For a system with maximal entanglement, this bound is 2 2 [

In general the measured mitigated correlations are closer to the theoretical limit as in

How this improvement scales with depth and number of qubits in the circuit is an important consideration. We have shown the shift effect does not appear to be consistent with increasing depth as seen in 6. However, when increasing the system size a set of calibration circuits could be run on each qubit to determine the α shift whose effect could then be mitigated as outlined above.

In this paper, we have highlighted the existence of a systematic error, which appears as an angular shift ( α ) in the parameter θ of the U_{3} gate, and demonstrated its effects can be mitigated by performing a simple calibration before running a set of jobs. This shift was shown to bare characteristics of an ORR error. Therefore, it is now possible to mitigate this component of the total error irrespective of the readout error and other errors. This leads to an increased performance on our benchmark circuits to calculate the CHSH inequality. We found that the systematic shifts are consistent over the time span of a few successive jobs, but not over larger stretches of time.

As the ORR error can be corrected through the use of VZ gates, the change in the θ parameter of the U_{3} gate does just this [

We have also shown that although these errors can be corrected for single gates, the application of multiple gates to a single qubit does not follow the expected relation from the ORR treatment which implies a linear growth in the shift with multiple gates. This remains an open question on whether the gates are state-dependent or if other errors come into play once the qubit is not in the ground state and further investigation is left to future work. Despite this, applying this correction still yielded improved results in the CHSH inequalities.

Any simple mitigation strategy can only improve the fidelity of calculations by a small factor. Yet, a modest increase in fidelity for a small upfront computation may be worth the extra time. Although this method could not be applied to deep circuits we envision it could be useful for many qubit, short-depth quantum circuits, especially if combined with other mitigation techniques.

We would like to thank Diego Garca-Martn and Pol Forn for conversations. We also thank the IBM Quantum team for making multiple devices available via the IBM Quantum Experience. The access to the IBM Quantum Experience has been provided by the CSIC IBM Q Hub. We acknowledge support from La Caixa Foundation (DB, MHG), European Union’s Horizon 2020 research and innovation programme under the Marie Skodowska-Curie grant agreement No. 71367 (DB). MHG is supported by “la Caixa” Foundation (ID: 100010434), Grant No. LCF/BQ/DI19/11730056. This work has also been financed by the Spanish grants PGC2018-095862-B-C21, QUITEMAD + S2013/ICE-2801, SEV-2016-0597 of the “Centro de Excelencia Severo Ochoa” Programme and the CSIC Research Platform on Quantum Technologies PTI-001.

The authors declare no conflicts of interest regarding the publication of this paper.

Bultrini, D., Gordon, M.H., López, E. and Sierra, G. (2021) Simple Mitigation Strategy for a Systematic Gate Error in IBMQ. Journal of Applied Mathematics and Physics, 9, 1215-1229. https://doi.org/10.4236/jamp.2021.96083

1) Coefficient of determination, R^{2}

The coefficient of determination, R^{2}, is defined as

R 2 = 1 − S S res S S tot (12)

where the total sum of squares S S tot and total sum of residuals S S res are

S S tot = ∑ i ( y i − y ¯ ) 2 (13)

S S res = ∑ i ( y i − f i ) 2 , (14)

with y i being a particular data point, f i being the prediction of y i and y ¯ the average of the observed data. If R 2 = 1 , the fit is an exact match to the experimental data while anything lower implies a progressively worse fit.

In total the statistics of the goodness of fit of our proposed shift with respect to IBM and the ideal curve (setting p 0 = p 1 = 1 and α = 0 ) are tabulated below for an aggregate of all of the sweeps over all computers.

Furthermore the way that we ascertained that there was no correlation between the alpha values and the cited IBM error rate is that we ordered the size of the errors for a given computer’s qubits by magnitude and compared it to the magnitude of α associated with a given error rate’s job and there was no polynomial (up to order 4) which gave any appreciable R^{2} value for any computer.

2) Largest observed shift values

The TableS1 below shows the fitted data for 20 qubits with the largest average α after 100 sweeps, with exception of Rochester at 10 sweeps due to the large number of qubits. This process was carried out on the Cambridge, London, Rochester, Paris and Johannesburg computers.

Computer | Qubit | α | p 0 | p 1 |
---|---|---|---|---|

Roch | 3 | 0.32 (6) | 0.83 (4) | 0.80 (3) |

Roch | 51 | −0.29 (3) | 0.80 (1) | 0.72 (4) |

Johan | 1 | −0.26 (7) | 0.97 (1) | 0.95 (2) |

Roch | 52 | −0.19 (2) | 0.88 (1) | 0.81 (4) |

Roch | 30 | 0.16 (2) | 0.85 (2) | 0.87 (3) |
---|---|---|---|---|

Camb | 9 | −0.14 (7) | 0.82 (2) | 0.81 (2) |

Roch | 35 | −0.13 (2) | 0.85 (1) | 0.85 (3) |

Roch | 8 | 0.13 (2) | 0.91 (1) | 0.89 (3) |

Roch | 12 | 0.13 (1) | 0.89 (1) | 0.89 (3) |

Roch | 13 | 0.12 (6) | 0.66 (2) | 0.65 (5) |

Lond | 2 | −0.12 (5) | 0.99 (1) | 0.91 (3) |

Roch | 2 | −0.11 (2) | 0.88 (1) | 0.86 (3) |

Johan | 8 | 0.11 (1) | 0.98 (1) | 0.96 (2) |

Johan | 10 | 0.11 (1) | 0.96 (1) | 0.94 (2) |

Johan | 9 | −0.10 (1) | 0.96 (1) | 0.94 (2) |

Roch | 41 | 0.10 (1) | 0.97 (1) | 0.93 (2) |

Johan | 3 | −0.10 (1) | 0.96 (1) | 0.96 (2) |

Roch | 23 | 0.10 (2) | 0.87 (2) | 0.84 (3) |

Johan | 0 | 0.09 (1) | 0.94 (1) | 0.92 (2) |

Roch | 27 | −0.09 (2) | 0.89 (1) | 0.92 (3) |

Johan | 7 | −0.09 (1) | 0.98 (1) | 0.96 (2) |