Quantum Error Correction from Complexity in Brownian SYK
arXiv:2301.07108 · doi:10.1007/JHEP08(2023)071
Abstract
We study the robustness of quantum error correction in a one-parameter ensemble of codes generated by the Brownian SYK model, where the parameter quantifies the encoding complexity. The robustness of error correction by a quantum code is upper bounded by the "mutual purity" of a certain entangled state between the code subspace and environment in the isometric extension of the error channel, where the mutual purity of a density matrix is the difference . We show that when the encoding complexity is small, the mutual purity is for the erasure of a small number of qubits (i.e., the encoding is fragile). However, this quantity decays exponentially, becoming for encoding complexity. Further, at polynomial encoding complexity, the mutual purity saturates to a plateau of . We also find a hierarchy of complexity scales associated to a tower of subleading contributions to the mutual purity that quantitatively, but not qualitatively, adjust our error correction bound as encoding complexity increases. In the AdS/CFT context, our results suggest that any portion of the entanglement wedge of a general boundary subregion with sufficiently high encoding complexity is robustly protected against low-rank errors acting on with no prior access to the encoding map. From the bulk point of view, we expect such bulk degrees of freedom to be causally inaccessible from the region despite being encoded in it.
40+14 pages, 8 figures
References in corpus (15)
- Correcting Quantum Errors with Entanglement
- Restrictions on Transversal Encoded Quantum Gate Sets
- Causality & holographic entanglement entropy
- Quantum chaos and the complexity of spread of states
- Information Transfer with a Gravitating Bath
- Inconsistency of Islands in Theories with Long-Range Gravity
- Linear growth of quantum circuit complexity
- Quantum minimal surfaces from quantum error correction
- A World without Pythons would be so Simple
- Complexity Growth in Integrable and Chaotic Models
- Subleading Weingartens
- Finding Pythons in Unexpected Places
- Near-optimal covariant quantum error-correcting codes from random unitaries with symmetries
- Quantum Error Correction in the Black Hole Interior
- Non-Isometric Quantum Error Correction in Gravity
Cited by in corpus (7)
- Quantum complexity in gravity, quantum field theory, and quantum information science
- Non-Stabilizerness of Sachdev-Ye-Kitaev Model
- Hayden-Preskill Recovery in Hamiltonian Systems
- Phase transitions in sampling and error correction in local Brownian circuits
- Efficient circular Dyson Brownian motion algorithm
- On the stabilizer complexity of Hawking radiation
- Unveiling Novel Insights in Quantum Dynamics through Extended Sachdev-Ye-Kitaev Model