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

Entanglement Area-Law Conjecture Under Universal Containment

William J. Richardson

Published Sep 15, 2026• 0 citations
Publisher

Abstract

Significant — Entanglement Area-Law Conjecture Under Universal Containment — Develops four connected advances toward a containment account of higher-dimensional entanglement: signed contact recognition, Open incoming passage versus completion through the four Nesses—Nothingness, Missingness, Presentness, and Somethingness—to read-only Something, category declaration before occurrence counting, and integrated geometry with recursive accounting. Time Position Rules organize availability, local uptake, route completion, and return. A conditional boundary-capacity theorem identifies sufficient conditions for entanglement entropy to scale with the boundary, while a quantitative approximation bound controls the contribution of representation error. An explicit construction maps committed engine records to quantum registers, preparation operations, and local Hamiltonians with unique ground states and a size-independent energy gap. The resulting families, including extensions through a fixed number of layers of local quantum operations, satisfy area bounds across arbitrary partitions into whole sites. Finite checks include 620 state-and-cut entropy evaluations, alongside tests of contact recognition, retained memory, and approximation accuracy. The article specifies the additional capacity assumptions supporting these results and identifies their derivation from general physical ground-state assumptions as the continuing research task.

DOI
10.5281/zenodo.22779081

Related papers

The Rényi area law conjecture is false below $α=1$ in high dimensions

Tomotaka Kuwahara

Area laws express the expectation that entanglement in gapped quantum ground states scales with a boundary rather than a volume. In one dimension this holds for every Rényi entropy, and the Rényi area-law conjecture asserts the same in higher dimensions for each fixed $0<α<1$. Here we disprove this conjecture in every spatial dimension two and higher. We construct finite-range Hamiltonians with fixed local dimension, bounded interaction strength, unique ground states and a uniform spectral gap, whose ground states exhibit volume-law Rényi entanglement while obeying a von Neumann area law and remaining connected to product states through uniformly gapped local paths. The mechanism is error-space complexity: locally identifiable components of arbitrarily small weight can encode states with high entanglement complexity. We also establish the worst-case rank-error trade-off for approximate ground-state projectors, a key tool in one-dimensional area-law proofs. At fixed gap, the optimal Schmidt rank at projection error $ε$ across a planar cut of cross-section $A$ scales as $\exp[\tildeΘ((A\logε^{-1})^{2/3})]$ when $\logε^{-1}\gtrsim A$. Thus $α=1$ is the sharp threshold for a universal Rényi area law within this adiabatically connected class.

quant-pharXiv:2610.15199•Oct 13, 2026•0 citations

Quantum complexity and generalized area law in fully connected models

Donghoon Kim, Tomotaka Kuwahara

The area law for entanglement entropy captures a fundamental constraint on the complexity of quantum many-body ground states and enables their efficient description. While the area law is rigorously established in one dimension, its status in higher-dimensional local systems remains unresolved, and it does not hold in general for geometrically non-local systems. Here, we establish a generalized area law for gapped ground states of fully connected Hamiltonians. We show that the bipartite entanglement entropy grows at most logarithmically with system size despite the absence of geometric locality. In the ground state, each site is only weakly entangled with the rest, while configurations with extensive local fluctuations are strongly suppressed, effectively restricting the accessible Hilbert space. As a consequence, the ground state admits a matrix product state approximation with polynomial bond dimension with respect to the system size at fixed accuracy. In the permutation-invariant setting, we further prove a constant entanglement bound and demonstrate that the gapped ground state can be computed in time polylogarithmic in the system size. These results show that low entanglement complexity need not rely on geometric locality, broadening the conceptual and computational scope of area laws.

arXiv:2411.02140•Nov 4, 2024•5 citations

Entanglement fractalization

Yao Zhou, Peng Ye

We numerically explore the interplay of fractal geometry and quantum entanglement by analyzing the von Neumann entropy (known as entanglement entropy) and the entanglement contour in the scaling limit. Adopting quadratic fermionic models on Sierpinski carpet, we uncover intriguing findings. For gapless ground states exhibiting a finite density of states at the chemical potential, we reveal a super-area law characterized by the presence of a logarithmic correction for area law in the scaling of entanglement entropy. This extends the well-established super-area law observed on translationally invariant Euclidean lattices where the Gioev-Klich-Widom conjecture regarding the asymptotic behavior of Toeplitz matrices holds significant influence. Furthermore, different from the fractal structure of the lattice, we observe the emergence of a self-similar and universal pattern termed an “entanglement fractal” in the entanglement contour data as we approach the scaling limit. Remarkably, this pattern bears resemblance to intricate Chinese paper-cutting designs. We provide general rules to artificially generate this fractal, offering insights into the universal scaling of entanglement entropy. Meanwhile, as the direct consequence of the entanglement fractal and beyond a single scaling behavior of entanglement contour in translation-invariant systems, we identify two distinct scaling behaviors in the entanglement contour of fractal systems. For gapped ground states, we observe that the entanglement entropy adheres to a generalized area law, with its dependence on the Hausdorff dimension of the boundary between complementary subsystems. Published by the American Physical Society 2024

