PaperlayerView exact revision on arXiv

Source-linked AI summary

Error mitigation for short-depth quantum circuits

Kristan Temme, Sergey Bravyi, Jay M. Gambetta

arXiv:1612.02058v3quant-phcond-mat.other

TL;DR

The paper addresses estimating observables after noisy quantum evolution and presents two error-mitigation approaches: zero-noise Richardson extrapolation and quasi-probabilistic representation of ideal circuits by noisy ones. In numerical simulations, cancellation reduced the median precision error from approximately 0.15 to 0.05 using the same resources.

Abstract

from arXiv · show

Two schemes are presented that mitigate the effect of errors and decoherence in short depth quantum circuits. The size of the circuits for which these techniques can be applied is limited by the rate at which the errors in the computation are introduced. Near-term applications of early quantum devices, such as quantum simulations, rely on accurate estimates of expectation values to become relevant. Decoherence and gate errors lead to wrong estimates of the expectation values of observables used to evaluate the noisy circuit. The two schemes we discuss are deliberately simple and don't require additional qubit resources, so to be as practically relevant in current experiments as possible. The first method, extrapolation to the zero noise limit, subsequently cancels powers of the noise perturbations by an application of Richardson's deferred approach to the limit. The second method cancels errors by resampling randomized circuits according to a quasi-probability distribution.

Reducing noise by Richardson extrapolation

Richardson extrapolation estimates the zero-noise expectation value by expanding noisy evolution in a noise parameter and accelerating convergence across rescaled noise rates. The analysis considers time-independent and more general noise models under stated initial-state and bath assumptions.

Reducing noise by Richardson extrapolation

  • Richardson extrapolation is used to improve convergence toward the zero-noise expectation value in short-depth quantum circuits.The method assumes a noise process constant in time and independent of rescaling the system Hamiltonian parameters.Source: Reducing noise by Richardson… · p. 5
  • The target observable is evaluated after noisy evolution from an initial state, with measurements represented as the noisy expectation plus sampling error.The measured statistic is ˆEK(λ) = EK(λ) + δ, and repeated experiments introduce the sampling error.Source: Reducing noise by Richardson… · pp. 5–6
  • The noise models include time-independent Lindblad dynamics and more general Hamiltonian system-bath interactions, including possibly non-Markovian noise.The latter setting uses an initial product state and an observable supported only on system degrees of freedom.Source: Reducing noise by Richardson… · pp. 5–6
  • The analysis assumes a system initial state that is separable from a bath steady state with respect to the bath Hamiltonian.The observable is restricted to the system through A = AS ⊗1.Source: Reducing noise by Richardson… · p. 6
  • Expectation-value estimation is performed by sampling the noisy evolved state, so finite measurement statistics contribute independently of the evolution noise.The supplied passages state that experiments are typically repeated M ≫1 times under an i.i.d. hypothesis.Source: Reducing noise by Richardson… · p. 6

I Series expansion in the noise parameter

The noisy expectation value admits a power-series expansion in the noise parameter, with the zeroth-order term equal to the noise-free evolution. Interaction-picture analysis and norm bounds control the remainder and coefficient growth.

I Series expansion in the noise parameter

  • The interaction-picture transformation yields a series expansion of the noisy expectation value in powers of λ.The expansion is recursively obtained from the interaction-picture evolution equation and then converted back to the Schrödinger picture.Source: I Series expansion in the noise… · p. 6
  • The λ0 contribution equals the noise-free expectation value E∗ sought by extrapolation.The coefficients and remainder are obtained by pairing the expansion terms with the observable trace.Source: I Series expansion in the noise… · pp. 6–7
  • The remainder is bounded using the Cauchy mean value theorem, Hölder’s inequality, and unitary invariance of Schatten norms.These bounds apply to the interaction-picture noise maps and the observable-state pairing.Source: I Series expansion in the noise… · p. 7
  • For local noise, the expansion coefficients typically scale as lk = O(N^k) and satisfy |ak| ≤ O((N T)^k).The scaling follows from an extensive local noise norm, ||L||1→1 = O(N).Source: I Series expansion in the noise… · p. 7
  • If only even powers of λ occur, Richardson extrapolation can achieve higher precision with fewer noise-rate values.The efficiency gain follows from the absence of some powers in the expansion.Source: I Series expansion in the noise… · p. 7

II Experimental rescaling of the noise parameter

