Edukaizen

Menu
  • Nieuws
  • Hubbard 1D
    • Part 1: 1D Hubbard model
    • Part 2: Snake layout and fSWAP
    • Part 3: Qiskit and Fire Opal
    • Part 4: 120-qubit run
    • Part 5: Time-to-answer
    • Part 6: Tensor networks
    • Part 7: Majorana propagation
    • Part 8: Heatmaps
    • Part 9: 2D Hubbard outlook
    • Part 10: Quantum computer as a lab
    • Part 11: Official Monoprop benchmark
  • Hubbard 2D
    • Part 1: 1D to 2D
    • Part 2: Cuprates
    • Part 3: 3×3
    • Part 4: Time
    • Part 5: 4×4
    • Part 6: 6×6 Fez
  • Hadron
    • Deel 1: Hadron op quantumprocessor
    • Deel 2: Quarks en confinement
    • Deel 3: SU(2) en LSH
    • Deel 4: Hamiltoniaan en circuit
    • Deel 5: Fire Opal
    • Deel 6: Klassieke simulaties
    • Deel 7: Quantumvoordeel
  • Black Hole OLE
    • Part 1: What we ran
    • Part 2: How OLE works
    • Part 3: Fire Opal and Kingston
    • Part 4: The tensor-network challenge
    • Part 5: Hawking and scrambling
    • Part 6: What the result proves
    • Part 7: Local toy model
    • Part 8: QGSS26 compatibility
  • Random Graph
    • Start here
    • Part 1: Theory
    • Part 2: Circuit
    • Part 3: Qiskit
    • Part 4: Complexity
    • Part 5: Verification
    • Part 6: Workflow
    • Part 7: Conclusion
  • QOS QML
    • Nederlands
    • English
    • Beginnershandleiding 4q
  • Floquet-Ising
    • Part 1: Floquet physics
    • Part 2: Ising cycle
    • Part 3: Two-qubit toy model
    • Part 4: Oscillation and entanglement
    • Part 5: Noise and error mitigation
    • Part 6: Toward 51 qubits
  • Quantumgoud
    • Deel 1: Waarom goud een relativistisch quantumprobleem is
    • Deel 2: Waarom het goud-VQE-onderzoek uit 2025 vastliep
    • Deel 3: Van QE en spin-baan-koppeling naar Qiskit
    • Deel 4: Twaalf goud-spinormodi op vier qubits
    • Deel 5: De 24-qubit route: een actief venster voor transport
    • Deel 6: 24 qubits op IBM en met Fire Opal
    • Deel 7: De route naar quantumvoordeel voor goud
  • Advantage List
Menu

Noise and error mitigation without magic

Previous part | Series hub | Next part

Nederlands

Part 5 of the Floquet-Ising series: from two qubits to prethermal oscillations

On an ideal quantum computer, every gate is exactly unitary. Real hardware adds relaxation, dephasing, coherent over- or under-rotation, leakage, crosstalk, and measurement errors. Error mitigation aims to reduce bias in an observable without the full logical error correction of a fault-tolerant computer.

A transparent toy noise model

In the two-qubit model, we place a local Pauli-depolarizing step after every gate. Schematically, for one qubit,

\[
\mathcal{E}_p(\rho)=
(1-p)\rho+\frac{p}{3}
\left(X\rho X+Y\rho Y+Z\rho Z\right).
\]

The exact weights depend on the selected convention, but the idea is clear: a Pauli error is added with probability weight p. Because we know the full density matrix, we can evaluate the noise without sampling uncertainty.

This is not a model of a specific IBM calibration. Among other things, it omits temporal correlations, drift, leakage, and spatial crosstalk. Its simplicity is an advantage here: it reveals the mitigation arithmetic without a hidden fitting machine.

Zero-noise extrapolation

Suppose the expectation of an observable at scaled noise f decreases approximately exponentially:

\[
M(f)=M(0)e^{-\gamma f}.
\]

Measure or calculate M(1) at the original noise level and M(2) at twice the effective noise. Then

