Error-Correction Transitions in Finite-Depth Quantum Channels
arXiv QuantumArchived Mar 24, 2026✓ Full text saved
arXiv:2603.20369v1 Announce Type: new Abstract: We study error correction type protocols in which a quantum channel encodes logical information into an enlarged Hilbert space. Specifically, we consider channels realized by one dimensional random noisy quantum circuits with spatially local interaction gates. We analyze both noise acting after the encoding and noise affecting the encoding circuit itself. Using the coherent information as a metric, we show that in both cases the infinite depth limi
Full text archived locally
✦ AI Summary· Claude Sonnet
Quantum Physics
[Submitted on 20 Mar 2026]
Error-Correction Transitions in Finite-Depth Quantum Channels
Arman Sauliere, Guglielmo Lami, Pedro Ribeiro, Andrea De Luca, Jacopo De Nardis
We study error correction type protocols in which a quantum channel encodes logical information into an enlarged Hilbert space. Specifically, we consider channels realized by one dimensional random noisy quantum circuits with spatially local interaction gates. We analyze both noise acting after the encoding and noise affecting the encoding circuit itself. Using the coherent information as a metric, we show that in both cases the infinite depth limit is governed by random matrix theory, which predicts a universal phase transition at a critical noise rate. This critical point separates an error correcting phase, in which encoded information is preserved, from a phase in which it is irretrievably lost. Going beyond the infinite depth limit, we characterize the systematic finite depth deviations from random matrix universality. In particular, we show that these deviations behave parametrically differently depending on whether the noise acts after the encoding or also affects the encoding itself. For noiseless encoders, the approach is exponential in circuit depth, although boundary effects can delay perfect encoding relative to the circuit design time. For noisy encoders, we find that the circuit fidelity effectively replaces the Hashing bound, and perfect encoding is approached polynomially with depth.
Subjects: Quantum Physics (quant-ph)
Cite as: arXiv:2603.20369 [quant-ph]
(or arXiv:2603.20369v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2603.20369
Focus to learn more
Submission history
From: Arman Sauliere [view email]
[v1] Fri, 20 Mar 2026 18:00:00 UTC (1,202 KB)
Access Paper:
view license
Current browse context:
quant-ph
< prev | next >
new | recent | 2026-03
References & Citations
INSPIRE HEP
NASA ADS
Google Scholar
Semantic Scholar
Export BibTeX Citation
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
Demos
Related Papers
About arXivLabs
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)