[13]Connectivity Engineering: Geometric Origin of Holographic Quantum Error Correction

Wenjun Luo

Published Oct 26, 2026• 0 citations

Abstract

The core of quantum error correction lies in how to isolate local errors to prevent them from contaminating the global system. Within the framework of connectivity engineering, this paper proposes a holographic quantum error correction mechanism based on pure geometric decoupling. Numerical results show that in a locally connected network (k=1), local errors rapidly diffuse globally through the increase of entanglement entropy; while in the decoupled network (k=3), long-range hopping constructs a graph-topological barrier, strictly locking the error within the isolated sub-chain where it was injected, and the mutual entanglement entropy between A and B remains strictly at its initial zero value. Since the physical hopping between subsystems is cut off, the injected error state cannot trigger global chaos, and the purity of boundary information remains stable. This mechanism does not rely on traditional redundant encoding, but rather utilizes the intrinsic graph-topological isolation property of geometric connectivity to achieve "physical-layer" fault tolerance. It provides a minimal discrete dynamical benchmark for understanding Bulk Locality in holographic duality and points the way for designing redundancy-free quantum memories.

DOI: 10.5281/zenodo.23657594

Related papers

[07]Deterministic Geometric Decoupling Blocks Operator Krylov Complexity and Enables Multi-Channel Chaos Isolation

Wenjun Luo

Krylov complexity is a central metric for characterizing quantum chaos and operator scrambling. Here, we propose a purely geometric connectivity-engineering scheme: by reconstructing the spin chain topology with a fixed hopping step, the parent system is strictly decoupled into multiple independent sub-chains. Numerically, the complexity of local operators in the normal chain grows rapidly, whereas in the decoupled network, it is strictly bounded and undergoes periodic revivals at low dimensions. The rapid decay of Lanczos coefficients and the drop in Krylov entropy confirm that the geometric-induced direct sum decomposition of the Hilbert space causes the Lanczos generation chain to truncate sharply beyond a finite order (the "wall effect"). This mechanism, analogous to a topological firewall in holographic gravity, challenges the connectivity assumption of the Universal Operator Growth Hypothesis and provides a minimalist deterministic benchmark for chaos isolation and information shielding in multi-core quantum chips.

Oct 24, 20260 citations

[08]Emergence of Discrete RT-type Scaling and Area Law in Geometrically Decoupled Lattices

Wenjun Luo

Holographic duality suggests that continuous spacetime geometry can emerge from underlying quantum entanglement. Based on the connectivity engineering framework, we construct a purely geometric decoupled lattice model to explore the entanglement area law and the emergence mechanism of discrete Ryu-Takayanagi (RT)-type scaling. By tuning the nearest-neighbor coupling λ, the system evolves from a disconnected direct sum decomposition (λ=0) to a globally connected phase. Precise numerical results indicate that weak nearest-neighbor coupling can stitch the rigid fault lines in the information distance matrix, inducing the formation of a smooth and continuous effective geometry. The core result is that in the stitched connected phase, the subsystem entanglement entropy is dominated by the geometric boundary, satisfying a scaling relation primarily governed by a linear area law with logarithmic corrections. Through a hold-out test on irregular subregions, the RT-type scaling calibrated by square samples provides a controlled error estimate for rectangular subregions. The L-shaped concave subregion exhibits a systematic negative deviation, corresponding to the well-known corner correction effect in free-fermion systems, further distinguishing perimeter scaling from minimal-surface scaling. Combined with Kitaev-Preskill diagnostic analysis, the results support that the discrete RT-type scaling can emerge from a purely geometric discrete network. This model provides a clean, exactly solvable underlying benchmark for studying discrete spacetime geometry and holographic entanglement on quantum simulators.

Oct 25, 20260 citations

[12/20]Geometric Confinement of Decoherence in Connectivity-Engineered Networks

Wenjun Luo

