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

Topological Complexity Revivals in M\"obius-MERA Quantum Error-Correcting Codes

Sungwoo Kang

Published Mar 7, 2026• 0 citations
Publisher

Abstract

Companion studies showed that engineered code geometry constrains Krylov complexity~\cite{kang2025codespace} and that natural Hamiltonian subspaces exhibit approximate quantum error correction~\cite{kang2025natural}, but both used open boundary conditions with no topological feedback.Here we construct a scale-periodic ``M\"obius-MERA'' by threading a crosscap twist through the infrared end of a holographic MERA tensor network, creating a non-orientable loop in the renormalization-group scale direction.We extract code subspaces and measure codeness, Krylov complexity, and error annihilation at $N=8$ and $16$ physical qubits.M\"obius codes achieve $61\%$ higher codeness than standard MERA ($0.235$ vs.\ $0.146$); constrained Krylov complexity shows periodic revivals (amplitude ${\sim}\,1.8$, period ${\sim}\,11$) absent in standard MERA; transfer matrix eigenvalues $\{1, \pm i\}$ on the unit circle set the revival period; and ${\sim}\,62\%$ of weight-1 errors approximately satisfy the Knill-Laflamme conditions.Partial correlations controlling for system size confirm a codeness--revival amplitude link at $r=0.87$.Topological feedback in the renormalization-group direction creates approximate quantum error correction and periodic complexity dynamics, connecting holographic tensor network geometry to observable dynamical signatures.

DOI
10.5281/zenodo.18897552

Related papers

Approximate Quantum Error Correction in Natural Subspaces:Evidence for Code Structure as a Physical Attractor

Sungwoo Kang

Previous work showed that the geometry of engineered quantum error-correcting codes constrains Krylov complexity dynamics~\cite{kang2025codespace}.Here we ask whether low-energy subspaces of \emph{physical} Hamiltonians spontaneously satisfy the Knill-Laflamme conditions for approximate quantum error correction.We extract two-dimensional code subspaces from the lowest eigenstates of five model families---clean and disordered Ising, Heisenberg, XXZ, and SYK$_4$---across 825 instances with $n=4$--$12$ qubits and measure a continuous ``codeness'' derived from the Knill-Laflamme discrepancy.No subspace achieves exact error correction ($d_\mathrm{eff}=1$ universally), but continuous codeness varies substantially: SYK$_4$ averages $0.32$ while disordered Ising averages $0.09$.Raw correlations between codeness and Krylov complexity (e.g., $r=0.61$ with saturation value) are largely confounded by system size ($n\leftrightarrow\text{saturation}$: $r=0.91$).Partial correlations controlling for $n$ reveal the genuine structure: Knill-Laflamme discrepancy survives as a predictor of full-space dynamics ($r=-0.18$, $p<10^{-7}$), codeness constrains within-subspace complexity ($r=-0.21$, $p<10^{-9}$), and a suppressed energy gap$\leftrightarrow$Krylov dimension correlation emerges ($r=+0.28$, $p<10^{-16}$).Codeness also tracks quantum phase transitions in the Ising model.These results suggest that approximate quantum error correction is a physical attractor of interacting quantum systems, not merely an artifact of stabilizer engineering.

•Mar 7, 2026•0 citations

Learning Holographic Quantum Codes:Code Geometry Constrains Krylov Complexity Dynamics

Sungwoo Kang

Quantum error-correcting codes underpin models of holographic spacetime, yet the relationship between code geometry and complexity dynamics remains unexplored. We present a unified machine learning framework that (i)~encodes stabilizer code structure via a hypergraph GNN achieving distance prediction MAE of~$0.10$, (ii)~predicts Krylov complexity trajectories with a DeepONet conditioned on GNN-derived code embeddings ($R^2 = 0.67$ vs.\ $R^2 = -10$ without), and (iii)~reveals that code geometry constrains complexity dynamics through partial correlation analysis (distance$\to$max complexity: $r_{\mathrm{partial}} = -0.60$, $p = 5.1 \times 10^{-65}$). Our key insight is that code-space projections $P = \prod_i (I + g_i)/2$ act as a dynamical filter: they mathematically annihilate operator branches that anti-commute with any stabilizer, effectively pruning the Krylov tree and making complexity growth sensitive to the code's geometric distance. We validate robustness across XXZ and random Hamiltonians while identifying that Ising symmetry decouples geometry from dynamics---a physically interpretable null result. Across 661 stabilizer codes ($n \leq 12$), within-size correlations confirm that the geometry--complexity link persists after controlling for system size and \emph{strengthens} at larger $n$ (reaching $r = -0.91$ at $n=12$). Multi-seed averaging over 10 Haar-random projections per code confirms that $99.8\%$ of trajectory variance is between-code (structural), with seed-averaged correlations strengthening to $r_{\mathrm{partial}} = -0.70$, providing computational evidence for holographic intuitions connecting code distance to constrained Krylov evolution.