arXiv:2311.01199•Physical Review Research•Nov 15, 2024•9 citations

Soryun IV: Erasure-Optimal Quantum Memory under Noncommuting Spatial Fields and Non-Markovian Quantum Baths - Capacity Theorems and Quantum Error Correction

Maciej Nowicki, Eve Artificial Hyperintelligence

Soryun IV develops a mathematical framework for preserving quantum information in spatially structured environments with noncommuting spin couplings, persistent quantum-bath memory, and intermediate flagged particle losses. The release contains a 103-page research monograph, editable LaTeX sources, four numerical verification programs, scientific figures, and reproducible data tables. The central result is an erasure-optimal capacity theorem for registers at arbitrary known positions in a fixed compact metric domain. Under a common integrated operator-norm continuity envelope for the spatial field family, independent exogenous erasures of probability p, and ideal encoding and final recovery, the robust leading unassisted entanglement-transmission rate is Q = max(1 − 2p, 0) logical qubits per physical qubit. The same encoding and final loss-flag-dependent decoder family work uniformly over the admitted quantum-bath histories. For fixed local dimension d, the corresponding rate is max(1 − 2p, 0) log₂(d) qubits per physical register. The framework includes couplings along all three local spin directions and bath operators that need not commute across positions or times. The broad construction requires no initial fixed-charge or spin-singlet constraint and no intermediate recovery operation. Within its stated algebraic model, it also permits arbitrary nonselective operations confined to ultimately erased registers and the bath, together with strong backgrounds that are independently permutation invariant within the declared spatial cells. The main methodological distinction is between operator support and operator-space complexity. Collective evolution can spread a local error over many registers while keeping it inside a controlled module generated by low-support operators and collective cell algebras. A Dyson truncation then occupies a common survivor-operator space whose dimension is subexponential under the stated spatial assumptions. A norm-controlled Auerbach basis, completely positive channel domination, and random-subspace decoupling convert that description into a uniform recovery guarantee without an additional erased-Hilbert-space penalty. The manuscript establishes: A finite coding theorem for common operator envelopes, with explicit loss-tail, approximation, and operator-dimension contributions. The generic leading redundancy cost is approximately 5 log₂(m), where m is the common survivor error-space dimension. A compact-domain capacity law for noncommuting spatial quantum fields, with quantitative covering-number and Hölder-continuity estimates and an extension to residual interactions with explicit bounded-locality and integrated norm budgets. Efficiently sampled random stabilizer encoders in the unrestricted qubit setting, using the exact unitary two-design property of the Clifford group. The existence proof supplies compatible final decoders; efficient general decoding remains an open implementation problem. Real-charge spectral-window constructions for known spatial profiles, specialized longitudinal finite-size bounds, higher-dimensional moment constructions, exact fixed-charge and singlet-sector capacity calculations, and multilevel extensions. Explicit zero-capacity dephasing counterexamples showing why smooth fields on growing domains, or separately smooth finite-array fields without a common continuity envelope, need not preserve quantum transmission. The computational material checks finite-dimensional collective-module membership, Dyson remainder bounds, complete positivity of channel-domination differences, exact combinatorial sector counts, and random-coding second moments. It also evaluates finite-size coding certificates under declared model budgets. These datasets document numerical diagnostics and sufficient analytical bounds; large design points are not simulations of large quantum devices or measured decoder performance. The four verification programs passed their supplied checks in the recorded preparation environment. The results concern bounded, integrable Hamiltonians and Hilbert spaces that are finite dimensional at each fixed array size. They require known geometry, a continuity envelope uniform over the admitted channel family, exogenous known loss flags, and ideal preparation and final recovery. Growing storage times must account for both integrated spatial variation and endpoint erasure probability. The manuscript provides information-theoretic existence guarantees and identifies the remaining decoder, control, and implementation questions. Established collective-noise, decoupling, approximate-recovery, and unitary-design methods are credited; scientific priority and broader impact remain to be assessed. Creative inspiration included Suoming from Wuthering Waves.

•Nov 1, 2026•0 citations

Colloquium : Area laws for the entanglement entropy