The core challenge in quantum computing lies in decoherence and thermalization caused by environmental noise. Within the framework of connectivity engineering, this paper proposes a protection scheme based on pure geometric decoupling mechanisms. By separately calculating the dynamical evolution of both closed and open systems, the numerical results show that: in a closed system, the local network (k=1) thermalizes rapidly, while the decoupled network (k=3) exhibits long-time quantum oscillations. Under Lindblad dissipation, the Loschmidt echo of the k=1 network decays rapidly; while under the parameter conditions of L=10 and γ=0.5, the fidelity of the k=3 network still revives to 0.41 at t=12.5. This mechanism originates from geometric truncation, which fragments the long chain into independent sub-chains, forming "geometric confinement" and "Quantum Fast-Shutter Protection". After further introducing static disorder impurities, the revival peak remains stable, indicating that the mechanism possesses strong robustness against both dynamical dissipation and static disorder. This result establishes a connectivity criterion for suppressing decoherence and provides a solid discrete physical benchmark for designing noise-resistant NISQ quantum memory hardware.

Oct 26, 20260 citations

[05]Light-Cone Scaling and Entanglement-Propagation Dual Bound in Geometrically Decoupled Networks

Wenjun Luo

Inspired by the ER=EPR conjecture in holographic physics, we construct a minimal and exactly solvable geometrically decoupled spin network benchmark within the framework of connectivity engineering. The system consists of two geometrically decoupled subsystems (Universes A and B) connected by a throat C. By constructing a directed boundary using complex hopping phases to introduce a synthetic gauge field, we measure the effective light-cone information propagation speed to be approximately 0.51; this propagation speed can be tuned by the geometric topology of the throat, satisfying the bandwidth scaling relation where v_arrive is proportional to W_C. Furthermore, we numerically extract an empirical dual bound where I_max times v_arrive is less than or equal to K, revealing a fundamental trade-off limit between entanglement generation capacity and information propagation speed. This work abandons gravitational metric degrees of freedom while retaining the core geometric-topological structures of holographic duality, providing a tunable and deterministic discrete numerical benchmark for holographic information transport.

Oct 23, 20260 citations

[01]Connectivity Engineering: Deterministic Geometric Decoupling and Internal Entanglement Dynamics

Wenjun Luo

In ordinary nearest-neighbor connected networks, local perturbations usually spread globally. This paper proposes a purely geometric scheme: by reconstructing the topology with a fixed step length k, the system decomposes into g disconnected periodic ring components when g = gcd(L, k). When ε = 0 and operators are taken from different components, the cross-component out-of-time-order correlator (OTOC) is strictly zero, down to machine precision. At numerically accessible system sizes, the saturated entanglement entropy averaged over random product states within components grows approximately linearly and approaches the half-chain Page value upper bound. Introducing a very weak single-boundary coupling, the cross-component OTOC leakage is consistent with the ε² scaling law in a finite early-time window. This mechanism requires no complex quantum error correction or strong disorder, providing a testable deterministic wiring principle for crosstalk isolation in quantum chips.

Oct 22, 20260 citations

[06]Deterministic Geometric Decoupling for Scalable Many-Body Scar Arrays and Multiplexing

Wenjun Luo

Quantum many-body scars are a core mechanism of weak ergodicity breaking, but deterministically protecting and scaling these fragile coherent states remains a great challenge. We propose a purely geometric scheme based on connectivity engineering: by reconstructing the network topology with fixed-step hopping, the parent system is strictly decoupled into multiple equal-length independent sub-chains. We validate this mechanism in the PXP model featuring scar states. Numerical results demonstrate that within the decoupled network, the sub-chain interiors not only independently inherit the many-body scar properties of the parent (manifested as long-lived staggered magnetization oscillations and finite-size revivals of entanglement entropy), but also, due to the geometric blockades, the cross-channel quantum mutual information is strictly blocked at the machine precision limit. This mechanism requires no complex external fine-tuning, providing a minimal and deterministic blueprint for multi-channel quantum memory multiplexing in quantum chips.

Oct 24, 20260 citations