Quantum error correction from complexity in Brownian SYK

A bstract 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 ρ AB is the difference $$ {\mathcal{F}}_{\rho}\left(A:B\right)\equiv \textrm{Tr}\ {\rho}_{AB}^2-\textrm{Tr}\ {\rho}_A^2\ \textrm{Tr}\ {\rho}_B^2 $$ F ρ A : B ≡ Tr ρ AB 2 − Tr ρ A 2 Tr ρ B 2 . We show that when the encoding complexity is small, the mutual purity is O (1) for the erasure of a small number of qubits (i.e., the encoding is fragile). However, this quantity decays exponentially, becoming O (1/ N ) for O (log N ) encoding complexity. Further, at polynomial encoding complexity, the mutual purity saturates to a plateau of O ( e − N ). 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 A with sufficiently high encoding complexity is robustly protected against low-rank errors acting on A 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 A despite being encoded in it.

Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.