Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2605.30026

On the question of noise as a resource in quantum computing

J. Montes, F. Borondo, Gabriel G. Carlo

quant-phSubmitted May 28, 2026• Announced May 29, 2026• 0 citations
arXivHTMLPDF

Abstract

Noise is usually regarded as the main obstacle to achieving a scalable quantum advantage, but recent evidence in quantum reservoir computing [L. Domingo, F. Borondo, and G. G. Carlo. Taking advantage of noise in quantum reservoir computing, Scientific Reports, 13:8790, 2023] suggests that certain channels can, in appropriate regimes, improve performance by enriching the reservoir's effective dynamics. Motivated by this idea we propose a geometric mechanism to explain how non-unital noise applied together with a universal gate set leads to a faster approach to Haar-like distributions of the final states. We find that noise of this kind induces an effective volume expansion on the manifold of pure states. In order to intuitively understand this we use a minimal 1 qubit model where we take the amplitude damping channel and combine it with a renormalization rule that associates to each resulting mixed state a representative pure state. This composition defines a globally expanding nonlinear map on the space of pure states. We analytically derive the local area expansion factor and identify the global expansion threshold. Finally, we combine amplitude damping with the G3 = {H, T, CNOT} universal gate set to show how the approach to Haar-like behavior is faster in an appropriate parameter region. This leads us to propose noise as a possible resource in future quantum algorithms.

Comments
12 pages, 5 figures

Related papers

Noise-Induced Thermalization in Quantum Systems

Sameer Dambal, Yu Zhang, Eric R Bittner +1 more

In the current Noisy Intermediate-Scale Quantum era, noise is widely regarded as the primary obstacle to achieving fault-tolerant quantum computation. However, certain stages of the quantum computing pipeline can, in fact, benefit from this noise. In this work, we exploit the Eigenstate Thermalization Hypothesis to show that noise generically accelerates a fundamental task in quantum computing -- the preparation of Gibbs states. We demonstrate this behavior using classical and quantum simulations with Haar-random and phase-flip noise, respectively, on a spin-1/2 chain with a local Hamiltonian. Our non-integrable model sees ~3.5x faster thermalization in the presence of noise, while our integrable model, which would not otherwise thermalize, reaches a thermal state due to noise. Since certifying a local Gibbs state is relatively easy on a quantum computer, our approach provides a new practical solution to a key problem in quantum computing. More broadly, these results establish a new paradigm in which noise can be harnessed on quantum computers, enabling practical advantages before the years of fault-tolerance.

quant-pharXiv:2512.14842•New Journal of Physics•Dec 18, 2025•3 citations

Taking advantage of noise in quantum reservoir computing

Laia Domingo, Gabriel G. Carlo, F. Borondo

The biggest challenge that quantum computing and quantum machine learning are currently facing is the presence of noise in quantum devices. As a result, big efforts have been put into correcting or mitigating the induced errors. But, can these two fields benefit from noise? Surprisingly, we demonstrate that under some circumstances, quantum noise can be used to improve the performance of quantum reservoir computing, a prominent and recent quantum machine learning algorithm. Our results show that the amplitude damping noise can be beneficial to machine learning, while the depolarizing and phase damping noises should be prioritized for correction. This critical result sheds new light into the physical mechanisms underlying quantum devices, providing solid practical prescriptions for a successful implementation of quantum information processing in nowadays hardware.

arXiv:2301.06814•Scientific Reports•May 31, 2023•70 citations

Non-unital noise in a superconducting quantum computer as a computational resource for reservoir computing

Monzani, Francesco, Ricci, Emanuele, Nigro, Luca +1 more

We identify a noise model that ensures the functioning of an echo state network employing a gate-based quantum computer for reservoir computing applications. Energy dissipation induced by amplitude damping drastically improves the short-term memory capacity and expressivity of the network, by simultaneously providing fading memory and richer dynamics. There is an ideal dissipation rate that ensures the best operation of the echo state network around $γ\sim$ 0.03. Nevertheless, these beneficial effects are stable as the intensity of the applied noise increases. The improvement of the learning is confirmed by emulating a realistic noise model applied to superconducting qubits, paving the way for the application of reservoir computing methods in current non-fault-tolerant quantum computers.

