Analytical and Compressed Simulation of Noisy Stabilizer Circuits

• URL: http://arxiv.org/abs/2604.22588v1
• Date: Fri, 24 Apr 2026 14:17:40 GMT
• Title: Analytical and Compressed Simulation of Noisy Stabilizer Circuits
• Abstract summary: We develop techniques that enable efficient simulation of a broad class of noisy stabilizer circuits.<n>We derive closed-form expressions of expectation values for tensor product of Paulis in circuits with non-deterministic Pauli measurements.<n>We introduce a circuit compression framework that reduces the per-sample cost of weak simulation in general noisy stabilizer circuits.
• Score: 0.13048920509133807
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We develop analytical and algorithmic techniques that enable efficient simulation of a broad class of noisy stabilizer circuits. We derive closed-form expressions of expectation values for tensor product of Paulis in circuits with non-deterministic Pauli measurements, yielding an efficient strong simulation method that avoids explicit density matrix construction and enables direct noise parameter sweeps. We introduce a circuit compression framework that reduces the per-sample cost of weak simulation in general noisy stabilizer circuits, including deterministic measurements, by separating parameter-independent preprocessing from sampling. Finally, we extend the analytical framework beyond its standard domain to include a small number of deterministic measurements, general rotations, and non-diagonal noise channels. Our results provide a unified framework for both strong and weak simulation of noisy stabilizer circuits and corresponds to an extension of the noisy stabilizer formalism introduced in \cite{PhysRevA.107.032424}. They offer applications ranging from calculation of the expectation values of entanglement witnesses, determination of reduced states, to energy evaluation.

Related papers

• Physics-Constrained Compressed Sensing for Quantum Sensing in the Data-Starved Regime [0.10152838128195464]
  Quantum sensors promise measurement sensitivities that can scale at the Heisenberg limit.<n>In practice their performance is often degraded by noise, finite sampling, and implementation imperfections.<n>We present a general framework for improving parameter estimation in such settings.
  arXiv  Detail & Related papers  (2026-08-11T16:00:33Z)
• Sampling Noise and Optimized Measurement Distribution in Imaginary-Time Quantum Dynamics Simulations [3.676179866627893]
  Variational quantum dynamics simulations (VQDS) provide a promising route to simulate real- and imaginary-time quantum dynamics on quantum devices.<n>We investigate the impact of sampling noise on VQDS, with a focus on ground-state preparation in one-dimensional Ising spin models.<n>We show that optimized shot allocation can significantly improve state fidelity and reduce the total measurement cost.
  arXiv  Detail & Related papers  (2026-05-19T18:27:33Z)
• 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)
• 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)
• Boundaries for quantum advantage with single photons and loop-based time-bin interferometers [37.28808413070634]
  Loop-based boson samplers interfere photons in the time degree of freedom using a sequence of delay lines.<n>We propose a method to exploit this loop-based structure to more efficiently classically sample from such systems.
  arXiv  Detail & Related papers  (2024-11-25T19:13:20Z)
• Noise-resilient and resource-efficient hybrid algorithm for robust quantum gap estimation [0.0]
  We present a hybrid quantum algorithm for estimating gaps in many-body energy spectra.<n>We employ error mitigation strategies that optimize the utilization of quantum resources.<n>Results underscore the potential to enable accurate quantum simulations on near-term noisy quantum devices.
  arXiv  Detail & Related papers  (2024-05-16T17:57:15Z)
• Estimating Non-Stabilizerness Dynamics Without Simulating It [43.80709028066351]
  Iterative Clifford Circuit Renormalization (I CCR) is designed to efficiently handle the dynamics of non-stabilizerness in quantum circuits.<n>I CCR embeds the complex dynamics of non-stabilizerness in the flow of an effective initial state.<n>We implement the I CCR algorithm to evaluate the non-stabilizerness dynamics for systems of size up to N = 1000.
  arXiv  Detail & Related papers  (2024-05-09T18:57:55Z)
• 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)
• Tradeoffs between convergence rate and noise amplification for momentum-based accelerated optimization algorithms [8.669461942767098]
  We study momentum-based first-order optimization algorithms in which the iterations are subject to an additive white noise. For strongly convex quadratic problems, we use the steady-state variance of the error in the optimization variable to quantify noise amplification. We introduce two parameterized families of algorithms that strike a balance between noise amplification and settling time.
  arXiv  Detail & Related papers  (2022-09-24T04:26:30Z)
• Square Root Principal Component Pursuit: Tuning-Free Noisy Robust Matrix Recovery [8.581512812219737]
  We propose a new framework for low-rank matrix recovery from observations corrupted with noise and outliers. Inspired by the square root Lasso, this new formulation does not require prior knowledge of the noise level. We show that a single, universal choice of the regularization parameter suffices to achieve reconstruction error proportional to the (a priori unknown) noise level.
  arXiv  Detail & Related papers  (2021-06-17T02:28:11Z)
• Comparative Study of Sampling-Based Simulation Costs of Noisy Quantum Circuits [0.8206877486958002]
  We characterize the simulation costs of two major quantum schemes, stabilizer-state sampling of magic states and Heisenberg propagation. It revealed that in the low noise regime, stabilizer-state sampling results in a smaller sampling cost, while Heisenberg propagation is better in the high noise regime.
  arXiv  Detail & Related papers  (2020-11-12T07:12:47Z)
• Robust Reinforcement Learning with Wasserstein Constraint [49.86490922809473]
  We show the existence of optimal robust policies, provide a sensitivity analysis for the perturbations, and then design a novel robust learning algorithm. The effectiveness of the proposed algorithm is verified in the Cart-Pole environment.
  arXiv  Detail & Related papers  (2020-06-01T13:48:59Z)
• Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors [52.06292503723978]
  Motivated by advances in compressive sensing with generative models, we study the problem of 1-bit compressive sensing with generative models. We first consider noiseless 1-bit measurements, and provide sample complexity bounds for approximate recovery under i.i.d.Gaussian measurements. We demonstrate that the Binary $epsilon$-Stable Embedding property, which characterizes the robustness of the reconstruction to measurement errors and noise, also holds for 1-bit compressive sensing with Lipschitz continuous generative models.
  arXiv  Detail & Related papers  (2020-02-05T09:44:10Z)

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.