•Mar 7, 2026•0 citations

Multiscale Entanglement Renormalization Ansatz: Causality and Error Correction

Domenico Pomarico

Computational complexity reduction is at the basis of a new formulation of many-body quantum states according to tensor network ansatz, originally framed in one-dimensional lattices. In order to include long-range entanglement characterizing phase transitions, the multiscale entanglement renormalization ansatz (MERA) defines a sequence of coarse-grained lattices, obtained by targeting the map of a scale-invariant system into an identical coarse-grained one. The quantum circuit associated with this hierarchical structure includes the definition of causal relations and unitary extensions, leading to the definition of ground subspaces as stabilizer codes. The emerging error correcting codes are referred to logical indices located at the highest hierarchical level and to physical indices yielded by redundancy, framed in the AdS-CFT correspondence as holographic quantum codes with bulk and boundary indices, respectively. In a use-case scenario based on errors consisting of spin erasure, the correction is implemented as the reconstruction of a bulk local operator.

Dynamics•Sep 18, 2023•6 citations

Inverse Holographic Design: Generating Quantum Error-Correcting Codes from Target Krylov Complexity Trajectories

Sungwoo Kang

Recent work has established that quantum error-correcting code geometry constrains Krylov complexity dynamics: a forward pipeline mapping stabilizer codes through GNN embeddings and DeepONet predictions to complexity trajectories $C_K(t)$.We invert this pipeline: given a \emph{target} complexity trajectory $C_K^{\mathrm{target}}(t)$, we generate stabilizer codes whose actual dynamics match the target.Our three-stage approach combines (i)~gradient-based embedding optimization through a frozen DeepONet to find the 128-dimensional code embedding that best reproduces the target trajectory, (ii)~a Transformer-based Graph VAE decoder with Gumbel-Softmax discretization and physics-informed losses (commutativity, overlap penalty, minimum weight) that maps embeddings to stabilizer code structures, and (iii)~a commutativity repair and validation pipeline with distance-aware filtering.Across six target trajectories spanning Lloyd-bound saturation, power-law growth, and linear-then-saturate profiles, our method achieves 87\% code validity, mean trajectory correlation $\bar{\rho} = +0.701$, best single-code correlation $+0.995$, and 100\% of generated codes with distance $d \geq 2$.Ablation studies confirm that each component---overlap penalty, multi-strategy repair, distance filtering, and canonical code injection---contributes to the final performance.This work demonstrates the first \emph{inverse holographic design} pipeline: specifying desired dynamical behavior and automatically generating the quantum code that realizes it, opening pathways toward complexity-aware quantum code engineering.

•Mar 7, 2026•0 citations

Approximate Bacon-Shor code and holography

ChunJun Cao

We explicitly construct a class of holographic quantum error correction codes with non-trivial centers in the code subalgebra. Specifically, we use the Bacon-Shor codes and perfect tensors to construct a gauge code (or a stabilizer code with gauge-fixing), which we call the holographic hybrid code. This code admits a local log-depth encoding/decoding circuit, and can be represented as a holographic tensor network which satisfies an analog of the Ryu-Takayanagi formula and reproduces features of the sub-region duality. We then construct approximate versions of the holographic hybrid codes by “skewing” the code subspace, where the size of skewing is analogous to the size of the gravitational constant in holography. These approximate hybrid codes are not necessarily stabilizer codes, but they can be expressed as the superposition of holographic tensor networks that are stabilizer codes. For such constructions, different logical states, representing different bulk matter content, can “back-react” on the emergent geometry, resembling a key feature of gravity. The locality of the bulk degrees of freedom becomes subspace-dependent and approximate. Such subspace-dependence is manifest from the point of view of the “entanglement wedge” and bulk operator reconstruction from the boundary. Exact complementary error correction breaks down for certain bipartition of the boundary degrees of freedom; however, a limited, state-dependent form is preserved for particular subspaces. We also construct an example where the connected two-point correlation functions can have a power-law decay. Coupled with known constraints from holography, a weakly back-reacting bulk also forces these skewed tensor network models to the “large N limit” where they are built by concatenating a large N number of copies.

