Towards Predictive Quantum Algorithmic Performance: Modeling Time-Correlated Noise at Scale

• URL: http://arxiv.org/abs/2603.04524v1
• Date: Wed, 04 Mar 2026 19:09:29 GMT
• Title: Towards Predictive Quantum Algorithmic Performance: Modeling Time-Correlated Noise at Scale
• Abstract summary: We quantify the effects of time-correlated noise on quantum algorithms and predict their performance at scale.<n>Our work paves the way for large-scale algorithmic simulations and performance prediction under hardware-relevant noise conditions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Combining tensor network techniques with quantum autoregressive moving average models, we quantify the effects of time-correlated noise on quantum algorithms and predict their performance at scale. As a paradigmatic test case, we examine the quantum Fourier transformation. Building on our first technical result, which shows how stochastic tensor network calculations capture frequency correlations, our second result is the revelation that infidelity exponents (scaling from diffuse, to superdiffuse) are determined by the spectral features of the noise. This numerical result rigorously quantifies the common belief that the temporal correlation scale is a key predictive feature of noise's deleterious impact on multi-qubit circuits. To highlight prospects for predicting algorithmic performance, our third result quantifies how infidelity scaling exponents -- which are fits determined by training data at moderate scales (40-80 qubits) -- can be used to predict more computationally expensive simulation at larger scales (100-128 qubits). Aside from highlighting the scalability of our methods, this workflow feeds into our last result, which is the proposal of predictive benchmarking protocols connecting simulations to experiments. Our work paves the way for large-scale algorithmic simulations and performance prediction under hardware-relevant noise conditions informed by realistic device characteristics.

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)
• Limitations of Error Model Approximations in Quantum Network Simulation [0.13999481573773073]
  We show how simple error models, such as Pauli twirling or reset channels, can lead to severe discrepancies in protocol performance predictions.<n>Results show that rigorous validation of complete noise architectures is indispensable for accurately predicting operational thresholds in future quantum technologies.
  arXiv  Detail & Related papers  (2026-07-01T14:35:26Z)
• Rethinking Quantum Noise in Quantum Machine Learning: When Noise Improves Learning [5.083987940956758]
  Quantum noise is conventionally viewed as a fundamental obstacle in near-term quantum computing.<n>We present numerical evidence that challenges this consensus.<n>Through experiments on quantum graph neural networks for molecular property prediction, we discover that quantum noise induces heterogeneous responses.
  arXiv  Detail & Related papers  (2026-01-19T18:21:35Z)
• Noise Hypernetworks: Amortizing Test-Time Compute in Diffusion Models [57.49136894315871]
  New paradigm of test-time scaling has yielded remarkable breakthroughs in reasoning models and generative vision models.<n>We propose one solution to the problem of integrating test-time scaling knowledge into a model during post-training.<n>We replace reward guided test-time noise optimization in diffusion models with a Noise Hypernetwork that modulates initial input noise.
  arXiv  Detail & Related papers  (2025-08-13T17:33:37Z)
• Computational Performance Bounds Prediction in Quantum Computing with Unstable Noise [6.6884244790434195]
  Noise in quantum devices poses significant barriers to realizing this supremacy.<n>Next-generation quantum-centric supercomputing essentially requires efficient and accurate noise characterization.<n>We propose a data-driven workflow, namely QuBound, to predict computational performance bounds.
  arXiv  Detail & Related papers  (2025-07-22T22:00:09Z)
• Approximation Methods for Simulation and Equivalence Checking of Noisy Quantum Circuits [3.2559508547981917]
  In the current NISQ era, simulating and verifying noisy quantum circuits is crucial.<n>This paper introduces an approximation algorithm for simulating and assessing the equivalence of noisy quantum circuits.
  arXiv  Detail & Related papers  (2025-03-13T13:19:30Z)
• Non-zero noise extrapolation: accurately simulating noisy quantum circuits with tensor networks [0.15749416770494704]
  We develop and test a method for significantly improving the accuracy of tensor network simulations of noisy quantum circuits.<n>Our method comes with the advantages that it (i.e. high gate-fidelity) is especially tailored to the low-noise regime.
  arXiv  Detail & Related papers  (2025-01-22T21:42:24Z)
• Inference-Time Scaling for Diffusion Models beyond Scaling Denoising Steps [48.16416920913577]
  We explore the inference-time scaling behavior of diffusion models beyond increasing denoising steps.<n>We consider a search problem aimed at identifying better noises for the diffusion sampling process.<n>Our findings reveal that increasing inference-time compute leads to substantial improvements in the quality of samples generated by diffusion models.
  arXiv  Detail & Related papers  (2025-01-16T18:30:37Z)
• Predicting Probabilities of Error to Combine Quantization and Early Exiting: QuEE [68.6018458996143]
  We propose a more general dynamic network that can combine both quantization and early exit dynamic network: QuEE. Our algorithm can be seen as a form of soft early exiting or input-dependent compression. The crucial factor of our approach is accurate prediction of the potential accuracy improvement achievable through further computation.
  arXiv  Detail & Related papers  (2024-06-20T15:25:13Z)
• Learning Unnormalized Statistical Models via Compositional Optimization [73.30514599338407]
  Noise-contrastive estimation(NCE) has been proposed by formulating the objective as the logistic loss of the real data and the artificial noise. In this paper, we study it a direct approach for optimizing the negative log-likelihood of unnormalized models.
  arXiv  Detail & Related papers  (2023-06-13T01:18:16Z)
• 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)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• 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)

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.