Unequal Information Distribution in Holographic Quantum Codes

Under ideal Pauli-noise and noiseless-syndrome assumptions in our stabilizer-factorization model, the backward-boundary entropy reduction, hereby denoted ΔH, is known to be zero. Nevertheless, on real quantum hardware, we measure ΔH > 1 bit on every code tested, revealing structured entropy reduction from a calibration-based backward boundary. Comparing three distance-3 codes on the same IBM processor (a holographic [[5,1,3]] code, Steane [[7,1,3]], and Shor [[9,1,3]]), we find that this information distributes anisotropically across stabilizers on the holographic code (per-stabilizer variation 6.6–8.2% vs. isotropic controls; permutation test, p < 0.01). Two independent strength sweeps, one computational prior-concentration sweep and one physical measurement-strength sweep via tunable rotation gates, produce matching per-stabilizer rankings (Fisher p = 0.021), with the anisotropy gap peaking at 42× in an intermediate prior-concentration regime. Two controlled negatives (readout conditioning and repeated syndrome extraction) and a four-boundary ablation identify holographic geometry as the main distinguishing variable among the factors tested. These results, reproduced on two independent IBM quantum processors with different per-stabilizer rank orderings (combined p = 0.042), are consistent with the inhomogeneous boundary geometry predicted by holographic tensor network models of AdS/CFT.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-05-18
DOI
https://doi.org/10.5281/zenodo.20128742
Citations
2
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Unequal Information Distribution in Holographic Quantum Codes

Luis Razo, Eliahu Cohen
2 citations
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
preprint

Unequal Information Distribution in Holographic Quantum Codes

Luis Razo, Eliahu Cohen
preprint en
2 citations

Abstract

Under ideal Pauli-noise and noiseless-syndrome assumptions in our stabilizer-factorization model, the backward-boundary entropy reduction, hereby denoted ΔH, is known to be zero. Nevertheless, on real quantum hardware, we measure ΔH > 1 bit on every code tested, revealing structured entropy reduction from a calibration-based backward boundary. Comparing three distance-3 codes on the same IBM processor (a holographic [[5,1,3]] code, Steane [[7,1,3]], and Shor [[9,1,3]]), we find that this information distributes anisotropically across stabilizers on the holographic code (per-stabilizer variation 6.6–8.2% vs. isotropic controls; permutation test, p < 0.01). Two independent strength sweeps, one computational prior-concentration sweep and one physical measurement-strength sweep via tunable rotation gates, produce matching per-stabilizer rankings (Fisher p = 0.021), with the anisotropy gap peaking at 42× in an intermediate prior-concentration regime. Two controlled negatives (readout conditioning and repeated syndrome extraction) and a four-boundary ablation identify holographic geometry as the main distinguishing variable among the factors tested. These results, reproduced on two independent IBM quantum processors with different per-stabilizer rank orderings (combined p = 0.042), are consistent with the inhomogeneous boundary geometry predicted by holographic tensor network models of AdS/CFT.

Zenodo (CERN European Organization for Nuclear Research)
Bar-Ilan University (IL), Institute of Seismology (KZ)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.