•Jul 10, 2023•21 citations

Holographic Entanglement Renormalization of the AME(4,6) String-Net Model: Emergent Geometry, Topological Hierarchy, and Brown-Henneaux Gravity

Adam Bazih

Specific corrections (Nov 2026): the 15-digit self-similarity is the identity eig(T^n) = lambda^n; alpha = 4.00 from a single size was superseded (about 2.49, then about ln 8 in 10.5281/zenodo.19673513); G_3 values are lattice renamings; L_x = 10 was fitted. [NOTE, June 2026: This paper is part of the AME(4,6)/TOE series whose headline claims were partially retracted. In particular the "zero free parameters" framing and several numerical predictions are withdrawn; see the Status Note at DOI 10.5281/zenodo.20618848 and the maintained mathematics at DOI 10.5281/zenodo.20128951. The text below is unchanged and remains as the record of the programme's history.] We perform a seven-part holographic analysis of the SU(3)_3 ⊗ SU(2)_2 string-net model associated with the AME(4,6) quantum error-correcting code. The transfer matrix is reinterpreted as a discrete renormalization group (RG) operator, and its iterated action is studied as a proxy for the MERA tensor network that defines an emergent holographic bulk. Key results: (1) Perfect conformal self-similarity — gap ratios preserved to 15 significant digits through 5 RG steps; (2) WZW tower matching — entanglement spectrum matches (0,0)⊗σ primary at h=3/16 exactly (Δh=0.0000); (3) Entanglement temperature β_ent = 2.380; (4) N-layer stacking shows exponential RG convergence (gapped system); (5) Topological hierarchy: ξ_topo/ξ = 5171 at Lx=2, scaling as exp(4·Lx), giving ~10^17 at Lx=10 — matching the Planck-electroweak ratio M_Pl/v; (6) Brown-Henneaux G₃ = 0.156 lattice units from c=11/2, L_AdS=ξ=0.572; (7) Stress tensor candidates at h≈1.81 (9.5% below h=2, finite-size at Lx=2). The topological hierarchy mechanism is the most provocative result: an O(1) topological constant (α≈4) combined with modest system size (Lx≈10) generates the 16 orders of magnitude separating v from M_Pl, without fine-tuning.

•Apr 21, 2026•0 citations
Companion studies showed that engineered code geometry constrains Krylov complexity~\cite{kang2025codespace} and that natural Hamiltonian subspaces exhibit approximate quantum error correction~\cite{kang2025natural}, but both used open boundary conditions with no topological feedback.Here we construct a scale-periodic ``M"obius-MERA'' by threading a crosscap twist through the infrared end of a holographic MERA tensor network, creating a non-orientable loop in the renormalization-group scale direction.We extract code subspaces and measure codeness, Krylov complexity, and error annihilation at N=8N=8N=8 and 161616 physical qubits.M"obius codes achieve 61%61\%61% higher codeness than standard MERA (0.2350.2350.235 vs.\ 0.1460.1460.146); constrained Krylov complexity shows periodic revivals (amplitude ∼ 1.8{\sim}\,1.8∼1.8, period ∼ 11{\sim}\,11∼11) absent in standard MERA; transfer matrix eigenvalues {1,±i}\{1, \pm i\}{1,±i} on the unit circle set the revival period; and ∼ 62%{\sim}\,62\%∼62% of weight-1 errors approximately satisfy the Knill-Laflamme conditions.Partial correlations controlling for system size confirm a codeness--revival amplitude link at r=0.87r=0.87r=0.87.Topological feedback in the renormalization-group direction creates approximate quantum error correction and periodic complexity dynamics, connecting holographic tensor network geometry to observable dynamical signatures.
Previous work showed that the geometry of engineered quantum error-correcting codes constrains Krylov complexity dynamics~\cite{kang2025codespace}.Here we ask whether low-energy subspaces of \emph{physical} Hamiltonians spontaneously satisfy the Knill-Laflamme conditions for approximate quantum error correction.We extract two-dimensional code subspaces from the lowest eigenstates of five model families---clean and disordered Ising, Heisenberg, XXZ, and SYK4_44​---across 825 instances with n=4n=4n=4--121212 qubits and measure a continuous ``codeness'' derived from the Knill-Laflamme discrepancy.No subspace achieves exact error correction (deff=1d_\mathrm{eff}=1deff​=1 universally), but continuous codeness varies substantially: SYK4_44​ averages 0.320.320.32 while disordered Ising averages 0.090.090.09.Raw correlations between codeness and Krylov complexity (e.g., r=0.61r=0.61r=0.61 with saturation value) are largely confounded by system size (n↔saturationn\leftrightarrow\text{saturation}n↔saturation: r=0.91r=0.91r=0.91).Partial correlations controlling for nnn reveal the genuine structure: Knill-Laflamme discrepancy survives as a predictor of full-space dynamics (r=−0.18r=-0.18r=−0.18, p<10−7p<10^{-7}p<10−7), codeness constrains within-subspace complexity (r=−0.21r=-0.21r=−0.21, p<10−9p<10^{-9}p<10−9), and a suppressed energy gap↔\leftrightarrow↔Krylov dimension correlation emerges (r=+0.28r=+0.28r=+0.28, p<10−16p<10^{-16}p<10−16).Codeness also tracks quantum phase transitions in the Ising model.These results suggest that approximate quantum error correction is a physical attractor of interacting quantum systems, not merely an artifact of stabilizer engineering.
Quantum error-correcting codes underpin models of holographic spacetime, yet the relationship between code geometry and complexity dynamics remains unexplored. We present a unified machine learning framework that (i)~encodes stabilizer code structure via a hypergraph GNN achieving distance prediction MAE of~0.100.100.10, (ii)~predicts Krylov complexity trajectories with a DeepONet conditioned on GNN-derived code embeddings (R2=0.67R^2 = 0.67R2=0.67 vs.\ R2=−10R^2 = -10R2=−10 without), and (iii)~reveals that code geometry constrains complexity dynamics through partial correlation analysis (distance→\to→max complexity: rpartial=−0.60r_{\mathrm{partial}} = -0.60rpartial​=−0.60, p=5.1×10−65p = 5.1 \times 10^{-65}p=5.1×10−65). Our key insight is that code-space projections P=∏i(I+gi)/2P = \prod_i (I + g_i)/2P=∏i​(I+gi​)/2 act as a dynamical filter: they mathematically annihilate operator branches that anti-commute with any stabilizer, effectively pruning the Krylov tree and making complexity growth sensitive to the code's geometric distance. We validate robustness across XXZ and random Hamiltonians while identifying that Ising symmetry decouples geometry from dynamics---a physically interpretable null result. Across 661 stabilizer codes (n≤12n \leq 12n≤12), within-size correlations confirm that the geometry--complexity link persists after controlling for system size and \emph{strengthens} at larger nnn (reaching r=−0.91r = -0.91r=−0.91 at n=12n=12n=12). Multi-seed averaging over 10 Haar-random projections per code confirms that 99.8%99.8\%99.8% of trajectory variance is between-code (structural), with seed-averaged correlations strengthening to rpartial=−0.70r_{\mathrm{partial}} = -0.70rpartial​=−0.70, providing computational evidence for holographic intuitions connecting code distance to constrained Krylov evolution.
Computational complexity reduction is at the basis of a new formulation of many-body quantum states according to tensor network ansatz, originally framed in one-dimensional lattices. In order to include long-range entanglement characterizing phase transitions, the multiscale entanglement renormalization ansatz (MERA) defines a sequence of coarse-grained lattices, obtained by targeting the map of a scale-invariant system into an identical coarse-grained one. The quantum circuit associated with this hierarchical structure includes the definition of causal relations and unitary extensions, leading to the definition of ground subspaces as stabilizer codes. The emerging error correcting codes are referred to logical indices located at the highest hierarchical level and to physical indices yielded by redundancy, framed in the AdS-CFT correspondence as holographic quantum codes with bulk and boundary indices, respectively. In a use-case scenario based on errors consisting of spin erasure, the correction is implemented as the reconstruction of a bulk local operator.
Recent work has established that quantum error-correcting code geometry constrains Krylov complexity dynamics: a forward pipeline mapping stabilizer codes through GNN embeddings and DeepONet predictions to complexity trajectories CK(t)C_K(t)CK​(t).We invert this pipeline: given a \emph{target} complexity trajectory CKtarget(t)C_K^{\mathrm{target}}(t)CKtarget​(t), we generate stabilizer codes whose actual dynamics match the target.Our three-stage approach combines (i)~gradient-based embedding optimization through a frozen DeepONet to find the 128-dimensional code embedding that best reproduces the target trajectory, (ii)~a Transformer-based Graph VAE decoder with Gumbel-Softmax discretization and physics-informed losses (commutativity, overlap penalty, minimum weight) that maps embeddings to stabilizer code structures, and (iii)~a commutativity repair and validation pipeline with distance-aware filtering.Across six target trajectories spanning Lloyd-bound saturation, power-law growth, and linear-then-saturate profiles, our method achieves 87\% code validity, mean trajectory correlation ρˉ=+0.701\bar{\rho} = +0.701ρˉ​=+0.701, best single-code correlation +0.995+0.995+0.995, and 100\% of generated codes with distance d≥2d \geq 2d≥2.Ablation studies confirm that each component---overlap penalty, multi-strategy repair, distance filtering, and canonical code injection---contributes to the final performance.This work demonstrates the first \emph{inverse holographic design} pipeline: specifying desired dynamical behavior and automatically generating the quantum code that realizes it, opening pathways toward complexity-aware quantum code engineering.
We explicitly construct a class of holographic quantum error correction codes with non-trivial centers in the code subalgebra. Specifically, we use the Bacon-Shor codes and perfect tensors to construct a gauge code (or a stabilizer code with gauge-fixing), which we call the holographic hybrid code. This code admits a local log-depth encoding/decoding circuit, and can be represented as a holographic tensor network which satisfies an analog of the Ryu-Takayanagi formula and reproduces features of the sub-region duality. We then construct approximate versions of the holographic hybrid codes by “skewing” the code subspace, where the size of skewing is analogous to the size of the gravitational constant in holography. These approximate hybrid codes are not necessarily stabilizer codes, but they can be expressed as the superposition of holographic tensor networks that are stabilizer codes. For such constructions, different logical states, representing different bulk matter content, can “back-react” on the emergent geometry, resembling a key feature of gravity. The locality of the bulk degrees of freedom becomes subspace-dependent and approximate. Such subspace-dependence is manifest from the point of view of the “entanglement wedge” and bulk operator reconstruction from the boundary. Exact complementary error correction breaks down for certain bipartition of the boundary degrees of freedom; however, a limited, state-dependent form is preserved for particular subspaces. We also construct an example where the connected two-point correlation functions can have a power-law decay. Coupled with known constraints from holography, a weakly back-reacting bulk also forces these skewed tensor network models to the “large N limit” where they are built by concatenating a large N number of copies.
Specific corrections (Nov 2026): the 15-digit self-similarity is the identity eig(T^n) = lambda^n; alpha = 4.00 from a single size was superseded (about 2.49, then about ln 8 in 10.5281/zenodo.19673513); G_3 values are lattice renamings; L_x = 10 was fitted. [NOTE, June 2026: This paper is part of the AME(4,6)/TOE series whose headline claims were partially retracted. In particular the "zero free parameters" framing and several numerical predictions are withdrawn; see the Status Note at DOI 10.5281/zenodo.20618848 and the maintained mathematics at DOI 10.5281/zenodo.20128951. The text below is unchanged and remains as the record of the programme's history.] We perform a seven-part holographic analysis of the SU(3)_3 ⊗ SU(2)_2 string-net model associated with the AME(4,6) quantum error-correcting code. The transfer matrix is reinterpreted as a discrete renormalization group (RG) operator, and its iterated action is studied as a proxy for the MERA tensor network that defines an emergent holographic bulk. Key results: (1) Perfect conformal self-similarity — gap ratios preserved to 15 significant digits through 5 RG steps; (2) WZW tower matching — entanglement spectrum matches (0,0)⊗σ primary at h=3/16 exactly (Δh=0.0000); (3) Entanglement temperature β_ent = 2.380; (4) N-layer stacking shows exponential RG convergence (gapped system); (5) Topological hierarchy: ξ_topo/ξ = 5171 at Lx=2, scaling as exp(4·Lx), giving ~10^17 at Lx=10 — matching the Planck-electroweak ratio M_Pl/v; (6) Brown-Henneaux G₃ = 0.156 lattice units from c=11/2, L_AdS=ξ=0.572; (7) Stress tensor candidates at h≈1.81 (9.5% below h=2, finite-size at Lx=2). The topological hierarchy mechanism is the most provocative result: an O(1) topological constant (α≈4) combined with modest system size (Lx≈10) generates the 16 orders of magnitude separating v from M_Pl, without fine-tuning.