Abstract Reliable quantum computation requires certifiable bounds on the degradation of ideal circuit outputs under realistic noise. Existing fidelity estimates are typically asymptotic, hardware-specific, or require full density-matrix simulation, rendering them impractical for circuit-scale certification. We introduce a computable fidelity floor for noisy quantum circuits based on light-cone--resolved Pauli weight growth. For circuits subject to independent Markovian single-qubit noise, we prove a rigorous trace-distance bound expressed entirely in terms of circuit structure: per-qubit active times and a combinatorial backward light-cone descriptor of entangling gates. The resulting bound is computable in $O(Gn)$ time for a circuit with $G$ gates on $n$ qubits, avoiding exponential state-space simulation. We further introduce an empirically validated exponential envelope refinement that tightens the rigorous bound while remaining conservative across all tested configurations. Across more than $10^3$ circuit instances spanning four noise heterogeneity structures (uniform, anti-correlated, spike, and random per-qubit $T_1/T_2$ rates, up to $n=8$, depth~40), the envelope bound achieves 100\% validity and exhibits a stable compression factor across heterogeneity modes, reaching approximately $2.6\times$ at depth~20 relative to the combinatorial bound. The envelope remains informative within the empirically determined regime $n \le 8$, depth~$\le 20$, and $\gamma T \lesssim 0.3$. These results establish a circuit-structure--based fidelity certification framework computable at compiler timescale and identify a depth-dependent compression invariant connecting rigorous combinatorial bounds to empirically tighter envelope estimates.
Abstract Reliable quantum computation requires certifiable bounds on the degradation of ideal circuit outputs under realistic noise. Existing fidelity estimates are typically asymptotic, hardware-specific, or require full density-matrix simulation, rendering them impractical for circuit-scale certification. We introduce a computable fidelity floor for noisy quantum circuits based on light-cone--resolved Pauli weight growth. For circuits subject to independent Markovian single-qubit noise, we prove a rigorous trace-distance bound expressed entirely in terms of circuit structure: per-qubit active times and a combinatorial backward light-cone descriptor of entangling gates. The resulting bound is computable in O(Gn) time for a circuit with G gates on n qubits, avoiding exponential state-space simulation. We further introduce an empirically validated exponential envelope refinement that tightens the rigorous bound while remaining conservative across all tested configurations. Across more than 103 circuit instances spanning four noise heterogeneity structures (uniform, anti-correlated, spike, and random per-qubit T1/T2 rates, up to n=8, depth40), the envelope bound achieves 100% validity and exhibits a stable compression factor across heterogeneity modes, reaching approximately 2.6× at depth20 relative to the combinatorial bound. The envelope remains informative within the empirically determined regime n≤8, depth~≤20, and γT≲0.3. These results establish a circuit-structure--based fidelity certification framework computable at compiler timescale and identify a depth-dependent compression invariant connecting rigorous combinatorial bounds to empirically tighter envelope estimates.
Dynamic circuits, which augment unitary operations with mid-circuit measurements and classical feedforward, can generate long-range entanglement in constant depth, enabling low-depth primitives ranging from nontrivial state preparation to many-qubit entangling gates. Escaping the light-cone constraints of unitary circuits, however, comes at a cost: these primitives typically require a number of mid-circuit measurements that scales with system size and that, together with feedforward latency, can introduce errors that degrade the long-range entanglement they rely on. Here, we alleviate this tension by showing that many such primitives, when cast into a common framework, admit an error-detection scheme that trades infidelity for postselection overhead with no additional ancillas. Our framework thus unifies and upgrades a broad class of primitives including fan-out gates, multi-qubit Pauli rotations, the preparation of W and higher-weight Dicke states, and certain non-normal matrix product states. We also introduce a reduced-depth, error-detected implementation of the Hadamard test, extending the use cases of dynamic circuits to a key algorithmic primitive. Finally, we establish the practical utility of our scheme through experiments on a superconducting quantum processor. We demonstrate the error-detected preparation of a long-range entangled Bell pair spanning a 100-qubit chain with fidelity F=0.59±0.02, surpassing the entanglement-certification threshold F>0.5 that the baseline dynamic-circuit implementation fails to reach (0.39±0.01). Separately, we demonstrate constant-depth preparation of W states of up to 20 qubits by consuming GHZ states of up to 40 qubits, finding absolute fidelity improvements of ΔF≈0.2 across the largest sizes studied. Altogether, these results bring low-depth dynamic-circuit primitives within practical reach on present-day hardware.
Abstract: Reliable quantum computation requires certifiable bounds on the degradation of ideal circuit outputs under realistic noise. Existing fidelity estimates are typically asymptotic, hardware-specific, or require full density-matrix simulation, rendering them impractical for circuit-scale certification. We introduce a computable fidelity floor for noisy quantum circuits based on light-cone–resolved Pauli weight growth. For circuits subject to independent Markovian single-qubit noise, we prove a rigorous trace-distance bound expressed entirely in terms of circuit structure: per-qubit active times and a combinatorial backward light-cone descriptor of entangling gates. The resulting bound is computable in O(Gn) time for a circuit with Ggates on nqubits, avoiding exponential state-space simulation. We further introduce an empirically validated exponential envelope refinement that tightens the rigorous bound while remaining conservative across all tested configurations. Across more than 103 circuit instances spanning four noise heterogeneity structures (uniform, anti-correlated, spike, and random per-qubit T1/T2 rates, up to n= 8, depth 40), the envelope bound achieves 100% validity and exhibits a stable compression factor across heterogeneity modes, reaching approximately 2.6× at depth 20 relative to the combinatorial bound. The envelope remains informative within the empirically determined regime n≤ 8, depth ≤ 20, and γT ≲ 0.3. These results establish a circuit-structure–based fidelity certification framework computable at compiler timescale and identify a depth-dependent compression invariant connecting rigorous combinatorial bounds to empirically tighter envelope estimates.
Sampling-based proposals are prominent candidates for demonstrating quantum computations beyond the reach of classical supercomputers. However, it has been difficult to combine their complexity-theoretic hardness with two capabilities needed for scalable quantum computing more generally: suppressing hardware errors, and verifying the quantum computation itself. Here we address both issues by introducing structured circuits, which, in addition to provable hardness guarantees, admit an encoding in a quantum code. This allows us to simultaneously reach high fidelities at high circuit depths, and to certify an experimental fidelity via the circuit structure and measurement of code syndromes. The resulting certificate is device dependent, but requires substantially weaker noise assumptions than existing fidelity proxy benchmarks. We demonstrate our proposal with a 64-qubit, depth-73 Clifford circuit, doped with 314T gates. We use a total of 76 physical qubits to encode this computation in spacetime codes, effectively suppressing gate error rates by 10× after syndrome post-selection, and yielding a state with a fidelity lower bound of 0.349 with 95% confidence. Our construction is a systematic method for promoting a stabilizer state to a magic state while keeping an error-detected fidelity certificate.
Quantum circuits with a constant rate of depolarizing noise per qubit per time step are known to converge to the uniform distribution at depth ω(p−1logn), and hence become trivially classically simulable by uniform sampling. We show that under the physically natural constraint of geometric locality, noisy circuits become classically simulable at shallower depths by substantially more structured classical algorithms. We consider arbitrary geometrically local quantum circuits on n qubits, initialized in an arbitrary product state, with nearest-neighbor gates in O(1) spatial dimensions and interspersed depolarizing noise of any constant strength p. Our first result is that when the depth exceeds a threshold d∗=Θ(p−1logn), the output distribution can be approximately sampled in quasipolynomial time. This gives a worst-case simulability result for noisy geometrically local circuits, and matches in its n-dependence the best previously known results for noisy random circuits. The proof is based on new information-theoretic bounds showing that in geometrically local noisy circuits, local regions lose correlations and independently converge to maximally mixed strictly before the entire system converges to the uniform distribution. We further prove structural results suggesting a sharper transition at depth Θ~(p−1): after coarse-graining the lattice, Pauli weight supported on long connected paths can be truncated with exponentially small error. These results provide evidence for a percolation-like mechanism behind classical simulability at constant depth, and motivate our conjecture that all noisy geometrically local circuits admit quasipolynomial-time approximate sampling once circuit depth exceeds Θ~(p−1).
Abstract We study the distribution over measurement outcomes of noisy random quantum circuits in the regime of low fidelity, which corresponds to the setting where the computation experiences at least one gate-level error with probability close to one. We model noise by adding a pair of weak, unital, single-qubit noise channels after each two-qubit gate, and we show that for typical random circuit instances, correlations between the noisy output distribution pnoisy p noisy and the corresponding noiseless output distribution pideal p ideal shrink exponentially with the expected number of gate-level errors. Specifically, the linear cross-entropy benchmark F that measures this correlation behaves as F=exp(−2sϵ±O(sϵ2)) F = exp ( - 2 s ϵ ± O ( s ϵ 2 ) ) , where ϵ ϵ is the probability of error per circuit location and s is the number of two-qubit gates. Furthermore, if the noise is incoherent—for example, depolarizing or dephasing noise—the total variation distance between the noisy output distribution pnoisy p noisy and the uniform distribution punif p unif decays at precisely the same rate. Consequently, the noisy output distribution can be approximated as pnoisy≈Fpideal+(1−F)punif p noisy ≈ F p ideal + ( 1 - F ) p unif . In other words, although at least one local error occurs with probability 1−F 1 - F , the errors are scrambled by the random quantum circuit and can be treated as global white noise, contributing completely uniform output. Importantly, we upper bound the average total variation error in this approximation by O(Fϵs) O ( F ϵ s ) . Thus, the “white-noise approximation” is meaningful when ϵs≪1 ϵ s ≪ 1 , a quadratically weaker condition than the ϵs≪1 ϵ s ≪ 1
Quantum benchmarks provide compact measures of performance that are important for evaluating and comparing quantum systems. Circuit-level benchmarks are particularly valuable because they capture the accumulated effects of noise across interacting operations, but existing approaches may require structured gate sets and costly compilation, classical simulation of reference outputs, or subsystem decompositions that do not capture full-register behavior. We introduce Error Per Circuit Layer (EPCL), an overlap-based circuit-level benchmark that estimates an effective layer polarization by applying identical random circuits to two disjoint quantum registers and measuring the overlap between their output states as a function of circuit depth. EPCL avoids classical simulation of ideal output distributions and recovery to a known reference state, and is compatible with arbitrary gate sets, including non-Clifford gates.
We derive the expected overlap decay under an ensemble-averaged depolarizing model and identify the assumptions under which the fitted decay parameter represents an effective layer polarization. Numerical simulations show that EPCL recovers the predicted polarization under weak local stochastic noise and remains well described by a single-exponential decay at stronger stochastic noise levels. The simulations further show that coherent errors associated with fixed entangling layers may require Pauli twirling or randomized compiling to produce the expected decay, while inter-register correlations contribute an additional covariance term to the measured overlap. Finally, experiments on IBM quantum hardware demonstrate clear EPCL decay in 8- and 16-qubit implementations. These results support EPCL as a method for measuring aggregate register performance without requiring classical simulation of ideal circuit outputs or restriction to structured gate sets.