Color code thresholds under circuit-level noise beyond the Pauli framework

• URL: http://arxiv.org/abs/2511.05719v1
• Date: Fri, 07 Nov 2025 21:24:51 GMT
• Title: Color code thresholds under circuit-level noise beyond the Pauli framework
• Authors: Francesco Pio Barone, Daniel Jaschke, Ilaria Siloi, Simone Montangero,
• Abstract summary: A quantum error correction code is assessed over its ability to correct errors in noisy quantum circuits.<n>This task requires extensive simulations of faulty quantum circuits, which are often made tractable by considering Pauli noise models.<n>We extend circuit-level noise beyond the Pauli framework by estimating the threshold of the color code under more general noise models.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A quantum error correction code is assessed over its ability to correct errors in noisy quantum circuits. This task requires extensive simulations of faulty quantum circuits, which are often made tractable by considering stochastic Pauli noise models, as they are compatible with efficient classical simulation techniques. However, such noise models do not fully capture the variety of physical error mechanisms encountered in realistic quantum platforms. In this work, we extend circuit-level noise modeling beyond the Pauli framework by estimating the threshold of the color code under more general noise models. Specifically, we consider two representative non-Pauli error channels: a systematic $X$-rotation model that introduces coherent over-rotations, and an amplitude damping channel that captures relaxation processes. These models are incorporated at the circuit level into color code circuits using a Tree Tensor Network ansatz. Our simulations demonstrate that tensor network simulations enable accurate threshold estimation under non-Pauli noise for color codes up to distance $d=7$ (73 qubits). Comparing our results with the Pauli twirling approximations of the noise models, we find that coherent over-rotations yield systematically higher error rates, deviating from the Pauli twirling approximation as the code distance increases.

Related papers

• Correcting coherent quantum errors by going with the flow [0.0]
  We show that the logical qubit performance beyond distance 3 for correlated single-qubit Hamiltonian noise models (i.e., global errant qubit rotations) matches the performance of Pauli noise model with the same process fidelity (fidelity after one application)<n>In a more general circuit model of noise, correlations may add constructively within syndrome extraction rounds but Pauli frame randomization from passive error correction mitigates this effect across multiple rounds.
  arXiv  Detail & Related papers  (2026-02-24T16:39:14Z)
• Logical Error Rates for the Surface Code Under a Mixed Coherent and Stochastic Circuit-Level Noise Model Inspired by Trapped Ions [0.5767156832161817]
  We consider logical error rates for the surface code implemented on a hypothetical grid-based trapped-ion quantum charge-coupled device (QCCD) architecture.<n>Specifically, we construct logical channels for the idling surface code and examine its diamond error under a mixed coherent and circuit-level noise model.
  arXiv  Detail & Related papers  (2025-08-19T19:37:09Z)
• Error mitigation of shot-to-shot fluctuations in analog quantum simulators [46.54051337735883]
  We introduce an error mitigation technique that addresses shot-to-shot fluctuations in the parameters for the Hamiltonian governing the system dynamics.<n>We rigorously prove that amplifying this shot-to-shot noise and extrapolating to the zero-noise limit recovers noiseless results for realistic noise distributions.<n> Numerically, we predict a significant enhancement in the effective many-body coherence time for Rydberg atom arrays under realistic conditions.
  arXiv  Detail & Related papers  (2025-06-19T18:00:00Z)
• The surface code beyond Pauli channels: Logical noise coherence, information-theoretic measures, and errorfield-double phenomenology [0.0]
  We consider the surface code under errors featuring both coherent and incoherent components.<n>We show that for any nonzero incoherent noise component, the coherence of the logical noise is exponentially suppressed with the code distance.
  arXiv  Detail & Related papers  (2024-12-30T16:14:55Z)
• Bayesian Quantum Amplitude Estimation [46.03321798937855]
  We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Overcoming the Zero-Rate Hashing Bound with Holographic Quantum Error Correction [40.671162828621426]
  Finding an optimal quantum code under biased noise is a challenging problem.<n> benchmark for this capacity is given by the hashing bound.<n>We show that zero-rate holographic codes, built from hyperbolic tensor networks, fulfill both conditions.
  arXiv  Detail & Related papers  (2024-08-12T15:35:03Z)
• Modeling error correction with Lindblad dynamics and approximate channels [0.0]
  We study how different approximations of the noise capture the success rate of a code.<n>A Pauli approximation going beyond a single-qubit channel is sensitive to the details of the noise, state, and decoder.
  arXiv  Detail & Related papers  (2024-02-26T16:48:34Z)
• Emergence of noise-induced barren plateaus in arbitrary layered noise models [44.99833362998488]
  In variational quantum algorithms the parameters of a parameterized quantum circuit are optimized in order to minimize a cost function that encodes the solution of the problem. We discuss how, and in which sense, the phenomenon of noise-induced barren plateaus emerges in parameterized quantum circuits with a layered noise model.
  arXiv  Detail & Related papers  (2023-10-12T15:18:27Z)
• Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer [41.94295877935867]
  Crosstalk errors, stemming from CNOT two-qubit gates, are a crucial source of errors on numerous quantum computing platforms. We develop and apply an extension of the randomized compiling protocol that includes a special treatment of neighboring qubits. Our twirling of neighboring qubits is shown to dramatically improve the noise estimation protocol without the need to add new qubits or circuits.
  arXiv  Detail & Related papers  (2023-05-03T18:00:02Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Fundamental thresholds of realistic quantum error correction circuits from classical spin models [0.0]
  We use Monte-Carlo simulations to study the resulting phase diagram of the associated interacting spin model. The presented method provides an avenue to assess the fundamental thresholds of QEC codes and associated readout circuitry, independent of specific decoding strategies.
  arXiv  Detail & Related papers  (2021-04-10T19:26:37Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.