IT FROM A: A Numerical and Analytic Companion to "No-Signalling Fixes the Hilbert-Space Inner Product" — Adversarial Mapping, a Universal Linear Coefficient, and a General Holographic Immunity Theorem
Pati (2026) proved analytically that any generalized Hilbert-space inner product with positive operator A≠I permits superluminal signaling, uniquely fixing the standard inner product as the only one consistent with relativistic causality. We provide a numerical and analytic companion to this result. Using adversarial variational search over an EPR-steering protocol, we confirm zero signal at A=I to machine precision, find nonzero signal at every tested deviation down to 10⁻⁶ with no safe region at any scale, determine the universal leading-order coefficient (exactly 1.000000, confirmed to 8 decimal places), show the same structure persists from qubits to qutrits, and find that the optimal metric deviation and optimal probe observable are exactly orthogonal on the Bloch sphere. Extending the protocol to a logical Bell pair between two [[5,1,3]] holographic code blocks, we prove and numerically confirm an exact immunity theorem: the signal vanishes identically when the inner-product deformation is confined to k physical qubits for k=1,2, and becomes genuinely nonzero exactly at k=3 — precisely the code's erasure-correction threshold. We show this generalizes, without further computation, to every quantum error-correcting code, via the general erasure-correction theorem of Knill-Laflamme and Bennett-DiVincenzo-Smolin-Wootters — resting on the same mathematical foundation used to derive the Ryu-Takayanagi holographic entanglement-entropy formula from quantum error correction. Simulation/computation-only results; no hardware component.
Pati (2026) proved analytically that any generalized Hilbert-space inner product with positive operator A≠I permits superluminal signaling, uniquely fixing the standard inner product as the only one consistent with relativistic causality. We provide a numerical and analytic companion to this result. Using adversarial variational search over an EPR-steering protocol, we confirm zero signal at A=I to machine precision, find nonzero signal at every tested deviation down to 10⁻⁶ with no safe region at any scale, determine the universal leading-order coefficient (exactly 1.000000, confirmed to 8 decimal places), show the same structure persists from qubits to qutrits, and find that the optimal metric deviation and optimal probe observable are exactly orthogonal on the Bloch sphere. Extending the protocol to a logical Bell pair between two [[5,1,3]] holographic code blocks, we prove and numerically confirm an exact immunity theorem: the signal vanishes identically when the inner-product deformation is confined to k physical qubits for k=1,2, and becomes genuinely nonzero exactly at k=3 — precisely the code's erasure-correction threshold. We show this generalizes, without further computation, to every quantum error-correcting code, via the general erasure-correction theorem of Knill-Laflamme and Bennett-DiVincenzo-Smolin-Wootters — resting on the same mathematical foundation used to derive the Ryu-Takayanagi holographic entanglement-entropy formula from quantum error correction. Simulation/computation-only results; no hardware component.
One of the boldest ideas in modern physics is that space itself is a kind of error-correcting code. In this picture the interior of a region of spacetime is like a message, and the surface surrounding it is an encoded copy that stores the message redundantly, so that losing part of the surface need not lose the interior. A celebrated formula from holography then says something unexpected: the amount of entanglement carried by a boundary region equals the area of a surface reaching into the interior. This paper gives a complete, elementary proof that this area law is not an extra assumption bolted on by hand, but an unavoidable consequence of the code structure itself. The geometry is simply bookkeeping for redundancy. The derivation reduces a statement about gravity to plain facts about entanglement and about the algebra of operations one can perform on the encoded information. It establishes four things, each from scratch. First, in the simplest case it recovers the area law directly: the entanglement of a boundary region is a fixed geometric term plus the entanglement of whatever the interior itself carries. Second, it proves a symmetry that had previously been handled case by case, namely that a pure joint state assigns the same entanglement to a region and to its complement, and it proves this in full generality using a single clean identity about matrices. Third, it extends the area law to the realistic situation in which the code splits into separate sectors, each carrying its own independent area, so that the geometric term is not a single number but a genuine operator averaged over the sectors. Fourth, it proves the structural fact the whole picture rests on: the algebra of logical operations always decomposes cleanly into independent blocks, which is exactly the sector structure the area law needs. That last step comes down to one small analytic fact, that a matrix which is symmetric in the appropriate sense and also nilpotent must be zero, and the paper proves it directly. A companion result closes the reconstruction side of the story, showing that the operations recoverable from a boundary region are precisely those left untouched by the coarse-graining onto sectors, and that the coarse-grained state already reproduces every such measurement. Every step is elementary and self-contained, and the entire logical core has a companion version reconstructed inside a machine proof assistant, checked line by line with no gaps and resting only on the standard axioms of mathematics. The upshot is that a piece of geometry, an area, can be read off from nothing more than how redundantly a code stores its information. None of the underlying mathematics is new; it traces back to established results on holographic codes, to the entropy formula itself, and to the century-old classification of matrix algebras. What is new is the assembly: a short, honest, self-contained line of reasoning that turns a claim about spacetime into a handful of reusable facts about entropy and matrices, with every link exposed and checkable. Where the picture still reaches past what has been proved, in particular the finer tensor structure hidden inside each sector, the paper marks the boundary plainly instead of hiding it.
Quantum error correction and symmetry arise in many areas of physics, including many-body systems, metrology in the presence of noise, fault-tolerant computation, and holographic quantum gravity. Here, we study the compatibility of these two important principles. If a logical quantum system is encoded into n physical subsystems, we say that the code is covariant with respect to a symmetry group G if a G transformation on the logical system can be realized by performing transformations on the individual subsystems. For a G-covariant code with G a continuous group, we derive a lower bound on the error-correction infidelity following erasure of a subsystem. This bound approaches zero when the number of subsystems nor the dimension d of each subsystem is large. We exhibit codes achieving approximately the same scaling of infidelity with n or d as the lower bound. Leveraging tools from representation theory, we prove an approximate version of the Eastin-Knill theorem for quantum computation: If a code admits a universal set of transversal gates and corrects erasure with fixed accuracy, then, for each logical qubit, we need a number of physical qubits per subsystem that is inversely proportional to the error parameter. We construct codes covariant with respect to the full logical unitary group, achieving good accuracy for large d (using random codes) or n (using codes based on W states). We systematically construct codes covariant with respect to general groups, obtaining natural generalizations of qubit codes to, for instance, oscillators and rotors. In the context of the AdS/CFT correspondence, our approach provides insight into how time evolution in the bulk corresponds to time evolution on the boundary without violating the Eastin-Knill theorem, and our five-rotor code can be stacked to form a covariant holographic code.
We propose a family of exactly solvable toy models for the AdS/CFT correspondence based on a novel construction of quantum error-correcting codes with a tensor network structure. Our building block is a special type of tensor with maximal entanglement along any bipartition, which gives rise to an isometry from the bulk Hilbert space to the boundary Hilbert space. The entire tensor network is an encoder for a quantum error-correcting code, where the bulk and boundary degrees of freedom may be identified as logical and physical degrees of freedom respectively. These models capture key features of entanglement in the AdS/CFT correspondence; in particular, the Ryu-Takayanagi formula and the negativity of tripartite information are obeyed exactly in many cases. That bulk logical operators can be represented on multiple boundary regions mimics the Rindlerwedge reconstruction of boundary operators from bulk operators, realizing explicitly the quantum error-correcting features of AdS/CFT recently proposed in [1].
Recent work showed holographic error correcting codes to have simple universal features at O(1/G). In particular, states of fixed Ryu-Takayanagi (RT) area in such codes are associated with flat entanglement spectra indicating maximal entanglement between appropriate subspaces. We extend such results to one-loop order (O(1) corrections) by controlling both higher-derivative corrections to the bulk effective action and dynamical quantum fluctuations below the cutoff. This result clarifies the relation between the bulk path integral and the quantum code, and implies that i) simple tensor network models of holography continue to match the behavior of holographic CFTs beyond leading order in G, ii) the relation between bulk and boundary modular Hamiltonians derived by Jafferis, Lewkowycz, Maldacena, and Suh holds as an operator equation on the code subspace and not just in code-subspace expectation values, and iii) the code subspace is invariant under an appropriate notion of modular flow. A final corollary requires interesting cancelations to occur in the bulk renormalization-group flow of holographic quantum codes. Intermediate technical results include showing the Lewkowycz-Maldacena computation of RT entropy to take the form of a Hamilton-Jacobi variation of the action with respect to boundary conditions, corresponding results for higher-derivative actions, and generalizations to allow RT surfaces with finite conical angles.
Abstract Recent work showed holographic error correcting codes to have simple universal features at O(1/G). In particular, states of fixed Ryu-Takayanagi (RT) area in such codes are associated with flat entanglement spectra indicating maximal entanglement between appropriate subspaces. We extend such results to one-loop order (O(1) corrections) by controlling both higher-derivative corrections to the bulk effective action and dynamical quantum fluctuations below the cutoff. This result clarifies the relation between the bulk path integral and the quantum code, and implies that i) simple tensor network models of holography continue to match the behavior of holographic CFTs beyond leading order in G, ii) the relation between bulk and boundary modular Hamiltonians derived by Jafferis, Lewkowycz, Maldacena, and Suh holds as an operator equation on the code subspace and not just in code-subspace expectation values, and iii) the code subspace is invariant under an appropriate notion of modular flow. A final corollary requires interesting cancelations to occur in the bulk renormalization-group flow of holographic quantum codes. Intermediate technical results include showing the Lewkowycz-Maldacena computation of RT entropy to take the form of a Hamilton-Jacobi variation of the action with respect to boundary conditions, corresponding results for higher-derivative actions, and generalizations to allow RT surfaces with finite conical angles.