Noise structuring in fixed-depth Trotter simulation: stationary channels and observable-level depolarization

• URL: http://arxiv.org/abs/2607.17936v1
• Date: Mon, 20 Jul 2026 13:33:59 GMT
• Title: Noise structuring in fixed-depth Trotter simulation: stationary channels and observable-level depolarization
• Abstract summary: We analyze fixed-depth Trotter simulation as a method for structuring hardware noise in digital many-body dynamics.<n>For local faults, we show that, once propagated faults lose memory of their insertion layer, the noisy circuit factorizes into ideal evolution.<n>Our results also reveal limitations of naive zero-noise extrapolatin strategies based on oversimplified functions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We analyze fixed-depth Trotter simulation as a method for structuring hardware noise in digital many-body dynamics. The number of layers is chosen using the largest endpoint time and is then kept fixed throughout the time scan, making the total noise dose approximately independent of the endpoint time. For local stochastic faults, we show that, once propagated faults lose memory of their insertion layer, the noisy circuit factorizes into ideal evolution followed by a stationary finite-depth binomial channel. In the dilute-layer limit, this channel reduces to a Poissonian exponential. The memory time of a single fault is related to a Loschmidt echo. An important consequence is observable-level depolarization: for selected macroscopic observables at low to moderate noise levels, the stationary channel can act as an almost time-independent affine contrast correction, even though the full channel need not be depolarizing, which is crusial for error mitigation purposes. At short times, the same protocol produces a digital Zeno-like transient, in which a fixed number of noise opportunities competes with a vanishing coherent angle per layer. Our results also reveal limitations of naive zero-noise extrapolatin strategies based on oversimplified functions.

Related papers

• Fractional-Order Adaptive Motion Magnification: Phase-Reliability Weighting for Noise-Constrained Video Amplification [51.56484100374058]
  We propose Fractional-order Adaptive Motion Magnification, a pipeline developed first offline and then as a causal stream.<n>It replaces the constant temporal gain with a Grnwald--Letnikov derivative of fractional order, giving continuous control over high-frequency emphasis.<n>Real videos show improved spatial selectivity and lower background noise in every case.
  arXiv  Detail & Related papers  (2026-09-03T21:43:22Z)
• The Gain-Engineered Transmon [68.89136228609398]
  We introduce and experimentally realize a noise-biased qubit in a standard transmon-readout resonator circuit.<n>Our results open a path towards using this system as a simple building-block for hardware-efficient quantum error detection and correction schemes.
  arXiv  Detail & Related papers  (2026-08-26T17:00:42Z)
• Surprise Forcing: What to Remember, When to Skip in Long Video Generation [65.0022589149937]
  Streaming autoregressive diffusion makes minute-scale video synthesis practical, but its bounded context and fixed denoising schedule allocate resources uniformly.<n>We introduce Surprise Forcing, a training-free framework that treats both limitations as online resource-allocation problems.<n> Experiments on VBench, VBench-Long, and VBench-2.0 show that the proposed allocation strategy improves long-horizon consistency and visual quality while retaining real-time streaming throughput.
  arXiv  Detail & Related papers  (2026-07-20T18:37:58Z)
• Show the Signal, Hide the Noise: Spectral Forcing for Pixel-Space Diffusion [46.51681899437508]
  We introduce Spectral Forcing, a parameter-free, time-conditional 2D-DCT low-pass operator applied to the noisy input before the patch embedder.<n>Its cutoff expands monotonically with the diffusion time and becomes the identity at the data endpoint.<n>On ImageNet-256 with JiT-700M/32, Spectral Forcing consistently improves both FID and Inception Score across different training epochs.
  arXiv  Detail & Related papers  (2026-06-13T10:29:11Z)
• CP Loss: Channel-wise Perceptual Loss for Time Series Forecasting [67.3477355449697]
  We propose a Channel-wise Perceptual Loss (CP Loss) for time-series data.<n>We learn a unique perceptual space for each channel that is adapted to its characteristics.<n>Loss is calculated within these perception spaces to optimize the model.
  arXiv  Detail & Related papers  (2026-01-25T15:31:37Z)
