Temporal Coarse Graining for Classical Stochastic Noise in Quantum Systems

• URL: http://arxiv.org/abs/2502.12296v1
• Date: Mon, 17 Feb 2025 20:09:18 GMT
• Title: Temporal Coarse Graining for Classical Stochastic Noise in Quantum Systems
• Abstract summary: We present an approach for simulating Hamiltonian classical noise that performs temporal coarse-graining.<n>We focus on the case where the noise can be expressed as a sum of Ornstein-Uhlenbeck processes.<n>For Ornstein-Uhlenbeck processes, the deterministic components capture all dependence on the coarse realization.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Simulations of quantum systems with Hamiltonian classical stochastic noise can be challenging when the noise exhibits temporal correlations over a multitude of time scales, such as for $1/f$ noise in solid-state quantum information processors. Here we present an approach for simulating Hamiltonian classical stochastic noise that performs temporal coarse-graining by effectively integrating out the high-frequency components of the noise. We focus on the case where the stochastic noise can be expressed as a sum of Ornstein-Uhlenbeck processes. Temporal coarse-graining is then achieved by conditioning the stochastic process on a coarse realization of the noise, expressing the conditioned stochastic process in terms of a sum of smooth, deterministic functions and bridge processes with boundaries fixed at zero, and performing the ensemble average over the bridge processes. For Ornstein-Uhlenbeck processes, the deterministic components capture all dependence on the coarse realization, and the stochastic bridge processes are not only independent but taken from the same distribution with correlators that can be expressed analytically, allowing the associated noise propagators to be precomputed once for all simulations. This combination of noise trajectories on a coarse time grid and ensemble averaging over bridge processes has practical advantages, such as a simple concatenation rule, that we highlight with numerical examples.

Related papers

• From Atoms to Entropy: Optimal Noise Allocation for Diffusion Training in the Convex Regime [52.459513910242485]
  We develop a general statistical framework for studying optimal noise-level allocation in diffusion training.<n>We show that the optimized training schedule admits an atomic minimizer, concentrated on finitely many noise levels.<n>We then evaluate the entropic schedule in larger-scale experiments, where full schedule optimization is currently intractable.
  arXiv  Detail & Related papers  (2026-07-10T20:59:06Z)
• Universal Characterization of Classical Qubit Noise [0.10923877073891443]
  We propose a general method to fully characterize a classical noise process causing qubit dephasing on the qubit.<n>Compared to filter-function-based spectroscopy, our method does not require complicated dynamical decoupling pulses.<n>We numerically demonstrate this method for characterizing two typical examples of classical noises, including the Ornstein-Uhlenbeck processes producing Gaussian noises and an ensemble of TLFs producing non-Gaussian noises.
  arXiv  Detail & Related papers  (2026-04-28T14:33:10Z)
• Classical simulation of a quantum circuit with noisy magic inputs [0.6287298138084187]
  We characterize how noise on magic resources changes the classical simulability of quantum circuits.<n>We adopt a resource-centric noise model in which only the injected magic components are noisy, while the baseline states, operations, and measurements belong to an efficiently simulable family.
  arXiv  Detail & Related papers  (2026-01-15T06:40:28Z)
• Classically Sampling Noisy Quantum Circuits in Quasi-Polynomial Time under Approximate Markovianity [0.616870773176256]
  We present a classical algorithm that runs in $nrmpolylog(n)$ time for simulating quantum circuits under local depolarizing noise.<n>Our results significantly extend the boundary of classical simulability and suggest that noise generically enforces approximate Markovianity and classical simulability.
  arXiv  Detail & Related papers  (2025-10-07T18:00:03Z)
• Classical simulation of noisy quantum circuits via locally entanglement-optimal unravelings [0.2796197251957244]
  We present a highly parallelizable tensor-network-based classical algorithm for simulating noisy quantum circuits.<n>Our algorithm represents the state of a noisy quantum system by a particular ensemble of matrix product states.
  arXiv  Detail & Related papers  (2025-08-07T18:00:20Z)
• Flow-Based Non-stationary Temporal Regime Causal Structure Learning [49.77103348208835]
  We introduce FANTOM, a unified framework for causal discovery.<n>It handles non stationary processes along with non Gaussian and heteroscedastic noises.<n>It simultaneously infers the number of regimes and their corresponding indices and learns each regime's Directed Acyclic Graph.
  arXiv  Detail & Related papers  (2025-06-20T15:12:43Z)