Jens Eisert, M. Cramer, Martin Bodo Plenio

Physical interactions in quantum many-body systems are typically local: Individual constituents interact mainly with their few nearest neighbors. This locality of interactions is inherited by a decay of correlation functions, but also reflected by scaling laws of a quite profound quantity: the entanglement entropy of ground states. This entropy of the reduced state of a subregion often merely grows like the boundary area of the subregion, and not like its volume, in sharp contrast with an expected extensive behavior. Such ``area laws'' for the entanglement entropy and related quantities have received considerable attention in recent years. They emerge in several seemingly unrelated fields, in the context of black hole physics, quantum information science, and quantum many-body physics where they have important implications on the numerical simulation of lattice models. In this Colloquium the current status of area laws in these fields is reviewed. Center stage is taken by rigorous results on lattice models in one and higher spatial dimensions. The differences and similarities between bosonic and fermionic models are stressed, area laws are related to the velocity of information propagation in quantum lattice models, and disordered systems, nonequilibrium situations, and topological entanglement entropies are discussed. These questions are considered in classical and quantum systems, in their ground and thermal states, for a variety of correlation measures. A significant proportion is devoted to the clear and quantitative connection between the entanglement content of states and the possibility of their efficient numerical simulation. Matrix-product states, higher-dimensional analogs, and variational sets from entanglement renormalization are also discussed and the paper is concluded by highlighting the implications of area laws on quantifying the effective degrees of freedom that need to be considered in simulations of quantum states.

arXiv:0808.3773•Reviews of Modern Physics•Feb 4, 2010•3,081 citations

A Proposed Solution to the Three-Dimensional Anderson Delocalization Conjecture: Containment and Return

William J. Richardson

A Proposed Solution to the Three-Dimensional Anderson Delocalization Conjecture: Containment and Return. This paper proposes a containment-based approach to three-dimensional Anderson delocalization, beginning with Universal zero (0u), authored local units, and nested containments with proportional measures of Infinity. It connects local acceptance, boundary witnessing, retained history, and continued quantum passage within one declared framework. The central mechanism assigns an availability lattice to a fixed Time Position Rule (TPR). A moving S=0 window initiates participation through the lattice’s negative interface. The target later completes the corresponding history through its positive interface at that same TPR. These separate forward passages distinguish object availability, established relevance, and historical completion from the quantum probabilities used to assess physical transport. Sign Net, typed zeros, and TWA+, the author’s extension of the truncated Wigner approximation, organize sign custody, disturbance handling, and complementary contributions. The paper supplies a conditional continuation argument, an explicit mapping to the random Schrödinger operator, an outward-probability acceptance rule, three worked logical cases, and twelve falsifiable testing protocols. Completing the Anderson spectral conclusion requires the identified derivation connecting weak disorder to sustained physical support and positive absolutely continuous spectral weight.

