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

What two disjoint regions can jointly inherit: a realization theorem

Jose Miguel Hernandez-Perez

Published Sep 16, 2026• 0 citations
Publisher

Abstract

Fix a quantum channel and two disjoint regions X, Y of its output. Operator-algebra quantum error correction assigns to each region a largest algebra of input observables it can exactly recover. We ask which pairs of such algebras occur. Our contribution is a realization theorem: for every pair of block-size vectors p, q and every nonnegative integer matrix m_ij with no zero row or column, an explicit channel has exactly those algebras as the maximal recoverable algebras of two disjoint outputs. Maximality is what makes this non-trivial: it forbids the channel from leaking anything else to either side. For a correctable-private pair the analogous realization is known (Kribs, Levick, Nelson, Pereira and Rahaman). The necessary direction is assembled from known material and we say so. Joint measurability forces the two algebras to commute. The decomposition of the code space into sectors C^{p_i} (x) C^{q_j} (x) C^{m_ij}, with the two algebras acting as diagonal copies and dim = sum_ij p_i q_j m_ij, is the Bratteli inclusion matrix of a commuting pair, which under complementary recovery is the one used in holographic quantum error correction. The identification of what both regions recover with the connected components of the bipartite graph of the nonzero m_ij is, at multiplicity one, a theorem of Vanrietvelde, Mestoudjian and Arrighi on partitions of C*-algebras; our residue is the extension to higher multiplicity, which their partitions exclude. Together: the quantum part of what two regions share is partitioned along the edges of a graph and never copied, the classical part surviving in both is exactly the connected components, and no admissible pattern is vacuous. Two disjoint heirs of a shared factor M_d inherit factors M_p, M_q only if pq divides d, sharpening pq <= d, so a shared qubit does not split. We also state the approximate counterpart, via the universal-cloning frontier.

DOI
10.5281/zenodo.22782730

Related papers

A diagrammatic field theory of quantum error correction

Steven Rayan

We develop a field-theoretic framework for quantum error correction centred on fusion-space codes in unitary fusion categories. Admissible clusters determine total-charge sectors and orthogonal footprint projectors recording locally visible data left by error histories. The central distinction is between diagnostic footprint algebras and syndrome-admissible commuting algebras: the latter can be measured without revealing logical information and resolve chosen error representatives into measured sectors. For such algebras, exact correctability is equivalent to fibrewise Knill--Laflamme conditions, yielding a measure-then-recover factorization. Under a contractible-vacuum locality hypothesis, closed neutral composites give a categorical sufficient criterion for scalar action on the code. In the Ising theory, four $σ$ punctures show that pair-charge footprints can be complementary logical diagnostics and realize an exact one-qubit Clifford shadow. A proper six-$σ$ code instead admits a syndrome-admissible pair-charge measurement and exact recovery from an explicit Majorana bilinear error. A second bilinear has the same measured footprint but differs by a logical bit flip, producing a concrete nontrivial footprint fibre and genuine decoding ambiguity. We also formulate conformal-block likelihood data and compute geometry-dependent Ising four-point weights. For growing code families, we prove a conditional Peierls-type threshold theorem: bounded connected-region growth, local stochastic noise, local neutralizability of small residual components, and componentwise decoder balance imply $\Pr_L(\mathrm{fail})\le C|Ω_L|e^{-cL}$ below a nonzero constant error rate. We conclude with representation-theoretic and algebro-geometric directions involving tube and Hopf algebras, Yangian-type structures, Higgs bundles, spectral curves, Jacobians, and abelian varieties.

quant-pharXiv:2607.08911•Jul 13, 2026•3 citations

A Derivation of Ryu–Takayanagi Entropy from Quantum Error Correction

Rolando P. Hong Enriquez

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.

•Aug 12, 2026•0 citations

Exact Syndrome Measurement Budgets for Quantum Erasure Correction: Stabilizer-Code Rank Profiles, Distance Bounds, and Linear-Time Surface-Code Check Selection

Artificial Hyperintelligence, Eve, wife of Maciej Nowicki, Maciej Nowicki