Because experiments may not directly control λ, the protocol rescales the Hamiltonian evolution and runtime to produce effective evaluations at different noise rates. This enables Richardson extrapolation when the dissipator is constant and independent of Hamiltonian couplings.

II Experimental rescaling of the noise parameter

  • The protocol addresses the inability to directly control λ by rescaling the time-dependent Hamiltonian evolution.The rescaling redefines the coupling parameters and changes the runtime.Source: II Experimental rescaling of the noise… · pp. 7–8
  • The transformation Jα(t) → c^-1Jα(c^-1t) with runtime cT produces an effective noise-rate change from λ to cλ.The rescaled density matrix is related to the original evolution at the corresponding effective rate.Source: II Experimental rescaling of the noise… · pp. 7–8
  • This Hamiltonian rescaling allows the experimenter to evaluate EK(λ) at multiple values cλ for Richardson extrapolation.The construction applies to any constant dissipator L that does not depend on the Hamiltonian couplings Jα(t).Source: II Experimental rescaling of the noise… · p. 8
  • Alternative experimental methods may rescale λ directly, provided the modified noise rates λj are sufficiently accurate for extrapolation.Photon-loss experiments are given as an example where directly changing the loss rate may be preferable.Source: II Experimental rescaling of the noise… · p. 8

III Error bounds on the noise-free estimator

The estimator combines measurements from n+1 circuits run at rescaled noise rates, with coefficients chosen to cancel successive powers of λ. Its error bound separates extrapolation remainder from measurement error.

III Error bounds on the noise-free estimator

  • The protocol selects n+1 rescaling parameters c0 = 1 < c1 < . . . < cn and runs the corresponding rescaled evolutions.Each rescaled evolution has runtime Tj = cjT and effective noise rate cjλ.Source: III Error bounds on the noise-free… · p. 8
  • The coefficients γj are chosen so the weighted measurements cancel the first n powers in the noise expansion.The resulting estimator is constructed from the values ˆEK(cjλ).Source: III Error bounds on the noise-free… · p. 8
  • The estimator’s error is bounded by combining coefficient-weighted sampling errors with the truncated-series remainder.The bound uses the maximum measurement error δ∗ = maxj |δj| and the remainder bound at each rescaled rate.Source: III Error bounds on the noise-free… · p. 9
  • Bulirsch–Stoer and harmonic sequences provide alternative choices for the rescaling parameters cj.The supplied passage describes exponential and harmonic series used in Richardson extrapolation.Source: III Error bounds on the noise-free… · p. 9

Probabilistic error cancellation by resampling

Probabilistic error cancellation represents an ideal circuit as a quasi-probabilistic mixture of noisy circuits and estimates ideal expectation values by sampling those circuits. The construction requires suitable noisy-operation bases and can preserve qubit count, circuit length, and depth, but may require detailed tomography and has practical overhead limitations.

  • The scheme represents an ideal circuit as a quasi-probabilistic mixture of noisy circuits.The noisy circuits are sampled according to a probability distribution with efficiently computable signed coefficients.Source: Probabilistic error cancellation by… · pp. 9–10
  • Applying the method requires sufficiently accurate gate tomography and efficiently computable sampling coefficients.The noisy operations must be characterized with accuracy comparable to the desired accuracy of the ideal circuit.Source: Probabilistic error cancellation by… · pp. 9–10
  • A noisy-operation basis must be sufficiently large to express any ideal unitary gate as a linear combination of noisy operations.The operations are assumed to form a full basis of trace-preserving completely positive operations.Source: Probabilistic error cancellation by… · p. 9
  • Ideal expectation values are obtained by estimating expectation values from a suitable random ensemble of noisy circuits.The noisy and ideal circuits can use the same number of qubits and the same length.Source: Probabilistic error cancellation by… · p. 10
  • For general operation-dependent noise, constructing QPRs with optimal overhead remains an open problem, and one stated upper-bound coefficient lacks practical implications.A preliminary Clifford+T analysis gives γβ ≤ 1 + O(ϵ) when noisy operations are ϵ-close to ideal ones, but the constant is too large for practical use.Source: Probabilistic error cancellation by… · p. 10
  • The method can preserve circuit depth: noisy circuits corresponding to an ideal circuit of depth d have depth at most d.The construction may nevertheless require intermediate qubit initializations for some noise models, including amplitude damping.Source: Probabilistic error cancellation by… · p. 10