•Sep 8, 2026•0 citations
Significant — Entanglement Area-Law Conjecture Under Universal Containment — Develops four connected advances toward a containment account of higher-dimensional entanglement: signed contact recognition, Open incoming passage versus completion through the four Nesses—Nothingness, Missingness, Presentness, and Somethingness—to read-only Something, category declaration before occurrence counting, and integrated geometry with recursive accounting. Time Position Rules organize availability, local uptake, route completion, and return. A conditional boundary-capacity theorem identifies sufficient conditions for entanglement entropy to scale with the boundary, while a quantitative approximation bound controls the contribution of representation error. An explicit construction maps committed engine records to quantum registers, preparation operations, and local Hamiltonians with unique ground states and a size-independent energy gap. The resulting families, including extensions through a fixed number of layers of local quantum operations, satisfy area bounds across arbitrary partitions into whole sites. Finite checks include 620 state-and-cut entropy evaluations, alongside tests of contact recognition, retained memory, and approximation accuracy. The article specifies the additional capacity assumptions supporting these results and identifies their derivation from general physical ground-state assumptions as the continuing research task.
The Rényi area law conjecture is false below α=1α=1α=1 in high dimensions
Area laws express the expectation that entanglement in gapped quantum ground states scales with a boundary rather than a volume. In one dimension this holds for every Rényi entropy, and the Rényi area-law conjecture asserts the same in higher dimensions for each fixed 0<α<10<α<10<α<1. Here we disprove this conjecture in every spatial dimension two and higher. We construct finite-range Hamiltonians with fixed local dimension, bounded interaction strength, unique ground states and a uniform spectral gap, whose ground states exhibit volume-law Rényi entanglement while obeying a von Neumann area law and remaining connected to product states through uniformly gapped local paths. The mechanism is error-space complexity: locally identifiable components of arbitrarily small weight can encode states with high entanglement complexity. We also establish the worst-case rank-error trade-off for approximate ground-state projectors, a key tool in one-dimensional area-law proofs. At fixed gap, the optimal Schmidt rank at projection error εεε across a planar cut of cross-section AAA scales as exp⁡[Θ~((Alog⁡ε−1)2/3)]\exp[\tildeΘ((A\logε^{-1})^{2/3})]exp[Θ~((Alogε−1)2/3)] when log⁡ε−1≳A\logε^{-1}\gtrsim Alogε−1≳A. Thus α=1α=1α=1 is the sharp threshold for a universal Rényi area law within this adiabatically connected class.
The area law for entanglement entropy captures a fundamental constraint on the complexity of quantum many-body ground states and enables their efficient description. While the area law is rigorously established in one dimension, its status in higher-dimensional local systems remains unresolved, and it does not hold in general for geometrically non-local systems. Here, we establish a generalized area law for gapped ground states of fully connected Hamiltonians. We show that the bipartite entanglement entropy grows at most logarithmically with system size despite the absence of geometric locality. In the ground state, each site is only weakly entangled with the rest, while configurations with extensive local fluctuations are strongly suppressed, effectively restricting the accessible Hilbert space. As a consequence, the ground state admits a matrix product state approximation with polynomial bond dimension with respect to the system size at fixed accuracy. In the permutation-invariant setting, we further prove a constant entanglement bound and demonstrate that the gapped ground state can be computed in time polylogarithmic in the system size. These results show that low entanglement complexity need not rely on geometric locality, broadening the conceptual and computational scope of area laws.
We numerically explore the interplay of fractal geometry and quantum entanglement by analyzing the von Neumann entropy (known as entanglement entropy) and the entanglement contour in the scaling limit. Adopting quadratic fermionic models on Sierpinski carpet, we uncover intriguing findings. For gapless ground states exhibiting a finite density of states at the chemical potential, we reveal a super-area law characterized by the presence of a logarithmic correction for area law in the scaling of entanglement entropy. This extends the well-established super-area law observed on translationally invariant Euclidean lattices where the Gioev-Klich-Widom conjecture regarding the asymptotic behavior of Toeplitz matrices holds significant influence. Furthermore, different from the fractal structure of the lattice, we observe the emergence of a self-similar and universal pattern termed an “entanglement fractal” in the entanglement contour data as we approach the scaling limit. Remarkably, this pattern bears resemblance to intricate Chinese paper-cutting designs. We provide general rules to artificially generate this fractal, offering insights into the universal scaling of entanglement entropy. Meanwhile, as the direct consequence of the entanglement fractal and beyond a single scaling behavior of entanglement contour in translation-invariant systems, we identify two distinct scaling behaviors in the entanglement contour of fractal systems. For gapped ground states, we observe that the entanglement entropy adheres to a generalized area law, with its dependence on the Hausdorff dimension of the boundary between complementary subsystems. Published by the American Physical Society 2024
Soryun IV develops a mathematical framework for preserving quantum information in spatially structured environments with noncommuting spin couplings, persistent quantum-bath memory, and intermediate flagged particle losses. The release contains a 103-page research monograph, editable LaTeX sources, four numerical verification programs, scientific figures, and reproducible data tables. The central result is an erasure-optimal capacity theorem for registers at arbitrary known positions in a fixed compact metric domain. Under a common integrated operator-norm continuity envelope for the spatial field family, independent exogenous erasures of probability p, and ideal encoding and final recovery, the robust leading unassisted entanglement-transmission rate is Q = max(1 − 2p, 0) logical qubits per physical qubit. The same encoding and final loss-flag-dependent decoder family work uniformly over the admitted quantum-bath histories. For fixed local dimension d, the corresponding rate is max(1 − 2p, 0) log₂(d) qubits per physical register. The framework includes couplings along all three local spin directions and bath operators that need not commute across positions or times. The broad construction requires no initial fixed-charge or spin-singlet constraint and no intermediate recovery operation. Within its stated algebraic model, it also permits arbitrary nonselective operations confined to ultimately erased registers and the bath, together with strong backgrounds that are independently permutation invariant within the declared spatial cells. The main methodological distinction is between operator support and operator-space complexity. Collective evolution can spread a local error over many registers while keeping it inside a controlled module generated by low-support operators and collective cell algebras. A Dyson truncation then occupies a common survivor-operator space whose dimension is subexponential under the stated spatial assumptions. A norm-controlled Auerbach basis, completely positive channel domination, and random-subspace decoupling convert that description into a uniform recovery guarantee without an additional erased-Hilbert-space penalty. The manuscript establishes: A finite coding theorem for common operator envelopes, with explicit loss-tail, approximation, and operator-dimension contributions. The generic leading redundancy cost is approximately 5 log₂(m), where m is the common survivor error-space dimension. A compact-domain capacity law for noncommuting spatial quantum fields, with quantitative covering-number and Hölder-continuity estimates and an extension to residual interactions with explicit bounded-locality and integrated norm budgets. Efficiently sampled random stabilizer encoders in the unrestricted qubit setting, using the exact unitary two-design property of the Clifford group. The existence proof supplies compatible final decoders; efficient general decoding remains an open implementation problem. Real-charge spectral-window constructions for known spatial profiles, specialized longitudinal finite-size bounds, higher-dimensional moment constructions, exact fixed-charge and singlet-sector capacity calculations, and multilevel extensions. Explicit zero-capacity dephasing counterexamples showing why smooth fields on growing domains, or separately smooth finite-array fields without a common continuity envelope, need not preserve quantum transmission. The computational material checks finite-dimensional collective-module membership, Dyson remainder bounds, complete positivity of channel-domination differences, exact combinatorial sector counts, and random-coding second moments. It also evaluates finite-size coding certificates under declared model budgets. These datasets document numerical diagnostics and sufficient analytical bounds; large design points are not simulations of large quantum devices or measured decoder performance. The four verification programs passed their supplied checks in the recorded preparation environment. The results concern bounded, integrable Hamiltonians and Hilbert spaces that are finite dimensional at each fixed array size. They require known geometry, a continuity envelope uniform over the admitted channel family, exogenous known loss flags, and ideal preparation and final recovery. Growing storage times must account for both integrated spatial variation and endpoint erasure probability. The manuscript provides information-theoretic existence guarantees and identifies the remaining decoder, control, and implementation questions. Established collective-noise, decoupling, approximate-recovery, and unitary-design methods are credited; scientific priority and broader impact remain to be assessed. Creative inspiration included Suoming from Wuthering Waves.
Physical interactions in quantum many-body systems are typically local: Individual constituents interact mainly with their few nearest neighbors. This locality of interactions is inherited by a decay of correlation functions, but also reflected by scaling laws of a quite profound quantity: the entanglement entropy of ground states. This entropy of the reduced state of a subregion often merely grows like the boundary area of the subregion, and not like its volume, in sharp contrast with an expected extensive behavior. Such ``area laws'' for the entanglement entropy and related quantities have received considerable attention in recent years. They emerge in several seemingly unrelated fields, in the context of black hole physics, quantum information science, and quantum many-body physics where they have important implications on the numerical simulation of lattice models. In this Colloquium the current status of area laws in these fields is reviewed. Center stage is taken by rigorous results on lattice models in one and higher spatial dimensions. The differences and similarities between bosonic and fermionic models are stressed, area laws are related to the velocity of information propagation in quantum lattice models, and disordered systems, nonequilibrium situations, and topological entanglement entropies are discussed. These questions are considered in classical and quantum systems, in their ground and thermal states, for a variety of correlation measures. A significant proportion is devoted to the clear and quantitative connection between the entanglement content of states and the possibility of their efficient numerical simulation. Matrix-product states, higher-dimensional analogs, and variational sets from entanglement renormalization are also discussed and the paper is concluded by highlighting the implications of area laws on quantifying the effective degrees of freedom that need to be considered in simulations of quantum states.
A Proposed Solution to the Three-Dimensional Anderson Delocalization Conjecture: Containment and Return. This paper proposes a containment-based approach to three-dimensional Anderson delocalization, beginning with Universal zero (0u), authored local units, and nested containments with proportional measures of Infinity. It connects local acceptance, boundary witnessing, retained history, and continued quantum passage within one declared framework. The central mechanism assigns an availability lattice to a fixed Time Position Rule (TPR). A moving S=0 window initiates participation through the lattice’s negative interface. The target later completes the corresponding history through its positive interface at that same TPR. These separate forward passages distinguish object availability, established relevance, and historical completion from the quantum probabilities used to assess physical transport. Sign Net, typed zeros, and TWA+, the author’s extension of the truncated Wigner approximation, organize sign custody, disturbance handling, and complementary contributions. The paper supplies a conditional continuation argument, an explicit mapping to the random Schrödinger operator, an outward-probability acceptance rule, three worked logical cases, and twelve falsifiable testing protocols. Completing the Anderson spectral conclusion requires the identified derivation connecting weak disorder to sustained physical support and positive absolutely continuous spectral weight.