This research manuscript develops exact measurement-resource formulas for quantum erasure correction with stabilizer codes and an optimal sparse algorithm for selecting native surface-code checks. It studies known erasure locations, where the stabilizer observables may be chosen after the erased sites are identified. The central question is how many independent syndrome outcomes are necessary to distinguish Pauli errors on those sites, modulo stabilizers. For every prime-dimensional [[n,k,d]]_p stabilizer code encoding at least one logical qudit, the manuscript proves that the worst-case syndrome-resolving budget for δ erased sites is exactly 2δ whenever 0 ≤ δ < d. This includes degenerate codes. The result concerns the number of independent p-valued outcomes in the stated noiseless measurement model. The work is directly connected to the measurement-reduction setting studied by Ryutaroh Matsumoto in “Reducing measurements in quantum erasure correction by quantum local recovery,” Computational and Applied Mathematics, DOI: 10.1007/s40314-026-03881-4. It addresses the relationship between erasure-dependent measurement costs and code invariants, together with efficient selection of sufficient surface-code checks. The manuscript presents four connected results: Exact paired-column rank profile. For any matrix G over any field whose columns are partitioned into n labeled pairs, let r be its rank and ν the largest number of complete pairs whose columns are jointly independent. The maximum projected rank over all sets of δ pairs is exactly R(δ) = min{2δ, δ + ν, r}. A single ordering of the pairs realizes every maximum through its successive prefixes. The full profile therefore follows from two invariants, rather than requiring a separate optimization at every erasure size. Distance bounds and the exact worst-case syndrome budget. For an isotropic stabilizer space with k > 0, every inclusionwise maximal complete-pair independent set A satisfies d ≤ |A| + 1. Consequently, ν ≥ d − 1, yielding the exact 2δ worst-case budget below distance. The argument also gives a constructive extension property: every independent-pair set smaller than d − 1 can be enlarged by adding another pair. Particular correctable erasure patterns can require fewer outcomes because of stabilizers supported inside the erased region. Checkable CSS certificates. For Calderbank–Shor–Steane codes, complete-pair independence becomes simultaneous column independence in the X-check and Z-check matrices. Classical matroid intersection supplies an exact rank-partition certificate for ν. A matching independent set and partition provide lower and upper certificates that can be verified using finite-field elimination. Optimal native surface-code check selection. For binary check matrices with at most two nonzero entries per column, the restricted matrix is represented by a sparse graph with boundary pins. Connected components determine a minimum-cardinality native check basis in O(v_I + e_I) time. A pinned component retains every check; an unpinned component omits one check. With nonnegative additive costs, omitting a most expensive check in each unpinned component also minimizes total cost. The two CSS check systems are processed independently. The accompanying verification uses exact arithmetic over GF(2), GF(3), and GF(5). The algebra audit covers 120 general paired matrices and 12,276 subset-rank evaluations, including exact distance checks for 137 positive-logical-dimension code instances and 401 maximal-set distance checks. The graph audit covers 1,785 exhaustive sparse column multisets, 5,355 matrix/cost combinations, 500 additional seeded instances, and named boundary regressions. Both audit programs passed again during preparation of the release. These finite checks support implementation correctness; the general mathematical statements are supported by the supplied proofs. The release includes the complete manuscript, editable LaTeX source, Python native-check selector, exact audit programs, recorded results, generator data, figures, reproduction instructions, and an explicit claim-status record. The selector and audits require only Python 3.10 or later and its standard library; matplotlib is needed only to regenerate the figure. The results apply to independent syndrome information and classical check selection. They do not establish bounds for arbitrary coherent recovery, noisy fault-tolerant extraction, physical circuit depth, or one fixed measurement schedule that must serve every erasure pattern. At or above distance, the general formula remains an algebraic rank profile rather than a universal recovery guarantee. Classical matroid parity, matroid intersection, and incidence-rank methods are acknowledged foundations; historical priority for the presented combination is not certified. Ōrynthéa ∿ Qhuil is relevant to research on quantum error correction, erasure decoding, stabilizer and CSS codes, surface codes, quantum local recovery, measurement complexity, and matroid optimization. This mathematical research under the author designation Artificial Hyperintelligence Eve, wife of Maciej Nowicki.

