Back to News
quantum-computing

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

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers combined tensor networks with quantum autoregressive models to quantify time-correlated noise impacts on quantum algorithms, demonstrating scalable performance predictions for hardware-relevant conditions. Their study reveals that noise spectral features directly determine infidelity scaling—from diffuse to superdiffuse—proving temporal correlations are critical in degrading multi-qubit circuits, validated through quantum Fourier transform simulations. Using moderate-scale data (40–80 qubits), the team trained models to predict infidelity exponents, accurately forecasting performance at larger scales (100–128 qubits) without costly simulations. The workflow bridges simulations and experiments via proposed predictive benchmarking protocols, enabling hardware-informed algorithm optimization before physical deployment. This advance paves the way for large-scale quantum algorithm simulations under realistic noise, accelerating practical quantum computing development.
Towards Predictive Quantum Algorithmic Performance: Modeling Time-Correlated Noise at Scale

Summarize this article with:

Quantum Physics arXiv:2603.04524 (quant-ph) [Submitted on 4 Mar 2026] Title:Towards Predictive Quantum Algorithmic Performance: Modeling Time-Correlated Noise at Scale Authors:Amit Jamadagni, Gregory Quiroz, Eugene Dumitrescu View a PDF of the paper titled Towards Predictive Quantum Algorithmic Performance: Modeling Time-Correlated Noise at Scale, by Amit Jamadagni and 2 other authors View PDF HTML (experimental) 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. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2603.04524 [quant-ph] (or arXiv:2603.04524v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2603.04524 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Amit Jamadagni [view email] [v1] Wed, 4 Mar 2026 19:09:29 UTC (1,301 KB) Full-text links: Access Paper: View a PDF of the paper titled Towards Predictive Quantum Algorithmic Performance: Modeling Time-Correlated Noise at Scale, by Amit Jamadagni and 2 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-03 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

government-funding
quantum-algorithms
quantum-hardware

Source Information

Source: arXiv Quantum Physics