arXiv:2409.07886•Sep 12, 2024•20 citations

Noise as Geometry, Dissipation as Resource: How Quantum Phase Slips, Programmable Decoherence, and Thermodynamic Precision Constraints Reveal a Unified Role for Fluctuations in Quantum Dynamics

Saluca Agentic AI Research Team

A persistent assumption in quantum information and quantum thermodynamics holds that noise and dissipation are adversaries to be suppressed. A candidate reading of several recent preprints across quant-ph and cond-mat.stat-mech suggests a more structured picture: fluctuations — quantum phase slips, engineered logical decoherence, and thermodynamic irreversibility — occupy a spectrum from obstacle to resource, and the position on that spectrum is governed by identifiable geometric and thermodynamic mechanisms rather than by the magnitude of the noise alone. This synthesis draws on six to seven findings: the Keldysh path-integral analysis of quantum synchronization breakdown via phase-slip proliferation [corpus:arxiv:2605.30302]; the companion result on Fock-state limit cycles where phase slips decay exponentially and synchronization is achievable [corpus:arxiv:2605.30271]; the programmable-dissipation framework that repurposes fault-tolerant error correction to sculpt target open-system dynamics [corpus:arxiv:2605.30217]; a geometric argument that non-unital noise expands the manifold of reachable pure states, accelerating approach to Haar-like distributions [corpus:arxiv:2605.30026]; the universal thermokinetic decomposition showing that dissipation suppresses fluctuations of predictability rather than enhancing mean predictability at short times [corpus:arxiv:2605.29957]; and the non-linear spin-noise scaling in warm atomic vapors that reveals many-body correlations through a quadratic density dependence [corpus:arxiv:2605.31262]. A weakly connected addendum discusses the improved Lindbladian simulation sample-complexity bounds [corpus:arxiv:2605.30301] as a computational analogue of the same resource-vs-overhead tension. The synthesis is a heuristic reading, not a derivation: the sources share vocabulary and structural analogies but do not share a single formal framework. The central falsification path is: if non-unital noise channels can be shown to *not* accelerate convergence to Haar-like distributions in systems where phase-slip rates are independently controlled, the geometric expansion argument fails. --- Authorship: Saluca Agentic AI Research Team (Saluca LLC). AI-drafted from arXiv preprint corpus on the date in the filename. Cited arXiv preprints: 2605.29957, 2605.30026, 2605.30139, 2605.30217, 2605.30271, 2605.30301, 2605.30302, 2605.31262, 2605.31544

•Jun 4, 2026•0 citations

Quantum reservoir computing induced by controllable damping

Emanuele Ricci, Francesco Monzani, Luca Nigro +1 more

Quantum reservoir computing has emerged as a promising machine learning paradigm for processing temporal data on near-term quantum devices, as it exploits the large computational capacity of qubits without suffering from typical issues arising when training variational quantum circuits. In particular, quantum gate-based echo state networks have proven effective when the evolution of the reservoir circuit is non-unital. Nonetheless, a method for ensuring a tunable and stable non-unital circuit evolution was lacking. We propose an algorithm that induces damping by applying a controlled rotation to each qubit in the reservoir. It enables tunable, circuit-level amplitude amplification of the zero state, maintaining the system away from the maximally mixed state and preventing information loss caused by repeated mid-circuit measurements. The algorithm is inherently stable over time, as it can process arbitrarily long input sequences, beyond the coherence time of individual qubits, by inducing arbitrary damping on each qubit. Moreover, we show that quantum correlations between qubits improve memory retention, underscoring the potential utility of a quantum system as a computational reservoir. We demonstrate, through standard reservoir computing benchmarks, that this algorithm enables robust and scalable quantum random computing on fault-tolerant quantum hardware.

arXiv:2508.14621•npj Quantum Information•Apr 17, 2026•5 citations

Dissipation as a resource for Quantum Reservoir Computing

Antonio Sannia, Rodrigo Martínez‐Peña, Miguel C. Soriano +2 more

