Simulating general noise nearly as cheaply as Pauli noise

• URL: http://arxiv.org/abs/2512.07304v1
• Date: Mon, 08 Dec 2025 08:46:31 GMT
• Title: Simulating general noise nearly as cheaply as Pauli noise
• Abstract summary: We show how general noise can be simulated within the stabilizer formalism in reasonable time.<n>Our work enables detailed beyond-Pauli understanding of circuit performance in the presence of real device noise.
• Score: 0.13980986259786224
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Stabilizer simulation of Clifford quantum circuits - error-correction circuits, Clifford subroutines, etc. - on classical computers has played a central role in our understanding of circuit performance. The stabilizer description, however, restricts the accessible noise one can incorporate into the simulation to Pauli-type noise. More general noise, including coherent errors, may have more severe impact on circuit performance than Pauli noise; yet, such general noise have been difficult to access, much less investigate fully, in numerical simulations. Here, through the use of stratified importance sampling, we show how general noise can be simulated within the stabilizer formalism in reasonable time, with non-unitary noise being nearly as cheap as Pauli noise. Unitary (or coherent) noise can require an order of magnitude more time for the simulation, but nevertheless completes in very reasonable times, a drastic improvement over past approaches that typically fail to converge altogether. Our work thus enables detailed beyond-Pauli understanding of circuit performance in the presence of real device noise, which is rarely Pauli in nature. Among other examples, we present direct simulation results for the performance of the popular rotated planar surface codes under circuit-level general noise, previously available only in limited situations and/or through mappings to efficiently simulatable physical models.

Related papers

• Noise-induced Simulability Transition from Operator Scrambling [0.0]
  We study the finite-depth Pauli spectrum of random quantum circuits.<n>In noisy circuits, scrambling competes with an effective suppression of operator spreading.<n>We rigorously show that classical simulation remains exponentially hard.
  arXiv  Detail & Related papers  (2026-05-18T18:00:00Z)
• When quantum resources backfire: Non-gaussianity and symplectic coherence in noisy bosonic circuits [1.0874100424278175]
  We introduce the $textitdisplacement propagation$ algorithm for simulating noisy bosonic circuits.<n>We identify several computational phase transitions, revealing regimes where even modest noise levels render bosonic circuits efficiently classically simulable.<n>In particular, our analysis reveals a surprising phenomenon: computational resources usually associated with bosonic quantum advantage, namely non-Gaussianity and symplectic coherence, can make the system easier to classically simulate in presence of noise.
  arXiv  Detail & Related papers  (2025-10-08T17:25:47Z)
• 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)
• Noise-reduction of multimode Gaussian Boson Sampling circuits via Unitary Averaging [41.94295877935867]
  We improve Gaussian Boson Sampling (GBS) circuits by integrating the unitary averaging protocol.<n>We mitigate arbitrary interferometric noise, including beam-splitter and phase-shifter imperfections.<n>We derive a power-law formula predicting performance gains in large-scale systems.
  arXiv  Detail & Related papers  (2025-06-06T04:28:06Z)
• Correlating noise floor with magic and entanglement in Pauli product states [37.69303106863453]
  We show the ability to recover resources specific to quantum computing from noisy states generated by Pauli product formulas.<n>The fidelity of purified states represents the noise floor of a given computation.<n>We experimentally validate these findings by collecting classical shadow data for a range of small circuits.
  arXiv  Detail & Related papers  (2025-05-07T19:24:00Z)
• Simulating quantum circuits with arbitrary local noise using Pauli Propagation [0.0]
  We present a classical algorithm for estimating expectation values of arbitrary observables on typical quantum circuits under any incoherent local noise.<n>We show that this does not apply to average-case circuits, as these can be efficiently simulated using Pauli-path methods.
  arXiv  Detail & Related papers  (2025-01-22T18:57:16Z)
• Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation [4.903915603499684]
  Pauli backpropagation algorithms have already demonstrated their ability to efficiently simulate certain classes of parameterized quantum circuits.<n>Here, we close this gap by adapting Pauli backpropagation to non-unital noise.
  arXiv  Detail & Related papers  (2025-01-22T17:58:59Z)
• Multi-Layer Cycle Benchmarking for high-accuracy error characterization [0.0]
  We introduce Multi-Layer Cycle Benchmarking (MLCB) to improve the learnability associated with effective Pauli noise models.<n>In realistic scenarios, MLCB can reduce unlearnable noise degrees of freedom by up to $75%$, improving the accuracy of sparse Pauli-Lindblad noise models.<n>Our results highlight MLCB as a scalable, practical tool for precise noise characterization and improved quantum computation.
  arXiv  Detail & Related papers  (2024-12-12T15:00:31Z)
• Analog simulation of noisy quantum circuits [0.0]
  We propose a simulation technique based on a representation of hardware noise in terms of trajectories generated by operators that remain close to identity at low noise. This representation significantly reduces the variance over the quantum trajectories, speeding up noisy simulations by factors around $10$ to $100$.
  arXiv  Detail & Related papers  (2024-10-11T09:04:02Z)
• Noise-induced shallow circuits and absence of barren plateaus [2.5295633594332334]
  We show that any noise truncates' most quantum circuits to effectively logarithmic depth. We then prove that quantum circuits under any non-unital noise exhibit lack of barren plateaus for cost functions composed of local observables.
  arXiv  Detail & Related papers  (2024-03-20T19:00:49Z)
• Negative Pre-aware for Noisy Cross-modal Matching [46.5591267410225]
  Cross-modal noise-robust learning is a challenging task since noisy correspondence is hard to recognize and rectify. We present a novel Negative Pre-aware Cross-modal matching solution for large visual-language model fine-tuning on noisy downstream tasks.
  arXiv  Detail & Related papers  (2023-12-10T05:52:36Z)
• Accurate and Honest Approximation of Correlated Qubit Noise [39.58317527488534]
  We propose an efficient systematic construction of approximate noise channels, where their accuracy can be enhanced by incorporating noise components with higher qubit-qubit correlation degree.<n>We find that, for realistic noise strength typical for fixed-frequency superconducting qubits, correlated noise beyond two-qubit correlation can significantly affect the code simulation accuracy.
  arXiv  Detail & Related papers  (2023-11-15T19:00: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)
• 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)
• C2N: Practical Generative Noise Modeling for Real-World Denoising [53.96391787869974]
  We introduce a Clean-to-Noisy image generation framework, namely C2N, to imitate complex real-world noise without using paired examples. We construct the noise generator in C2N accordingly with each component of real-world noise characteristics to express a wide range of noise accurately.
  arXiv  Detail & Related papers  (2022-02-19T05:53:46Z)
• Learning Noise via Dynamical Decoupling of Entangled Qubits [49.38020717064383]
  Noise in entangled quantum systems is difficult to characterize due to many-body effects involving multiple degrees of freedom. We develop and apply multi-qubit dynamical decoupling sequences that characterize noise that occurs during two-qubit gates.
  arXiv  Detail & Related papers  (2022-01-26T20:22:38Z)

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.