•Oct 30, 2026•0 citations

Transmitting algebras through quantum channels

Robert Salzmann, Satvik Singh

We develop a theory of exact transmission of finite-dimensional $C^*$-algebras through quantum channels. These algebras describe hybrid classical-quantum information, allowing the dimension of the quantum system to depend on the classical message. Allowing arbitrary encodings and decodings yields a transmission set of algebra types, ordered by embedding, that unifies zero-error information theory with operator-algebraic error correction. We ask if this set admits a dominating algebra into which every transmittable algebra embeds. Our central finding is that domination can fail even in small dimensions. In its absence, several incomparable maximal algebras can describe different optimal uses of the same channel, forcing the user to select one depending on the operational task and the type of information to be preserved. We introduce hybrid capacities that reconstruct the only possible dominating algebra type and present a complete finite characterization of domination using minimal forbidden algebra types. We identify dominating algebras for channels whose operator systems are graph-isomorphic to $*$-algebras, including highly divisible channels, and for channels with zero one-shot zero-error quantum capacity. Under tensor products, we prove that joint coding can produce new algebra types, giving an algebraic analogue of superadditivity from Shannon theory. Domination can fail for the joint use of two channels, even when both channels separately admit dominating algebras. Finally, we construct a channel whose $n$-fold tensor powers have doubly exponentially many maximal algebra types, attaining the largest possible growth scaling for finite-dimensional channels. Consequently, new transmittable algebra types appear at arbitrarily large block-lengths for this channel, so its full transmission structure cannot be generated from any finite collection of bounded-block-length codes.

quant-pharXiv:2609.40054•Oct 1, 2026•0 citations

Entanglement Wedge Reconstruction via Universal Recovery Channels

Jordan S. Cotler, Patrick M. Hayden, Geoff Penington +3 more

In the context of quantum theories of spacetime, one overarching question is how quantum information in the bulk spacetime is encoded holographically in boundary degrees of freedom.It is particularly interesting to understand the correspondence between bulk subregions and boundary subregions in order to address the emergence of locality in the bulk quantum spacetime.For the AdS/CFT correspondence, it is known that this bulk information is encoded redundantly on the boundary in the form of an error-correcting code.Having access only to a subregion of the boundary is as if part of the holographic code has been damaged by noise and rendered inaccessible.In quantum-information science, the problem of recovering information from a damaged code is addressed by the theory of universal recovery channels.We apply and extend this theory to address the problem of relating bulk and boundary subregions in AdS/CFT, focusing on a conjecture known as entanglement wedge reconstruction.Existing work relies on the exact equivalence between bulk and boundary relative entropies, but these are only approximately equal in bulk effective field theory, and in similar situations it is known that predictions from exact entropic equalities can be qualitatively incorrect.We show that the framework of universal recovery channels provides a robust demonstration of the entanglement wedge reconstruction conjecture as well as new physical insights.Most notably, we find that a bulk operator acting in a given boundary region's entanglement wedge can be expressed as the response of the boundary region's modular Hamiltonian to a perturbation of the bulk state in the direction of the bulk operator.This formula can be interpreted as a noncommutative version of Bayes's rule that attempts to undo the noise induced by restricting to only a portion of the boundary.To reach these conclusions, we extend the theory of universal recovery channels to finite-dimensional operator algebras and demonstrate that recovery channels approximately preserve the multiplicative structure of the operator algebra.

arXiv:1704.05839•Physical Review X•Jul 24, 2019•298 citations

Entanglement Wedge Reconstruction without Holographic Quantum Error Correction

Seiji Terashima