Dissipation induced by interactions with an external environment typically hinders the performance of quantum computation, but in some cases can be turned out as a useful resource. We show the potential enhancement induced by dissipation in the field of quantum reservoir computing introducing tunable local losses in spin network models. Our approach based on continuous dissipation is able not only to reproduce the dynamics of previous proposals of quantum reservoir computing, based on discontinuous erasing maps but also to enhance their performance. Control of the damping rates is shown to boost popular machine learning temporal tasks as the capability to linearly and non-linearly process the input history and to forecast chaotic series. Finally, we formally prove that, under non-restrictive conditions, our dissipative models form a universal class for reservoir computing. It means that considering our approach, it is possible to approximate any fading memory map with arbitrary precision.

arXiv:2212.12078•Quantum•Mar 20, 2024•67 citations
Noise is usually regarded as the main obstacle to achieving a scalable quantum advantage, but recent evidence in quantum reservoir computing [L. Domingo, F. Borondo, and G. G. Carlo. Taking advantage of noise in quantum reservoir computing, Scientific Reports, 13:8790, 2023] suggests that certain channels can, in appropriate regimes, improve performance by enriching the reservoir's effective dynamics. Motivated by this idea we propose a geometric mechanism to explain how non-unital noise applied together with a universal gate set leads to a faster approach to Haar-like distributions of the final states. We find that noise of this kind induces an effective volume expansion on the manifold of pure states. In order to intuitively understand this we use a minimal 1 qubit model where we take the amplitude damping channel and combine it with a renormalization rule that associates to each resulting mixed state a representative pure state. This composition defines a globally expanding nonlinear map on the space of pure states. We analytically derive the local area expansion factor and identify the global expansion threshold. Finally, we combine amplitude damping with the G3 = {H, T, CNOT} universal gate set to show how the approach to Haar-like behavior is faster in an appropriate parameter region. This leads us to propose noise as a possible resource in future quantum algorithms.
In the current Noisy Intermediate-Scale Quantum era, noise is widely regarded as the primary obstacle to achieving fault-tolerant quantum computation. However, certain stages of the quantum computing pipeline can, in fact, benefit from this noise. In this work, we exploit the Eigenstate Thermalization Hypothesis to show that noise generically accelerates a fundamental task in quantum computing -- the preparation of Gibbs states. We demonstrate this behavior using classical and quantum simulations with Haar-random and phase-flip noise, respectively, on a spin-1/2 chain with a local Hamiltonian. Our non-integrable model sees ~3.5x faster thermalization in the presence of noise, while our integrable model, which would not otherwise thermalize, reaches a thermal state due to noise. Since certifying a local Gibbs state is relatively easy on a quantum computer, our approach provides a new practical solution to a key problem in quantum computing. More broadly, these results establish a new paradigm in which noise can be harnessed on quantum computers, enabling practical advantages before the years of fault-tolerance.
The biggest challenge that quantum computing and quantum machine learning are currently facing is the presence of noise in quantum devices. As a result, big efforts have been put into correcting or mitigating the induced errors. But, can these two fields benefit from noise? Surprisingly, we demonstrate that under some circumstances, quantum noise can be used to improve the performance of quantum reservoir computing, a prominent and recent quantum machine learning algorithm. Our results show that the amplitude damping noise can be beneficial to machine learning, while the depolarizing and phase damping noises should be prioritized for correction. This critical result sheds new light into the physical mechanisms underlying quantum devices, providing solid practical prescriptions for a successful implementation of quantum information processing in nowadays hardware.
We identify a noise model that ensures the functioning of an echo state network employing a gate-based quantum computer for reservoir computing applications. Energy dissipation induced by amplitude damping drastically improves the short-term memory capacity and expressivity of the network, by simultaneously providing fading memory and richer dynamics. There is an ideal dissipation rate that ensures the best operation of the echo state network around γ∼γ\simγ∼ 0.03. Nevertheless, these beneficial effects are stable as the intensity of the applied noise increases. The improvement of the learning is confirmed by emulating a realistic noise model applied to superconducting qubits, paving the way for the application of reservoir computing methods in current non-fault-tolerant quantum computers.
A persistent assumption in quantum information and quantum thermodynamics holds that noise and dissipation are adversaries to be suppressed. A candidate reading of several recent preprints across quant-ph and cond-mat.stat-mech suggests a more structured picture: fluctuations — quantum phase slips, engineered logical decoherence, and thermodynamic irreversibility — occupy a spectrum from obstacle to resource, and the position on that spectrum is governed by identifiable geometric and thermodynamic mechanisms rather than by the magnitude of the noise alone. This synthesis draws on six to seven findings: the Keldysh path-integral analysis of quantum synchronization breakdown via phase-slip proliferation [corpus:arxiv:2605.30302]; the companion result on Fock-state limit cycles where phase slips decay exponentially and synchronization is achievable [corpus:arxiv:2605.30271]; the programmable-dissipation framework that repurposes fault-tolerant error correction to sculpt target open-system dynamics [corpus:arxiv:2605.30217]; a geometric argument that non-unital noise expands the manifold of reachable pure states, accelerating approach to Haar-like distributions [corpus:arxiv:2605.30026]; the universal thermokinetic decomposition showing that dissipation suppresses fluctuations of predictability rather than enhancing mean predictability at short times [corpus:arxiv:2605.29957]; and the non-linear spin-noise scaling in warm atomic vapors that reveals many-body correlations through a quadratic density dependence [corpus:arxiv:2605.31262]. A weakly connected addendum discusses the improved Lindbladian simulation sample-complexity bounds [corpus:arxiv:2605.30301] as a computational analogue of the same resource-vs-overhead tension. The synthesis is a heuristic reading, not a derivation: the sources share vocabulary and structural analogies but do not share a single formal framework. The central falsification path is: if non-unital noise channels can be shown to *not* accelerate convergence to Haar-like distributions in systems where phase-slip rates are independently controlled, the geometric expansion argument fails. --- Authorship: Saluca Agentic AI Research Team (Saluca LLC). AI-drafted from arXiv preprint corpus on the date in the filename. Cited arXiv preprints: 2605.29957, 2605.30026, 2605.30139, 2605.30217, 2605.30271, 2605.30301, 2605.30302, 2605.31262, 2605.31544
Quantum reservoir computing has emerged as a promising machine learning paradigm for processing temporal data on near-term quantum devices, as it exploits the large computational capacity of qubits without suffering from typical issues arising when training variational quantum circuits. In particular, quantum gate-based echo state networks have proven effective when the evolution of the reservoir circuit is non-unital. Nonetheless, a method for ensuring a tunable and stable non-unital circuit evolution was lacking. We propose an algorithm that induces damping by applying a controlled rotation to each qubit in the reservoir. It enables tunable, circuit-level amplitude amplification of the zero state, maintaining the system away from the maximally mixed state and preventing information loss caused by repeated mid-circuit measurements. The algorithm is inherently stable over time, as it can process arbitrarily long input sequences, beyond the coherence time of individual qubits, by inducing arbitrary damping on each qubit. Moreover, we show that quantum correlations between qubits improve memory retention, underscoring the potential utility of a quantum system as a computational reservoir. We demonstrate, through standard reservoir computing benchmarks, that this algorithm enables robust and scalable quantum random computing on fault-tolerant quantum hardware.
Dissipation induced by interactions with an external environment typically hinders the performance of quantum computation, but in some cases can be turned out as a useful resource. We show the potential enhancement induced by dissipation in the field of quantum reservoir computing introducing tunable local losses in spin network models. Our approach based on continuous dissipation is able not only to reproduce the dynamics of previous proposals of quantum reservoir computing, based on discontinuous erasing maps but also to enhance their performance. Control of the damping rates is shown to boost popular machine learning temporal tasks as the capability to linearly and non-linearly process the input history and to forecast chaotic series. Finally, we formally prove that, under non-restrictive conditions, our dissipative models form a universal class for reservoir computing. It means that considering our approach, it is possible to approximate any fading memory map with arbitrary precision.