• Impact of Temporally Correlated Dephasing Noise on the Fidelity of the 2-Qubit Deutsch-Jozsa Algorithm [0.76146285961466]
  Noise in quantum systems often exhibits temporal correlations, leading to non-Markovian dynamics.<n>This paper investigates the impact of temporally correlated noise on the fidelity of the 2-qubit Deutsch-Jozsa algorithm.
  arXiv  Detail & Related papers  (2025-06-05T18:48:50Z)
• A polynomial-time classical algorithm for noisy quantum circuits [1.2708457954150887]
  We provide a-time classical algorithm for noisy quantum circuits. Our approach is based upon the intuition that noise exponentially damps non-local correlations. For constant noise rates, any quantum circuit for which error mitigation is efficient on most input states, is also classically simulable on most input states.
  arXiv  Detail & Related papers  (2024-07-17T17:48:39Z)
• 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)
• On classical simulation algorithms for noisy Boson Sampling [2.8655318786364408]
  We present a classical algorithm that approximately samples from the output distribution of certain noisy Boson Sampling experiments. This is inspired by a recent result of Aharonov, Gao, Landau, Liu and Vazirani and makes use of an observation originally due to Kalai Kindler.
  arXiv  Detail & Related papers  (2023-01-27T04:42:59Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Simple master equations for describing driven systems subject to classical non-Markovian noise [0.0]
  Driven quantum systems subject to non-Markovian noise are typically difficult to model even if the noise is classical. We present a systematic method for deriving a time-local master equation for such systems. We analyze in detail the highly relevant case of a Rabi-driven qubit subject to various kinds of non-Markovian noise.
  arXiv  Detail & Related papers  (2022-07-08T16:00:15Z)
• Characterizing low-frequency qubit noise [55.41644538483948]
  Fluctuations of the qubit frequencies are one of the major problems to overcome on the way to scalable quantum computers. The statistics of the fluctuations can be characterized by measuring the correlators of the outcomes of periodically repeated Ramsey measurements. This work suggests a method that allows describing qubit dynamics during repeated measurements in the presence of evolving noise.
  arXiv  Detail & Related papers  (2022-07-04T22:48:43Z)
• Learning based signal detection for MIMO systems with unknown noise statistics [84.02122699723536]
  This paper aims to devise a generalized maximum likelihood (ML) estimator to robustly detect signals with unknown noise statistics. In practice, there is little or even no statistical knowledge on the system noise, which in many cases is non-Gaussian, impulsive and not analyzable. Our framework is driven by an unsupervised learning approach, where only the noise samples are required.
  arXiv  Detail & Related papers  (2021-01-21T04:48:15Z)
• The Connection between Discrete- and Continuous-Time Descriptions of Gaussian Continuous Processes [60.35125735474386]
  We show that discretizations yielding consistent estimators have the property of invariance under coarse-graining' This result explains why combining differencing schemes for derivatives reconstruction and local-in-time inference approaches does not work for time series analysis of second or higher order differential equations.
  arXiv  Detail & Related papers  (2021-01-16T17:11:02Z)
• Dynamics of discrete-time quantum walk with time-correlated unitary noise [0.0]
  We investigate the dynamics of discrete-time quantum walk subject to time correlated noise. Two remarker behaviors of long time noisy dynamics are observed in numerical simulations. In fast noise regime, the walker is confined into few lattice sites, and the width of wave packet is much narrower compared with that in slow noise regime.
  arXiv  Detail & Related papers  (2020-11-20T10:23:46Z)
• Efficient classical simulation and benchmarking of quantum processes in the Weyl basis [0.0]
  We develop a randomized benchmarking algorithm which uses Weyl unitaries to efficiently identify and learn a mixture of error models. We apply our methods to ansatz circuits that appear in the Variational Quantum Eigensolver.
  arXiv  Detail & Related papers  (2020-08-27T16:46:12Z)
• Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clipping [69.9674326582747]
  We propose a new accelerated first-order method called clipped-SSTM for smooth convex optimization with heavy-tailed distributed noise in gradients. We prove new complexity that outperform state-of-the-art results in this case. We derive the first non-trivial high-probability complexity bounds for SGD with clipping without light-tails assumption on the noise.
  arXiv  Detail & Related papers  (2020-05-21T17:05:27Z)
• Efficiently Sampling Functions from Gaussian Process Posteriors [76.94808614373609]
  We propose an easy-to-use and general-purpose approach for fast posterior sampling. We demonstrate how decoupled sample paths accurately represent Gaussian process posteriors at a fraction of the usual cost.
  arXiv  Detail & Related papers  (2020-02-21T14:03:16Z)

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.