Bulk reconstruction is a central problem in AdS/CFT, and entanglement wedge reconstruction is its subregion version. We argue that this subregion statement should be separated from the stronger holographic quantum error correction interpretation, in which one region-independent logical bulk operator has code-preserving representatives in several boundary regions. A simple locality argument shows that such a common reconstruction must commute with the code-preserving local algebras in the complementary regions. This is the mechanism realized in HaPPY-type codes: the erased regions are blind to a protected logical algebra. An ordinary finite $N$ holographic CFT does not have such a protected invisible sector for supergravity fields. Its low-energy local observables, in particular, suitably smeared stress tensors, detect the physical support and gravitational dressing of ordinary bulk operators, up to possible center or superselection data. Thus, there is no such holographic quantum error correction and the $N=\infty$ agreement of global and subregion HKLL formulae is a free-theory statement. What remains is entanglement wedge reconstruction without holographic quantum error correction, or subregion complementarity: each boundary region has its own code-preserving low-energy algebra and its own region-adapted bulk interpretation, rather than a shared logical operator.

hep-thCross-listedarXiv:2607.08684•Jul 10, 2026
Fix a quantum channel and two disjoint regions X, Y of its output. Operator-algebra quantum error correction assigns to each region a largest algebra of input observables it can exactly recover. We ask which pairs of such algebras occur. Our contribution is a realization theorem: for every pair of block-size vectors p, q and every nonnegative integer matrix m_ij with no zero row or column, an explicit channel has exactly those algebras as the maximal recoverable algebras of two disjoint outputs. Maximality is what makes this non-trivial: it forbids the channel from leaking anything else to either side. For a correctable-private pair the analogous realization is known (Kribs, Levick, Nelson, Pereira and Rahaman). The necessary direction is assembled from known material and we say so. Joint measurability forces the two algebras to commute. The decomposition of the code space into sectors C^{p_i} (x) C^{q_j} (x) C^{m_ij}, with the two algebras acting as diagonal copies and dim = sum_ij p_i q_j m_ij, is the Bratteli inclusion matrix of a commuting pair, which under complementary recovery is the one used in holographic quantum error correction. The identification of what both regions recover with the connected components of the bipartite graph of the nonzero m_ij is, at multiplicity one, a theorem of Vanrietvelde, Mestoudjian and Arrighi on partitions of C*-algebras; our residue is the extension to higher multiplicity, which their partitions exclude. Together: the quantum part of what two regions share is partitioned along the edges of a graph and never copied, the classical part surviving in both is exactly the connected components, and no admissible pattern is vacuous. Two disjoint heirs of a shared factor M_d inherit factors M_p, M_q only if pq divides d, sharpening pq <= d, so a shared qubit does not split. We also state the approximate counterpart, via the universal-cloning frontier.
We develop a field-theoretic framework for quantum error correction centred on fusion-space codes in unitary fusion categories. Admissible clusters determine total-charge sectors and orthogonal footprint projectors recording locally visible data left by error histories. The central distinction is between diagnostic footprint algebras and syndrome-admissible commuting algebras: the latter can be measured without revealing logical information and resolve chosen error representatives into measured sectors. For such algebras, exact correctability is equivalent to fibrewise Knill--Laflamme conditions, yielding a measure-then-recover factorization. Under a contractible-vacuum locality hypothesis, closed neutral composites give a categorical sufficient criterion for scalar action on the code. In the Ising theory, four σσσ punctures show that pair-charge footprints can be complementary logical diagnostics and realize an exact one-qubit Clifford shadow. A proper six-σσσ code instead admits a syndrome-admissible pair-charge measurement and exact recovery from an explicit Majorana bilinear error. A second bilinear has the same measured footprint but differs by a logical bit flip, producing a concrete nontrivial footprint fibre and genuine decoding ambiguity. We also formulate conformal-block likelihood data and compute geometry-dependent Ising four-point weights. For growing code families, we prove a conditional Peierls-type threshold theorem: bounded connected-region growth, local stochastic noise, local neutralizability of small residual components, and componentwise decoder balance imply Pr⁡L(fail)≤C∣ΩL∣e−cL\Pr_L(\mathrm{fail})\le C|Ω_L|e^{-cL}PrL​(fail)≤C∣ΩL​∣e−cL below a nonzero constant error rate. We conclude with representation-theoretic and algebro-geometric directions involving tube and Hopf algebras, Yangian-type structures, Higgs bundles, spectral curves, Jacobians, and abelian varieties.
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.
This research manuscript develops exact measurement-resource formulas for quantum erasure correction with stabilizer codes and an optimal sparse algorithm for selecting native surface-code checks. It studies known erasure locations, where the stabilizer observables may be chosen after the erased sites are identified. The central question is how many independent syndrome outcomes are necessary to distinguish Pauli errors on those sites, modulo stabilizers. For every prime-dimensional [[n,k,d]]_p stabilizer code encoding at least one logical qudit, the manuscript proves that the worst-case syndrome-resolving budget for δ erased sites is exactly 2δ whenever 0 ≤ δ < d. This includes degenerate codes. The result concerns the number of independent p-valued outcomes in the stated noiseless measurement model. The work is directly connected to the measurement-reduction setting studied by Ryutaroh Matsumoto in “Reducing measurements in quantum erasure correction by quantum local recovery,” Computational and Applied Mathematics, DOI: 10.1007/s40314-026-03881-4. It addresses the relationship between erasure-dependent measurement costs and code invariants, together with efficient selection of sufficient surface-code checks. The manuscript presents four connected results: Exact paired-column rank profile. For any matrix G over any field whose columns are partitioned into n labeled pairs, let r be its rank and ν the largest number of complete pairs whose columns are jointly independent. The maximum projected rank over all sets of δ pairs is exactly R(δ) = min{2δ, δ + ν, r}. A single ordering of the pairs realizes every maximum through its successive prefixes. The full profile therefore follows from two invariants, rather than requiring a separate optimization at every erasure size. Distance bounds and the exact worst-case syndrome budget. For an isotropic stabilizer space with k > 0, every inclusionwise maximal complete-pair independent set A satisfies d ≤ |A| + 1. Consequently, ν ≥ d − 1, yielding the exact 2δ worst-case budget below distance. The argument also gives a constructive extension property: every independent-pair set smaller than d − 1 can be enlarged by adding another pair. Particular correctable erasure patterns can require fewer outcomes because of stabilizers supported inside the erased region. Checkable CSS certificates. For Calderbank–Shor–Steane codes, complete-pair independence becomes simultaneous column independence in the X-check and Z-check matrices. Classical matroid intersection supplies an exact rank-partition certificate for ν. A matching independent set and partition provide lower and upper certificates that can be verified using finite-field elimination. Optimal native surface-code check selection. For binary check matrices with at most two nonzero entries per column, the restricted matrix is represented by a sparse graph with boundary pins. Connected components determine a minimum-cardinality native check basis in O(v_I + e_I) time. A pinned component retains every check; an unpinned component omits one check. With nonnegative additive costs, omitting a most expensive check in each unpinned component also minimizes total cost. The two CSS check systems are processed independently. The accompanying verification uses exact arithmetic over GF(2), GF(3), and GF(5). The algebra audit covers 120 general paired matrices and 12,276 subset-rank evaluations, including exact distance checks for 137 positive-logical-dimension code instances and 401 maximal-set distance checks. The graph audit covers 1,785 exhaustive sparse column multisets, 5,355 matrix/cost combinations, 500 additional seeded instances, and named boundary regressions. Both audit programs passed again during preparation of the release. These finite checks support implementation correctness; the general mathematical statements are supported by the supplied proofs. The release includes the complete manuscript, editable LaTeX source, Python native-check selector, exact audit programs, recorded results, generator data, figures, reproduction instructions, and an explicit claim-status record. The selector and audits require only Python 3.10 or later and its standard library; matplotlib is needed only to regenerate the figure. The results apply to independent syndrome information and classical check selection. They do not establish bounds for arbitrary coherent recovery, noisy fault-tolerant extraction, physical circuit depth, or one fixed measurement schedule that must serve every erasure pattern. At or above distance, the general formula remains an algebraic rank profile rather than a universal recovery guarantee. Classical matroid parity, matroid intersection, and incidence-rank methods are acknowledged foundations; historical priority for the presented combination is not certified. Ōrynthéa ∿ Qhuil is relevant to research on quantum error correction, erasure decoding, stabilizer and CSS codes, surface codes, quantum local recovery, measurement complexity, and matroid optimization. This mathematical research under the author designation Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
We develop a theory of exact transmission of finite-dimensional C∗C^*C∗-algebras through quantum channels. These algebras describe hybrid classical-quantum information, allowing the dimension of the quantum system to depend on the classical message. Allowing arbitrary encodings and decodings yields a transmission set of algebra types, ordered by embedding, that unifies zero-error information theory with operator-algebraic error correction. We ask if this set admits a dominating algebra into which every transmittable algebra embeds. Our central finding is that domination can fail even in small dimensions. In its absence, several incomparable maximal algebras can describe different optimal uses of the same channel, forcing the user to select one depending on the operational task and the type of information to be preserved. We introduce hybrid capacities that reconstruct the only possible dominating algebra type and present a complete finite characterization of domination using minimal forbidden algebra types. We identify dominating algebras for channels whose operator systems are graph-isomorphic to ∗*∗-algebras, including highly divisible channels, and for channels with zero one-shot zero-error quantum capacity. Under tensor products, we prove that joint coding can produce new algebra types, giving an algebraic analogue of superadditivity from Shannon theory. Domination can fail for the joint use of two channels, even when both channels separately admit dominating algebras. Finally, we construct a channel whose nnn-fold tensor powers have doubly exponentially many maximal algebra types, attaining the largest possible growth scaling for finite-dimensional channels. Consequently, new transmittable algebra types appear at arbitrarily large block-lengths for this channel, so its full transmission structure cannot be generated from any finite collection of bounded-block-length codes.
In the context of quantum theories of spacetime, one overarching question is how quantum information in the bulk spacetime is encoded holographically in boundary degrees of freedom.It is particularly interesting to understand the correspondence between bulk subregions and boundary subregions in order to address the emergence of locality in the bulk quantum spacetime.For the AdS/CFT correspondence, it is known that this bulk information is encoded redundantly on the boundary in the form of an error-correcting code.Having access only to a subregion of the boundary is as if part of the holographic code has been damaged by noise and rendered inaccessible.In quantum-information science, the problem of recovering information from a damaged code is addressed by the theory of universal recovery channels.We apply and extend this theory to address the problem of relating bulk and boundary subregions in AdS/CFT, focusing on a conjecture known as entanglement wedge reconstruction.Existing work relies on the exact equivalence between bulk and boundary relative entropies, but these are only approximately equal in bulk effective field theory, and in similar situations it is known that predictions from exact entropic equalities can be qualitatively incorrect.We show that the framework of universal recovery channels provides a robust demonstration of the entanglement wedge reconstruction conjecture as well as new physical insights.Most notably, we find that a bulk operator acting in a given boundary region's entanglement wedge can be expressed as the response of the boundary region's modular Hamiltonian to a perturbation of the bulk state in the direction of the bulk operator.This formula can be interpreted as a noncommutative version of Bayes's rule that attempts to undo the noise induced by restricting to only a portion of the boundary.To reach these conclusions, we extend the theory of universal recovery channels to finite-dimensional operator algebras and demonstrate that recovery channels approximately preserve the multiplicative structure of the operator algebra.
Bulk reconstruction is a central problem in AdS/CFT, and entanglement wedge reconstruction is its subregion version. We argue that this subregion statement should be separated from the stronger holographic quantum error correction interpretation, in which one region-independent logical bulk operator has code-preserving representatives in several boundary regions. A simple locality argument shows that such a common reconstruction must commute with the code-preserving local algebras in the complementary regions. This is the mechanism realized in HaPPY-type codes: the erased regions are blind to a protected logical algebra. An ordinary finite NNN holographic CFT does not have such a protected invisible sector for supergravity fields. Its low-energy local observables, in particular, suitably smeared stress tensors, detect the physical support and gravitational dressing of ordinary bulk operators, up to possible center or superselection data. Thus, there is no such holographic quantum error correction and the N=∞N=\inftyN=∞ agreement of global and subregion HKLL formulae is a free-theory statement. What remains is entanglement wedge reconstruction without holographic quantum error correction, or subregion complementarity: each boundary region has its own code-preserving low-energy algebra and its own region-adapted bulk interpretation, rather than a shared logical operator.