Skip to content
DraconiticResearch
Search Sources API
201,818 studies31 sourcesUpdated 32 min ago
PreprintarXiv licencearXiv

The Fundamental Memory Ceiling of Noisy Quantum Reservoirs

  • Markus Baumann
  • Jonas Stein
  • Claudia Linnhoff-Popien
Open at sourcePDFDOICite

Abstract

Fresh qubits, not size, set how long a noisy quantum system can remember. With k input qubits reinitialized per time step, the longest memory any reservoir can attain under depolarizing noise is exp[Θ(k)] time steps, whatever its size, dynamics, and input encoding. A universal upper bound and an explicit reservoir that attains the exponential scaling establish this optimal resource law. The bound depends on the dynamics only through the entropy that fresh qubits remove per time step, so it holds for any Markovian noisy dynamics without feedback, including measurement-free error correction.

Related

  1. Fundamental Physics at the Frontier of Noisy Quantum Computation
    Nikita A. Zemlevskiy
    arXivPreprintarXiv licenceFull textHigh-energy & particle physicsNuclear physicsarXiv
  2. From quantum reservoirs to quantum extreme learning machines through a nearest-neighbor spin chain with tunable quantum memory
    Carlos Ramon-Escandell, Arnau Riera, Marcin Płodzień
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  3. Fundamental limits to identifying node and tie memory in temporal networks: marginal artefacts and spreading dynamics
    Michele Tizzani
    Physical Review ResearchPeer-reviewedCC BY 4.0Atomic, molecular & optical physicsCrossref
  4. Accelerating noisy variational quantum algorithms with physics-informed denoising networks
    Jie Liu, Xin Wang
    Physical Review ResearchPeer-reviewedPublisher termsAtomic, molecular & optical physicsCrossref
  5. When Can Quantum Extreme Learning Machines Replace Quantum Reservoirs?
    Markus Baumann, Gerhard Stenzel, Jonas Stein +1
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv

Cite

BibTeXRIS
BibTeX
@misc{baumann2026fundamental,
  title = {{The Fundamental Memory Ceiling of Noisy Quantum Reservoirs}},
  author = {Markus Baumann and Jonas Stein and Claudia Linnhoff-Popien},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.26228},
  eprint = {2610.26228},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.26228},
}
RIS
TY  - UNPB
TI  - The Fundamental Memory Ceiling of Noisy Quantum Reservoirs
AU  - Markus Baumann
AU  - Jonas Stein
AU  - Claudia Linnhoff-Popien
PY  - 2026
DA  - 2026/10/19
PB  - arXiv
DO  - 10.48550/arxiv.2610.26228
UR  - https://arxiv.org/abs/2610.26228
AB  - Fresh qubits, not size, set how long a noisy quantum system can remember. With k input qubits reinitialized per time step, the longest memory any reservoir can attain under depolarizing noise is exp[Θ(k)] time steps, whatever its size, dynamics, and input encoding. A universal upper bound and an explicit reservoir that attains the exponential scaling establish this optimal resource law. The bound depends on the dynamics only through the entropy that fresh qubits remove per time step, so it holds for any Markovian noisy dynamics without feedback, including measurement-free error correction.
ER  -