• PAS: A Training-Free Stabilizer for Temporal Encoding in Video LLMs [57.790910044227935]
  Video LLMs suffer from temporal inconsistency: small shifts in frame timing can flip attention and suppress relevant frames.<n>We present Phase Aggregated Smoothing (PAS), a training-free mechanism that applies small opposed phase offsets across heads and then aggregates their outputs.<n>Our analysis shows that the RoPE rotated logit can be approximated as a content dot product scaled by a time kernel; smoothing this kernel yields Lipschitz stability of attention to small temporal shifts; multi phase averaging attenuates high frequency ripples while preserving per-head spectra under Nyquist-valid sampling.
  arXiv  Detail & Related papers  (2025-11-14T05:56:47Z)
• Adaptive Estimation of Drifting Noise in Quantum Error Correction [1.1998722332188005]
  We present a framework to capture time-dependent Pauli noise, by exploiting the syndrome statistics of quantum error correction experiments.<n>We prove the noise-filtering behavior of sliding windows, linking window size to spectral cutoff frequencies, and provide an iterative algorithm that captures multiple drift frequencies.<n>Our window-based estimation methods and adaptive decoding offer new insights into noise spectroscopy and decoder optimization under drift.
  arXiv  Detail & Related papers  (2025-11-12T17:03:56Z)
• Average Contraction Coefficients of Quantum Channels [0.7366405857677227]
  We study how noise contracts distinguishability of typical' states, beyond the worst-case.<n>We find a family of moments of contraction for quantum divergences, which interpolate between the worst-case contraction coefficient of a channel and its average behavior.<n>We extend these phase-transition phenomena to random quantum circuits with unital noise.
  arXiv  Detail & Related papers  (2025-08-11T17:35:15Z)
• Sequential transmission at short times [0.0]
  We show that it is possible to transmit and preserve information at short time scales over an n-fold composition of quantum channels.<n>We derive an exact error bound for the infinite dimensional pure-loss channel believed to be the dominant source of noise in networks.
  arXiv  Detail & Related papers  (2025-06-12T01:48:59Z)
• Fast-tracking and disentangling of qubit noise fluctuations using minimal-data averaging and hierarchical discrete fluctuation auto-segmentation [1.6555820134813155]
  Qubit noise and fluctuations of the noise over time are key factors limiting performance of quantum computers.<n>Characterising them with high temporal resolution is challenging due to multiple overlapping processes such as discrete jumps and continuous drifts.<n>We develop a framework comprising a noise characterisation method with minimal measurements allowing high temporal resolution.<n>We show that on transmon qubits the method can track and disentangle qubit frequency fluctuations with temporal resolution of a few tens of milliseconds over hours.
  arXiv  Detail & Related papers  (2025-05-29T16:29:03Z)
• 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)
• Latent Class-Conditional Noise Model [54.56899309997246]
  We introduce a Latent Class-Conditional Noise model (LCCN) to parameterize the noise transition under a Bayesian framework. We then deduce a dynamic label regression method for LCCN, whose Gibbs sampler allows us efficiently infer the latent true labels. Our approach safeguards the stable update of the noise transition, which avoids previous arbitrarily tuning from a mini-batch of samples.
  arXiv  Detail & Related papers  (2023-02-19T15:24:37Z)
• Virtual distillation with noise dilution [0.0]
  Virtual distillation is an error-mitigation technique that reduces quantum-computation errors without assuming the noise type. We show that for a given overall error rate, the average mitigation performance improves monotonically as the noisy peripheral is split(diluted) into more layers. We propose an application of these findings in designing a quantum-computing cluster that houses realistic noisy intermediate-scale quantum circuits.
  arXiv  Detail & Related papers  (2022-10-26T14:34:58Z)

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.