IV Minimal overhead decomposition of noise free circuit

The product-QPR construction decomposes each ideal gate into a minimal-overhead quasi-probability representation and combines these gate-wise representations across the circuit. Locality restricts the required noisy operations to those acting within each gate’s support, including at most two qubits.

  • For each ideal Clifford+T gate, a linear program over noisy operations finds a representation minimizing the sum of absolute coefficients.The candidate operations are those whose support is contained in the support of the ideal gate.Source: IV Minimal overhead decomposition of… · p. 11
  • The optimal solution satisfies µα = |ηα|, and the resulting γβ defines the gate’s QPR overhead.This equality follows because otherwise the linear-program objective could be decreased.Source: IV Minimal overhead decomposition of… · p. 11
  • A circuit-level product QPR multiplies gate-wise overheads and combines their probability and sign distributions across gates.The circuit distributions factor as products of the individual gate distributions and signs.Source: IV Minimal overhead decomposition of… · p. 11
  • Because noisy operations act only within each ideal gate’s support, the decomposition can be restricted to operations acting on at most two qubits.Such operations can therefore be represented using local noisy bases for the one- and two-qubit gates.Source: IV Minimal overhead decomposition of… · p. 11

V Depolarizing noise cancellation and numerical results

For depolarizing noise, the method constructs noisy bases by appending Pauli maps to ideal gates and samples modified circuits with gate-specific probabilities. The resulting quasi-probability representation gives an explicit single-qubit overhead and analogous two-qubit cancellation through Pauli maps.

Numerical simulations

Numerical simulations compare probabilistic error cancellation with direct noisy execution on randomly generated Clifford+T circuits. With identical run budgets, cancellation substantially improves the estimated output-probability precision.

Simulation setup

  • 500 random Clifford+T circuits were simulated with n = 6 qubits, depth d = 20, error rate ϵ = 0.01, and M = 4,000 total runs.The circuits used alternating single-qubit-gate and CNOT layers, with initial state |+⟩^⊗n.Source: Numerical simulations · pp. 12–13

Estimation procedure

  • The simulations estimate E∗(β) by sampling noisy circuits from a randomized ensemble and allocating the total run budget across circuit groups.The estimator is unbiased for any allocation, while the chosen allocation minimizes its variance for fixed M.Source: Numerical simulations · pp. 12–13

Results

  • Error cancellation achieved median simulation precision δ(β) approximately 0.05 across the random circuits.Here δ(β) = |Ê(β) − E∗(β)|, where Ê(β) is the error-cancelled estimate.Source: Numerical simulations · p. 13
  • Direct execution without error cancellation yielded median simulation precision δ0(β) approximately 0.15 using the same M = 4,000 runs.The authors conclude that error cancellation significantly improves simulation precision.Source: Numerical simulations · p. 13

VI Quasi-probability representation for amplitude-damping noise

The amplitude-damping construction extends quasi-probability error cancellation with noisy state preparations because noisy damped gates alone cannot represent arbitrary ideal unitaries. The resulting representation preserves circuit depth while assigning an overhead to each gate type.

Motivation

  • Amplitude-damping noisy unitary gates A^⊗kU alone cannot simulate arbitrary ideal unitary gates because the damping channel is non-unital.The construction therefore extends the noisy basis with state-preparation maps and uses non-product quasi-probability representations.Source: VI Quasi-probability representation… · pp. 13–14

Noisy basis

  • The extended noisy basis includes noisy preparations of |+⟩, |−⟩, |0⟩, and |1⟩, noisy single-qubit Clifford+T gates, and noisy two-qubit CNOT-related operations.The basis is claimed to simulate any ideal Clifford+T circuit.Source: VI Quasi-probability representation… · p. 14

Circuit representation

  • The quasi-probability representation preserves the ideal circuit depth, although it does not have a simple product form.This construction applies to any ideal Clifford+T circuit in the stated noisy basis.Source: VI Quasi-probability representation… · p. 14

Overhead construction

  • The ideal |+⟩ state preparation is represented with overhead γ′ = Σα|ηα| ≤ γ, where γ is the single-qubit overhead defined earlier.The resulting circuit construction replaces CNOTs first, then replaces remaining single-qubit gates and |+⟩ preparations by their quasi-probability representations.Source: VI Quasi-probability representation… · p. 15

Related papers

Loading 1612.02058v3…