Computing logical error thresholds with the Pauli Frame Sparse Representation

• URL: http://arxiv.org/abs/2603.14670v1
• Date: Sun, 15 Mar 2026 23:54:37 GMT
• Title: Computing logical error thresholds with the Pauli Frame Sparse Representation
• Abstract summary: We introduce a sparse classical representation, a truncation strategy and a shot-efficient sampling method to push the classical prediction of quantum error correction thresholds beyond Clifford operations and Pauli errors.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a sparse classical representation, a truncation strategy and a shot-efficient sampling method to push the classical prediction of quantum error correction thresholds beyond Clifford operations and Pauli errors. As two illustrations of the potential of our method, we first show that coherent noise error thresholds, when computed at the circuit level (i.e taking into account full syndrome circuits) for distances up to d=9, are systematically overestimated (by a factor of about 4) by a Pauli-twirling approximation of the noise. We then apply our method to the recently introduced magic-state cultivation protocol. We show, through shot-efficient importance sampling, that, at distance d=5, the multiplicative factor between the T-gate and the S-gate injection error rate is not the one conjectured from low-d computations: it can be as large as 7.

Related papers

• Probabilistic Error Cancellation for Single-Mode Gottesman-Kitaev-Preskill Codes [45.91504150103373]
  We study a quantum error mitigation method known as probabilistic error cancellation in the context of the Gottesman-Kitaev-Preskill code.<n>We employ the stabilizer subsystem decomposition for GKP codes to obtain an effective logical channel for noisy operations.
  arXiv  Detail & Related papers  (2026-09-15T12:29:45Z)
• Quantum Decision Theory for Displacement Detection with Finite-Energy GKP States [46.2474896050764]
  We develop a framework for detecting phase-space displacements with finite-energy, $d$-level Gottesman-Kitaev-Preskill (GKP) probes.<n>For single-mode and entanglement-assisted architectures, we derive the Bayesian minimum-error probability.<n>We benchmark the resulting protocols against coherent-state, direction-matched squeezed-vacuum, and twin-beam schemes.
  arXiv  Detail & Related papers  (2026-08-08T10:32:05Z)
• Characterization of Unlearnable Noise with Mid-Circuit-Measurement-Based Cycle Benchmarking [0.28144129864580447]
  We introduce a framework that makes Pauli fidelities and non-Markovian noise learnable via repeated measurements and classical post-processing.<n>We numerically demonstrate the feasibility of characterizing the previously unlearnable noise components.
  arXiv  Detail & Related papers  (2026-06-28T23:06:29Z)
• Continuous Noise Model for Quantum Circuits [0.6335848702857038]
  We study a continuous coherent noise model for quantum circuits and compare it with a discrete Pauli model.<n>The focus is on small coherent gate errors that build up across circuit depth.<n>Results show that continuous coherent noise can degrade logical performance more strongly than Pauli noise.
  arXiv  Detail & Related papers  (2026-04-28T18:00:03Z)
• Infinite Distance Extrapolation: How error mitigation can enhance quantum error correction [1.7747590318218414]
  Quantum error mitigation (QEM) and quantum error correction (QEC) are two research areas that are often considered as distinct entities.<n>We explore a paradigm at the intersection of the two, based on the error mitigation technique of Zero-Noise Extrapolation (ZNE)<n>We exploit the fact that a reduction in the physical noise level is analogous to an increase in the code distance, as both of them result in a decrease in the logical error rate.
  arXiv  Detail & Related papers  (2026-03-11T20:26:40Z)
• Closing the Approximation Gap of Partial AUC Optimization: A Tale of Two Formulations [121.39938773554523]
  The Area Under the ROC Curve (AUC) is a pivotal evaluation metric in real-world scenarios with both class imbalance and decision constraints.<n>We present two simple instance-wise minimax reformulations to close the approximation gap of PAUC optimization.<n>The resulting algorithms enjoy a linear per-iteration computational complexity w.r.t. the sample size and a convergence rate of $O(-2/3)$ for typical one-way and two-way PAUCs.
  arXiv  Detail & Related papers  (2025-12-01T02:52:33Z)
• Reducing the sampling complexity of energy estimation in quantum many-body systems using empirical variance information [45.18582668677648]
  We consider the problem of estimating the energy of a quantum state preparation for a given Hamiltonian in Pauli decomposition.<n>We construct an adaptive estimator using the state's actual variance.
  arXiv  Detail & Related papers  (2025-02-03T19:00:01Z)
• Reduced Sampling Overhead for Probabilistic Error Cancellation by Pauli Error Propagation [0.0]
  We present a method to reduce the sampling overhead of PEC through Pauli error propagation combined with classical preprocessing.<n>Our findings indicate that this method significantly reduces sampling overheads for Clifford circuits, leveraging the well-defined interaction between the Clifford group and Pauli noise.<n>We show that the method is applicable to non-Clifford circuits, though with more limited effectiveness, primarily constrained by the number of non-Clifford gates present in the circuit.
  arXiv  Detail & Related papers  (2024-12-02T09:25:40Z)
• Robust ultra-shallow shadows [0.251657752676152]
  We present a robust shadow estimation protocol for wide classes of low-depth measurement circuits.<n>For weakly-correlated local noise, the measurement channel has an efficient matrix-product representation.<n>We show how to estimate this directly from experimental data using tensor-network tools.
  arXiv  Detail & Related papers  (2024-05-09T18:00:09Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• The Accuracy vs. Sampling Overhead Trade-off in Quantum Error Mitigation Using Monte Carlo-Based Channel Inversion [84.66087478797475]
  Quantum error mitigation (QEM) is a class of promising techniques for reducing the computational error of variational quantum algorithms. We consider a practical channel inversion strategy based on Monte Carlo sampling, which introduces additional computational error. We show that when the computational error is small compared to the dynamic range of the error-free results, it scales with the square root of the number of gates.
  arXiv  Detail & Related papers  (2022-01-20T00:05:01Z)
• Fundamental limits of quantum error mitigation [0.0]
  We show how error-mitigation algorithms can reduce the computation error as a function of their sampling overhead. Our results provide a means to identify when a given quantum error-mitigation strategy is optimal and when there is potential room for improvement.
  arXiv  Detail & Related papers  (2021-09-09T17:56:14Z)
• Direct Measure Matching for Crowd Counting [59.66286603624411]
  We propose a new measure-based counting approach to regress the predicted density maps to the scattered point-annotated ground truth directly. In this paper, we derive a semi-balanced form of Sinkhorn divergence, based on which a Sinkhorn counting loss is designed for measure matching.
  arXiv  Detail & Related papers  (2021-07-04T06:37:33Z)

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.