\[
\frac{M(1)^2}{M(2)}
=\frac{M(0)^2e^{-2\gamma}}{M(0)e^{-2\gamma}}
=M(0).
\]

This is the two-point exponential ZNE estimator. At cycle 6, the toy model gives:

Route Magnetization
Exact, noiseless 0.8273524194
Native noise f=1 0.6309694889
Amplified noise f=2 0.4809840321
Exponential ZNE 0.8277249781

The correction is impressive, but largely a designed success: the simple channel follows the exponential ansatz very closely. On hardware, the wrong functional model can produce an attractive but biased zero-noise estimate.

Probabilistic error cancellation

PEC takes a different approach. If we know the noise channel accurately enough, we write its inverse as a quasiprobabilistic combination of physically executable operations:

\[
\mathcal{E}^{-1}=\sum_j \eta_j\mathcal{B}_j.
\]

Some coefficients eta-j are negative. We sample operations according to the absolute weights and multiply the outcome by a sign and normalization factor. On average, the estimator can be unbiased, but its variance grows with the quasiprobability overhead.

PEC therefore trades bias for sampling cost. In deep circuits, this overhead can grow exponentially. A result without error bars or QPU costs tells only half the story.

Error suppression, readout mitigation, and mitigation

Different techniques should not be lumped together:

  • Transpilation and dynamical decoupling change the circuit to suppress errors in advance.
  • Gate twirling randomizes coherent error structure to create a more tractable effective channel.
  • M3 readout mitigation calibrates measurement confusion and corrects measured marginals.
  • ZNE extrapolates from multiple noise strengths.
  • PEC uses a characterized quasiprobabilistic inverse.

In our IBM route, we combine a raw arm with an XY4 and twirling arm and use a shared balanced M3 calibration. For the global 51-bit distribution, 512 shots are far too sparse. M3 is therefore applied locally to the one- and two-qubit supports of magnetization and ZZ pairs.

Why shared calibration matters

When two measurement arms are corrected with different calibrations, calibration drift can resemble a physical difference. A shared M3 snapshot makes the comparison better paired. It does not remove all drift: raw, suppression, and calibration runs still occur at different times. The timestamps therefore belong to the scientific data.

The paper’s validation hierarchy

QESEM-Unbiased uses a PEC-like unbiased estimator and becomes statistically expensive at greater depth. QESEM-Extrapolated uses noise-amplified estimators and reaches later cycles with less overhead, but is more model-dependent. The paper validates the later route in the region where both methods still overlap.

Independent noise-amplification factors, hardware tests of the characterized noise model, early-cycle classical references, and selected Quantinuum results provide additional checks. No single control carries the entire claim.

The fairest conclusion from the toy model

The toy model shows exactly how noise damps an oscillation and how ZNE reconstructs the zero-noise value under the correct ansatz. It does not prove that the same ansatz is valid on a 51-qubit processor. Its scientific value lies in transparency: we know which assumption makes the correction work and can then test whether that assumption holds on hardware.

In part 6, we compare the scaling steps. This reveals why classical convergence, mitigation uncertainty, and resource accounting together determine whether the phrase quantum advantage is justified.

Sources

  1. Derivation and toy implementation.
  2. Z. Cai et al., Quantum Error Mitigation.
  3. E. Leviatan et al., QESEM validation hierarchy.
Previous part | Series hub | Next part

Recent Posts

  • Quantum computing-nieuws — 8 augustus 2026
  • Quantum computing-nieuws — 7 augustus 2026
  • Quantum computing-nieuws — 6 augustus 2026
  • Quantum computing-nieuws — 5 augustus 2026
  • Quantum computing-nieuws — 4 augustus 2026

Recent Comments

No comments to show.

Archives

  • August 2026
  • July 2026
  • May 2026
  • March 2026
  • February 2026
  • September 2024

Categories

  • 10
  • Quantum Computing
  • Uncategorized
©2026 Edukaizen | Theme by SuperbThemes