Table of Contents
Fetching ...

Folding-Free Zero-Noise Extrapolation by Layout-induced Noise Diversity

Debarthi Pal, Yogesh Simmhan

Abstract

Near term quantum processors operate in a noise dominated regime, motivating error mitigation techniques that recover accurate expectation values without full fault tolerance. Zero Noise Extrapolation (ZNE) is a widely used but biased error mitigation method that lacks rigorous error bounds. Its effective application requires nontrivial technical choices, most notably the selection of noise scaling factors and extrapolation models, making ZNE sensitive to user expertise and often necessitating costly trial and error procedures. Here, we introduce Folding Free Zero Noise Extrapolation (FF-ZNE), a method that removes the need for noise factor selection by achieving effective noise amplification without circuit folding. FF-ZNE exploits isomorphic hardware layouts with distinct native noise profiles, such that executing a fixed circuit across these layouts induces controllable variations in the effective noise strength. Under a depolarizing noise model, we analytically show that the resulting extrapolation admits a fixed linear form, eliminating extrapolator choice and enabling a seamless, user independent mitigation procedure. We further propose two algorithms that identify sets of isomorphic hardware layouts on which a given circuit yields sufficiently distinct expectation values to enable reliable zero noise extrapolation. Experiments on a 133 qubit IBM Quantum device demonstrate that FF-ZNE yields mitigated expectation values with average deviations of ~6% and 4.5% for up to 50 qubit EfficientSU2 (sparse) and Hamiltonian simulation (dense) circuits, respectively. The method is thus scalable and applicable to a broad range of circuits. By eliminating noise factor and extrapolator selection, FF-ZNE transforms zero noise extrapolation from a technique requiring expert tuning into a practical, scalable, and broadly accessible error mitigation method for current quantum hardware.

Folding-Free Zero-Noise Extrapolation by Layout-induced Noise Diversity

Abstract

Near term quantum processors operate in a noise dominated regime, motivating error mitigation techniques that recover accurate expectation values without full fault tolerance. Zero Noise Extrapolation (ZNE) is a widely used but biased error mitigation method that lacks rigorous error bounds. Its effective application requires nontrivial technical choices, most notably the selection of noise scaling factors and extrapolation models, making ZNE sensitive to user expertise and often necessitating costly trial and error procedures. Here, we introduce Folding Free Zero Noise Extrapolation (FF-ZNE), a method that removes the need for noise factor selection by achieving effective noise amplification without circuit folding. FF-ZNE exploits isomorphic hardware layouts with distinct native noise profiles, such that executing a fixed circuit across these layouts induces controllable variations in the effective noise strength. Under a depolarizing noise model, we analytically show that the resulting extrapolation admits a fixed linear form, eliminating extrapolator choice and enabling a seamless, user independent mitigation procedure. We further propose two algorithms that identify sets of isomorphic hardware layouts on which a given circuit yields sufficiently distinct expectation values to enable reliable zero noise extrapolation. Experiments on a 133 qubit IBM Quantum device demonstrate that FF-ZNE yields mitigated expectation values with average deviations of ~6% and 4.5% for up to 50 qubit EfficientSU2 (sparse) and Hamiltonian simulation (dense) circuits, respectively. The method is thus scalable and applicable to a broad range of circuits. By eliminating noise factor and extrapolator selection, FF-ZNE transforms zero noise extrapolation from a technique requiring expert tuning into a practical, scalable, and broadly accessible error mitigation method for current quantum hardware.
Paper Structure (23 sections, 2 theorems, 5 equations, 6 figures, 7 tables, 2 algorithms)

This paper contains 23 sections, 2 theorems, 5 equations, 6 figures, 7 tables, 2 algorithms.

Key Result

Lemma 1

Let $l_1$ be the minimum-noise layout among $m$ isomorphic layouts. The time complexity of Algorithm alg:symmetric_layout_triples for selecting layouts $l_i, l_j$, with $1 < i < j$, that minimize $\Delta$ is $\mathcal{O}(m^2)$.

Figures (6)

  • Figure 1: Illustration of ZNE technique, adapted from majumdar. The expectation values $E(\lambda_{1}), E(\lambda_{2})$ and $E(\lambda_{3})$ are measured at increasing noise factors $\lambda_{1} < \lambda_{2} < \lambda_{3}$, and the zero-noise value $E^{*}$ is estimated by extrapolating these results to the zero-noise limit.
  • Figure 2: Comparison of the worst case quantum execution time for conventional ZNE and FF-ZNE. In the worst case, conventional ZNE requires exhaustive testing of standard noise-factor candidates (28 circuit executions), whereas FF-ZNE uses 3 isomorphic circuit executions, yielding an approximately $9\times$ reduction. On the hardware, this corresponds to a decrease in total execution time from $6.5$ minutes to $42$ seconds; conventional ZNE may require fewer executions when suitable noise factors are known a priori.
  • Figure 3: Illustration of FF-ZNE technique, with x-axis as the layout scores. The expectation values $E(s_{1}), E(s_{2})$ and $E(s_{3})$ are measured at increasing noise factors $s_{1} < s_{2} < s_{3}$, which are layout scores in this case, and the zero-noise value $E^{*}$ is estimated by extrapolating these results to the zero-noise limit.
  • Figure 4: Example quantum circuits for $6$ qubits. (a) EfficientSU2 ansätze. (b) Hamiltonian simulation circuit. These are representative examples used for illustration.
  • Figure 5: A heatmap of the discrepancy between the ideal and the zero-noise expectation values derived using FF-ZNE. We test EfficientSU2 circuits with different numbers of qubits $n$ ranging from 30-50 (x-axis) and repetitions $r$ ranging from 1-3 (y-axis) using the observable $O = \frac{1}{n} \sum_{i=0}^{n-1} Z_i$. The value within each cell is the 2-qubit depth of the corresponding circuit.
  • ...and 1 more figures

Theorems & Definitions (4)

  • Lemma 1
  • proof
  • Lemma 2
  • proof