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

Emergence of Distance from a Quantum Family Tree

Kevin Donahue

Published Mar 30, 2026• 0 citations
Publisher

Abstract

This is an update to a previous paper with the same title: Abstract We study von Neumann entropy in the Quantum Family Tree (QFT) model — a binary Bruhat–Tits tree whose bonds carry independent Haar-random U(4) gates. For an interval A of size 2^k boundary sites, the quenched entropy S_VN(A) grows linearly with k in the deep-tree limit. We measure the slope c_VN and find c_VN = m² × c_RT, m² = 3/10 where c_RT = 3 log₂(5/2) is the classical mutual-information (Ryu–Takayanagi-like) coefficient. The measurement uses six independent tree depths (D = 20–150) and yields c_VN = 1.18845 ± 0.00116 bits confirming the ratio β₁ = c_VN/(3c_RT) = 1/10 within 1.1σ, and strongly disfavoring the nearest alternative β₁ = 10/99. We prove: (i) η₂ = 2/5 exactly via Weingarten calculus; (ii) a rank-2 bound on ρ_A for aligned intervals within the QFT construction; and (iii) the first-law identity δ⟨H_A⟩/δS = 1 for k=1. We identify the Choi-boundary state as a two-chain Matrix Product Density Operator (MPDO) with bond dimension 2 and transfer matrix spectrum {1, η₂ = 2/5}. This model reproduces both the von Neumann and Rényi-2 entropies across all tested scales and depths to sub-percent accuracy with no adjustable parameters beyond η₂ fixed by Weingarten calculus. The quenched Rényi-2 rate is consistent with the exact rational value h_S2 = 14/45 (0.07σ) and the annealed Rényi-2 rate with 8/27, with Jensen gap ratio 21/20 exactly. We derive the identity m² = (1 − η₂)/2 within the Choi-boundary MPDO framework, which reduces the entropy-rate conjecture c_VN = m²·c_RT to computing the von Neumann entropy rate of this specific MPDO.

DOI
10.5281/zenodo.19334979

Related papers

Emergence of Distance from a Quantum Family Tree

Kevin Donahue

Abstract We introduce the Quantum Family Tree (QFT), a solvable model in which spatial distance emerges from genealogical structure in a randomly branching quantum process. The model is realized as a binary Bruhat–Tits tree whose edges carry independent Haar-random U4 unitaries. Boundary states are generated by recursive channel composition from the root, producing a random Matrix Product Density Operator (MPDO) with bond dimension 2. For an interval of size 2k, the quenched von Neumann entropy grows linearly with k in the deep-tree limit. Extensive numerical measurements across six independent depths (D=20–150) yield cVN=1.188450.00116 bits, consistent with cVN=m2 cRT, m2=310, cRT=3log252, and strongly disfavoring nearby rational alternatives at >10σ. We establish the full structural backbone underlying this result. Specifically, we prove: (i) the exact purity eigenvalue 2=2/5 via Weingarten calculus; (ii) an exact two-component purity recursion in the {SWAP,TrTr} basis; (iii) a Standard Sector Projection Theorem restricting all replica contributions to a two-dimensional subspace {1,2}; and (iv) an identification of the boundary state as a two-chain MPDO with transfer spectrum {1,2}, reproducing both von Neumann and Rényi-2 entropies to sub-percent accuracy. These results reduce the entropy-rate problem exactly to a single scalar quantity—the sector weight w2, governing the projection of the standard sector in the von Neumann limit. We formulate this as an explicit conjecture (Lemma D): w2=1−2/2=3/10. The conjectured value is confirmed numerically to 10.34σ but remains analytically open. The work isolates a well-posed and previously uncharacterized problem: the evaluation of the quenched von Neumann entropy rate of a random MPDO with known transfer spectrum. All other components of the entropy-rate structure are established exactly. The quenched Rényi-2 rate is consistent with hS2=14/45 (0.07σ) and the annealed rate with 8/27, with Jensen gap 21/20.

•Apr 8, 2026•0 citations

Emergence of Distance from a Quantum Family Tree

Kevin Donahue

Update from prior version. Abstract The Quantum Family Tree (QFT) theory proposes that spatial distance emerges as a measure of kinship difference within a quantum genealogical tree: sites that share a recent common ancestor are near, while sites whose lineages diverge deep in the tree are far apart. In this framework, geometry is not fundamental but inherited – the entanglement structure of a randomly branching quantum process encodes a notion of distance that reproduces, in a precise quantitative sense, the entropy–area relation of holographic gravity. We realize this proposal in a concrete solvable model – a binary Bruhat–Tits tree whose bonds carry independent Haar-random U(4) gates. For an interval A of size 2^k boundary sites, the quenched von Neumann entropy S_VN(A) grows linearly with k in the deep-tree limit. We measure the slope c_VN and find c_VN = m² × c_RT, m² = 3/10 where c_RT = 3 log₂(5/2) is the classical mutual-information (Ryu–Takayanagi-like) coefficient. The measurement uses six independent tree depths (D = 20–150) and yields c_VN = 1.18845 ± 0.00116 bits confirming the ratio β₁ = c_VN/(3c_RT) = 1/10 within 1.1σ, and strongly disfavoring the nearest alternative β₁ = 10/99. We prove: (i) η₂ = 2/5 exactly via Weingarten calculus; (ii) a rank-2 bound on ρ_A for aligned intervals within the QFT construction; (iii) the first-law identity δ⟨H_A⟩/δS = 1 for k=1; and (iv) an exact 2-component purity recursion in the {SWAP, TrTr} basis that captures the full position-averaged Rényi-2 structure of the boundary state without Monte Carlo. The purity kernel at each tree node decomposes as M = b·SWAP + c·TrTr, reducing the 16-dimensional recursion to two components with exact rational coefficients. The carry eigenvalue η₂ = 2/5 is proved to be q-independent (verified at q = 2, 3, 4 with multiplicities C(q,2)), and the straddle algebra at O(ε) near q = 1 is additive rather than bilinear. These two facts – q-independence of dynamics and O(ε) additivity – imply that the entire proof of c_VN = m²·c_RT reduces to a single remaining representation-theoretic computation: the sector weight w₂ governing how the SWAP sector contributes to von Neumann entropy at q → 1. We predict w₂ = (1 − η₂)/2 = 3/10 = m². We identify the Choi-boundary state as a two-chain Matrix Product Density Operator (MPDO) with bond dimension 2 and transfer matrix spectrum {1, η₂ = 2/5}. We reduce the entropy-rate problem exactly to a single scalar quantity – the sector weight w₂ – eliminating the need for large-depth recursion or asymptotic analysis. This model reproduces both the von Neumann and Rényi-2 entropies across all tested scales and depths to sub-percent accuracy with no adjustable parameters beyond η₂ fixed by Weingarten calculus. The quenched Rényi-2 rate is consistent with the exact rational value h_S2 = 14/45 (0.07σ) and the annealed Rényi-2 rate with 8/27, with Jensen gap ratio 21/20 exactly.

•Apr 2, 2026•0 citations

Emergence of Distance from a Quantum Family Tree

Kevin Donahue

This paper is an update that includes LEAN4 Validation. We introduce the Quantum Family Tree, a branching quantum circuit defined on a binary (Bruhat–Tits) tree in which each internal node applies an independent Haar-random two-qubit unitary. In this model, entanglement is organized by genealogical distance: two particles are less entangled the further back their lowest common ancestor lies. We show that the expected von Neumann entropy of an interval of size 2k2^k2k grows linearly with the number of generations kkk, SVN(k)=cVN3 k,S_{VN}(k) = \frac{c_{VN}}{3}\,k,SVN(k)=3cVNk, with coefficient cVN=910log⁡2 ⁣(52)≈1.1897 bits.c_{VN} = \frac{9}{10}\log_2\!\left(\frac{5}{2}\right) \approx 1.1897 \ \text{bits}.cVN=109log2(25)≈1.1897 bits. This result is derived from first principles. A single Haar average yields the exact purity η2=2/5\eta_2 = 2/5η2=2/5, which determines both a scaling dimension Δ=log⁡2(5/2)\Delta = \log_2(5/2)Δ=log2(5/2) and a bulk mass parameter m2=3/10m^2 = 3/10m2=3/10. The resulting cascade propagator is shown to be an eigenmode of the p-adic Laplacian, satisfying a discrete Klein–Gordon equation on the tree. The entropy coefficient is then obtained by relating this structure to known results in p-adic AdS/CFT. The prediction is confirmed numerically across tree depths D=20D = 20D=20 to 150150150 (up to 500 independent realizations per depth), with a 10.34σ separation from the closest competing hypothesis. A Lean 4 formalization verifies all algebraic steps internal to the model, isolating three external inputs (Haar integration, p-adic entropy formula, and the entanglement first law). These results provide a concrete, exactly analyzable setting in which entanglement scaling, ultrametric geometry, and Klein–Gordon spectral structure emerge from a single random-unitary construction, with a fully identified path to a self-contained proof via harmonic analysis.

•Mar 25, 2026•0 citations

Emergence of Distance from a Quantum Family Tree

Kevin Donahue

We introduce a branching quantum circuit on a binary (Bruhat–Tits) tree in which each internal node applies an independent Haar-random two-qubit unitary, and show that entanglement organizes along genealogical distance. For two particles separated by k generations, the expected von Neumann entropy of an interval of size 2k grows linearly: S_{VN}(k) = (c_{VN}/3)·k, with exact coefficient c_{VN} = m²·c_{RT} = (9/10)·log₂(5/2) ≈ 1.1897 bits. Both inputs are derived from first principles: a single Haar average yields η₂ = 2/5, from which we obtain the boundary scaling dimension Δ = log₂(5/2), the bulk mass m² = 3/10, and a cascade propagator that is an eigenmode of the p-adic Laplacian, satisfying a discrete Klein–Gordon equation. This matches the spectral data of a p-adic bulk field. Invoking the p-adic AdS/CFT entropy formula of Gubser–Heydeman–Parra-Martinez–Parikh (2016) then fixes the entropy coefficient, giving c_{VN} = m²·c_{RT}. The result is confirmed numerically up to depth D = 50 at 10.34σ. A fully self-contained proof is reduced to a single analytic continuation problem (Conjecture~1), formulated in terms of Selberg integrals and spherical functions on SU(4)/S(U(2)×U(2)). Together with a numerical verification of the entanglement first law in the same model, these results provide a concrete setting in which entanglement scaling, ultrametric geometry, and a Klein–Gordon spectrum emerge from a single random-unitary construction.

•Mar 24, 2026•0 citations

Exact Properties of Néel Cat States and Constant Entanglement at a Special Ordered Point of the Hierarchical Quantum Ising Model

Garoual, Anass

This preprint studies the hierarchical quantum transverse-field Ising model (HQTFIM) with couplings defined by a 2-adic hierarchy, 𝐽 𝑖 𝑗 ∝ 2 − 𝛼 𝑣 2 ( 𝑗 − 𝑖 ) J ij ∝2 −αv 2 (j−i) . Building on the classical Dyson hierarchical Ising model, we construct an explicit block renormalization scheme for the dimensionless transverse field 𝑥 = ℎ / 𝐽 x=h/J and derive a closed RG map with a non-trivial fixed point 𝑥 \* ( 𝛼 ) x \* (α). The corresponding field ℎ \* ( 𝛼 ) = 𝑥 \* ( 𝛼 ) 𝐽 0 h \* (α)=x \* (α)J 0 is interpreted as an “RG self-similarity field” deep inside the ordered phase. On the analytical side, we prove two exact structural results for the ideal Néel cat state |psi_cat> = (|Néel> + |anti-Néel>)/sqrt(2) on chains of length N = 2^H. First, for any dyadic bipartition A:B, the von Neumann entanglement entropy of the reduced state on A is exactly one bit. Second, we construct an explicit tree tensor network (TTN) representation of |psi_cat> on a depth-H binary tree with bond dimension chi = 2, independent of system size. This makes precise in what sense the Néel cat is an extreme example of an area-law state with a simple tensor-network structure. On the numerical side, we use dense exact diagonalization (Python / NumPy / SciPy) to compare the HQTFIM to the standard one-dimensional nearest-neighbour transverse-field Ising model (TFIM). For alpha = 1.5 and h/J0 = x^*(1.5) ≈ 0.404, the HQTFIM ground state in the even-parity sector exhibits: (i) a fidelity F_N with the ideal Néel cat that increases with N; (ii) a half-chain entanglement entropy S_N pinned extremely close to one bit; and (iii) a staggered order parameter M_stagg^2 very close to one. By contrast, the standard TFIM at the same ratio h/J has essentially zero Néel-cat fidelity and negligible staggered order. We further compare the HQTFIM at h = h^*(alpha) with the standard TFIM at its exact critical point h_c = J. The standard TFIM shows the expected logarithmic growth of entanglement, S_N ~ (c/3) log N with an effective central charge c_eff ≈ 0.7 on the small system sizes we access, and vanishing staggered order. In sharp contrast, at h^*(alpha) the HQTFIM shows entanglement consistent with a strict area law, S_N → 1 bit, and strong Néel order. A numerical scan in h for fixed N identifies a “true” critical field h_c(alpha) for the HQTFIM from the rapid drop of M_stagg^2(h); we find h_c(alpha) >> h^*(alpha), with ratios between ~5 and ~28 over alpha in [1.2, 3.0]. Thus the RG self-similarity field h^*(alpha) is not a quantum critical point but a special ordered-phase point with an unusually clean Néel-cat ground state. Finally, we characterize finite-size corrections at h^*(alpha) via power-law fits 1 − F_N ~ N^{-beta(alpha)} and 1 − M_stagg^2 ~ N^{-gamma(alpha)}, with beta(alpha) ≈ 1 and gamma(alpha) ≈ 1.8–2.1 and a systematic but mild dependence on alpha. We clearly separate mathematically rigorous statements (block spectrum, exact entanglement, TTN construction) from numerical or conjectural claims (properties of the HQTFIM in the thermodynamic limit and the location/universality class of the true critical point). The work suggests a concrete set of open problems on rigorous phase diagrams, entanglement scaling, and excitation spectra for quantum hierarchical models.

•Dec 7, 2025•0 citations

A Solvable P-adic Random Tensor Cascade with an Exact Bulk–Boundary Dictionary: Holographic Features, Perturbation Experiments, and the Weingarten-to-CFT Chain

Kevin Donahue

Abstract We construct a solvable p-adic random tensor model exhibiting an exact bulk–boundary correspondence with holographic features. A binary tree of Haar-random quantum operations on the Bruhat-Tits tree T₂ produces a boundary quantum state whose entanglement structure is consistent with a p-adic conformal field theory. Key CFT data — including the scaling dimension, bulk scalar mass, and leading non-Gaussian coupling — are derived from the Weingarten moments of the random tensors with no free parameters. We derive a bulk–boundary dictionary for two-point observables and modular Hamiltonian structure: the mean mutual information is consistent with the boundary two-point function of a free scalar with Δ=log₂(5/2) and m²=3/10; the modular Hamiltonian admits a decomposition H_A = H_Aᵐᵉʳᵉᵉ + g·δH_A where g = η₄/η₂² − 1 = 9/56 is derived from the fourth Weingarten moment; and the weight function w(v) = K(v,A) = (η₂/2)^{depth(v)} is the unique quasi-local weight in the 13/28 eigenspace of the transfer operator. We test the holographic dictionary under two bulk perturbations. Experiment A (ER=EPR): severing the root edge destroys cross-half mutual information exactly while releasing monogamy to saturate intra-half entanglement at the Page entropy. Experiment D (RT locality): a mid-tree defect reduces mutual information to zero for all boundary pairs whose minimal geodesic crosses the defect, while leaving remote pairs unchanged to within 1%. Both effects are predicted from the Weingarten structure alone. The entire structure — exact results, derivations, and experimental observations — follows from two numbers: η₂ = 2/5 and η₄ = 13/70. The p-adic cascade is structurally distinct from finite-D U(D) Haar cascades; the latter approach the p-adic fixed point at large D but do not realise it exactly. Numerical validation is performed using large-D U(D) cascades, which approximate but do not realise the p-adic fixed point exactly. Keywords: p-adic AdS/CFT, Bruhat-Tits tree, random tensor network, Weingarten calculus, modular Hamiltonian, ER=EPR, Ryu-Takayanagi, holographic entanglement

•Mar 19, 2026•0 citations
This is an update to a previous paper with the same title: Abstract We study von Neumann entropy in the Quantum Family Tree (QFT) model — a binary Bruhat–Tits tree whose bonds carry independent Haar-random U(4) gates. For an interval A of size 2^k boundary sites, the quenched entropy S_VN(A) grows linearly with k in the deep-tree limit. We measure the slope c_VN and find c_VN = m² × c_RT, m² = 3/10 where c_RT = 3 log₂(5/2) is the classical mutual-information (Ryu–Takayanagi-like) coefficient. The measurement uses six independent tree depths (D = 20–150) and yields c_VN = 1.18845 ± 0.00116 bits confirming the ratio β₁ = c_VN/(3c_RT) = 1/10 within 1.1σ, and strongly disfavoring the nearest alternative β₁ = 10/99. We prove: (i) η₂ = 2/5 exactly via Weingarten calculus; (ii) a rank-2 bound on ρ_A for aligned intervals within the QFT construction; and (iii) the first-law identity δ⟨H_A⟩/δS = 1 for k=1. We identify the Choi-boundary state as a two-chain Matrix Product Density Operator (MPDO) with bond dimension 2 and transfer matrix spectrum {1, η₂ = 2/5}. This model reproduces both the von Neumann and Rényi-2 entropies across all tested scales and depths to sub-percent accuracy with no adjustable parameters beyond η₂ fixed by Weingarten calculus. The quenched Rényi-2 rate is consistent with the exact rational value h_S2 = 14/45 (0.07σ) and the annealed Rényi-2 rate with 8/27, with Jensen gap ratio 21/20 exactly. We derive the identity m² = (1 − η₂)/2 within the Choi-boundary MPDO framework, which reduces the entropy-rate conjecture c_VN = m²·c_RT to computing the von Neumann entropy rate of this specific MPDO.
Abstract We introduce the Quantum Family Tree (QFT), a solvable model in which spatial distance emerges from genealogical structure in a randomly branching quantum process. The model is realized as a binary Bruhat–Tits tree whose edges carry independent Haar-random U4 unitaries. Boundary states are generated by recursive channel composition from the root, producing a random Matrix Product Density Operator (MPDO) with bond dimension 2. For an interval of size 2k, the quenched von Neumann entropy grows linearly with k in the deep-tree limit. Extensive numerical measurements across six independent depths (D=20–150) yield cVN=1.188450.00116 bits, consistent with cVN=m2 cRT, m2=310, cRT=3log252, and strongly disfavoring nearby rational alternatives at >10σ. We establish the full structural backbone underlying this result. Specifically, we prove: (i) the exact purity eigenvalue 2=2/5 via Weingarten calculus; (ii) an exact two-component purity recursion in the {SWAP,TrTr} basis; (iii) a Standard Sector Projection Theorem restricting all replica contributions to a two-dimensional subspace {1,2}; and (iv) an identification of the boundary state as a two-chain MPDO with transfer spectrum {1,2}, reproducing both von Neumann and Rényi-2 entropies to sub-percent accuracy. These results reduce the entropy-rate problem exactly to a single scalar quantity—the sector weight w2, governing the projection of the standard sector in the von Neumann limit. We formulate this as an explicit conjecture (Lemma D): w2=1−2/2=3/10. The conjectured value is confirmed numerically to 10.34σ but remains analytically open. The work isolates a well-posed and previously uncharacterized problem: the evaluation of the quenched von Neumann entropy rate of a random MPDO with known transfer spectrum. All other components of the entropy-rate structure are established exactly. The quenched Rényi-2 rate is consistent with hS2=14/45 (0.07σ) and the annealed rate with 8/27, with Jensen gap 21/20.
Update from prior version. Abstract The Quantum Family Tree (QFT) theory proposes that spatial distance emerges as a measure of kinship difference within a quantum genealogical tree: sites that share a recent common ancestor are near, while sites whose lineages diverge deep in the tree are far apart. In this framework, geometry is not fundamental but inherited – the entanglement structure of a randomly branching quantum process encodes a notion of distance that reproduces, in a precise quantitative sense, the entropy–area relation of holographic gravity. We realize this proposal in a concrete solvable model – a binary Bruhat–Tits tree whose bonds carry independent Haar-random U(4) gates. For an interval A of size 2^k boundary sites, the quenched von Neumann entropy S_VN(A) grows linearly with k in the deep-tree limit. We measure the slope c_VN and find c_VN = m² × c_RT, m² = 3/10 where c_RT = 3 log₂(5/2) is the classical mutual-information (Ryu–Takayanagi-like) coefficient. The measurement uses six independent tree depths (D = 20–150) and yields c_VN = 1.18845 ± 0.00116 bits confirming the ratio β₁ = c_VN/(3c_RT) = 1/10 within 1.1σ, and strongly disfavoring the nearest alternative β₁ = 10/99. We prove: (i) η₂ = 2/5 exactly via Weingarten calculus; (ii) a rank-2 bound on ρ_A for aligned intervals within the QFT construction; (iii) the first-law identity δ⟨H_A⟩/δS = 1 for k=1; and (iv) an exact 2-component purity recursion in the {SWAP, TrTr} basis that captures the full position-averaged Rényi-2 structure of the boundary state without Monte Carlo. The purity kernel at each tree node decomposes as M = b·SWAP + c·TrTr, reducing the 16-dimensional recursion to two components with exact rational coefficients. The carry eigenvalue η₂ = 2/5 is proved to be q-independent (verified at q = 2, 3, 4 with multiplicities C(q,2)), and the straddle algebra at O(ε) near q = 1 is additive rather than bilinear. These two facts – q-independence of dynamics and O(ε) additivity – imply that the entire proof of c_VN = m²·c_RT reduces to a single remaining representation-theoretic computation: the sector weight w₂ governing how the SWAP sector contributes to von Neumann entropy at q → 1. We predict w₂ = (1 − η₂)/2 = 3/10 = m². We identify the Choi-boundary state as a two-chain Matrix Product Density Operator (MPDO) with bond dimension 2 and transfer matrix spectrum {1, η₂ = 2/5}. We reduce the entropy-rate problem exactly to a single scalar quantity – the sector weight w₂ – eliminating the need for large-depth recursion or asymptotic analysis. This model reproduces both the von Neumann and Rényi-2 entropies across all tested scales and depths to sub-percent accuracy with no adjustable parameters beyond η₂ fixed by Weingarten calculus. The quenched Rényi-2 rate is consistent with the exact rational value h_S2 = 14/45 (0.07σ) and the annealed Rényi-2 rate with 8/27, with Jensen gap ratio 21/20 exactly.
This paper is an update that includes LEAN4 Validation. We introduce the Quantum Family Tree, a branching quantum circuit defined on a binary (Bruhat–Tits) tree in which each internal node applies an independent Haar-random two-qubit unitary. In this model, entanglement is organized by genealogical distance: two particles are less entangled the further back their lowest common ancestor lies. We show that the expected von Neumann entropy of an interval of size 2k2^k2k grows linearly with the number of generations kkk, SVN(k)=cVN3 k,S_{VN}(k) = \frac{c_{VN}}{3}\,k,SVN(k)=3cVNk, with coefficient cVN=910log⁡2 ⁣(52)≈1.1897 bits.c_{VN} = \frac{9}{10}\log_2\!\left(\frac{5}{2}\right) \approx 1.1897 \ \text{bits}.cVN=109log2(25)≈1.1897 bits. This result is derived from first principles. A single Haar average yields the exact purity η2=2/5\eta_2 = 2/5η2=2/5, which determines both a scaling dimension Δ=log⁡2(5/2)\Delta = \log_2(5/2)Δ=log2(5/2) and a bulk mass parameter m2=3/10m^2 = 3/10m2=3/10. The resulting cascade propagator is shown to be an eigenmode of the p-adic Laplacian, satisfying a discrete Klein–Gordon equation on the tree. The entropy coefficient is then obtained by relating this structure to known results in p-adic AdS/CFT. The prediction is confirmed numerically across tree depths D=20D = 20D=20 to 150150150 (up to 500 independent realizations per depth), with a 10.34σ separation from the closest competing hypothesis. A Lean 4 formalization verifies all algebraic steps internal to the model, isolating three external inputs (Haar integration, p-adic entropy formula, and the entanglement first law). These results provide a concrete, exactly analyzable setting in which entanglement scaling, ultrametric geometry, and Klein–Gordon spectral structure emerge from a single random-unitary construction, with a fully identified path to a self-contained proof via harmonic analysis.
We introduce a branching quantum circuit on a binary (Bruhat–Tits) tree in which each internal node applies an independent Haar-random two-qubit unitary, and show that entanglement organizes along genealogical distance. For two particles separated by k generations, the expected von Neumann entropy of an interval of size 2k grows linearly: S_{VN}(k) = (c_{VN}/3)·k, with exact coefficient c_{VN} = m²·c_{RT} = (9/10)·log₂(5/2) ≈ 1.1897 bits. Both inputs are derived from first principles: a single Haar average yields η₂ = 2/5, from which we obtain the boundary scaling dimension Δ = log₂(5/2), the bulk mass m² = 3/10, and a cascade propagator that is an eigenmode of the p-adic Laplacian, satisfying a discrete Klein–Gordon equation. This matches the spectral data of a p-adic bulk field. Invoking the p-adic AdS/CFT entropy formula of Gubser–Heydeman–Parra-Martinez–Parikh (2016) then fixes the entropy coefficient, giving c_{VN} = m²·c_{RT}. The result is confirmed numerically up to depth D = 50 at 10.34σ. A fully self-contained proof is reduced to a single analytic continuation problem (Conjecture~1), formulated in terms of Selberg integrals and spherical functions on SU(4)/S(U(2)×U(2)). Together with a numerical verification of the entanglement first law in the same model, these results provide a concrete setting in which entanglement scaling, ultrametric geometry, and a Klein–Gordon spectrum emerge from a single random-unitary construction.
This preprint studies the hierarchical quantum transverse-field Ising model (HQTFIM) with couplings defined by a 2-adic hierarchy, 𝐽 𝑖 𝑗 ∝ 2 − 𝛼 𝑣 2 ( 𝑗 − 𝑖 ) J ij ∝2 −αv 2 (j−i) . Building on the classical Dyson hierarchical Ising model, we construct an explicit block renormalization scheme for the dimensionless transverse field 𝑥 = ℎ / 𝐽 x=h/J and derive a closed RG map with a non-trivial fixed point 𝑥 \* ( 𝛼 ) x \* (α). The corresponding field ℎ \* ( 𝛼 ) = 𝑥 \* ( 𝛼 ) 𝐽 0 h \* (α)=x \* (α)J 0 is interpreted as an “RG self-similarity field” deep inside the ordered phase. On the analytical side, we prove two exact structural results for the ideal Néel cat state |psi_cat> = (|Néel> + |anti-Néel>)/sqrt(2) on chains of length N = 2^H. First, for any dyadic bipartition A:B, the von Neumann entanglement entropy of the reduced state on A is exactly one bit. Second, we construct an explicit tree tensor network (TTN) representation of |psi_cat> on a depth-H binary tree with bond dimension chi = 2, independent of system size. This makes precise in what sense the Néel cat is an extreme example of an area-law state with a simple tensor-network structure. On the numerical side, we use dense exact diagonalization (Python / NumPy / SciPy) to compare the HQTFIM to the standard one-dimensional nearest-neighbour transverse-field Ising model (TFIM). For alpha = 1.5 and h/J0 = x^*(1.5) ≈ 0.404, the HQTFIM ground state in the even-parity sector exhibits: (i) a fidelity F_N with the ideal Néel cat that increases with N; (ii) a half-chain entanglement entropy S_N pinned extremely close to one bit; and (iii) a staggered order parameter M_stagg^2 very close to one. By contrast, the standard TFIM at the same ratio h/J has essentially zero Néel-cat fidelity and negligible staggered order. We further compare the HQTFIM at h = h^*(alpha) with the standard TFIM at its exact critical point h_c = J. The standard TFIM shows the expected logarithmic growth of entanglement, S_N ~ (c/3) log N with an effective central charge c_eff ≈ 0.7 on the small system sizes we access, and vanishing staggered order. In sharp contrast, at h^*(alpha) the HQTFIM shows entanglement consistent with a strict area law, S_N → 1 bit, and strong Néel order. A numerical scan in h for fixed N identifies a “true” critical field h_c(alpha) for the HQTFIM from the rapid drop of M_stagg^2(h); we find h_c(alpha) >> h^*(alpha), with ratios between ~5 and ~28 over alpha in [1.2, 3.0]. Thus the RG self-similarity field h^*(alpha) is not a quantum critical point but a special ordered-phase point with an unusually clean Néel-cat ground state. Finally, we characterize finite-size corrections at h^*(alpha) via power-law fits 1 − F_N ~ N^{-beta(alpha)} and 1 − M_stagg^2 ~ N^{-gamma(alpha)}, with beta(alpha) ≈ 1 and gamma(alpha) ≈ 1.8–2.1 and a systematic but mild dependence on alpha. We clearly separate mathematically rigorous statements (block spectrum, exact entanglement, TTN construction) from numerical or conjectural claims (properties of the HQTFIM in the thermodynamic limit and the location/universality class of the true critical point). The work suggests a concrete set of open problems on rigorous phase diagrams, entanglement scaling, and excitation spectra for quantum hierarchical models.
Abstract We construct a solvable p-adic random tensor model exhibiting an exact bulk–boundary correspondence with holographic features. A binary tree of Haar-random quantum operations on the Bruhat-Tits tree T₂ produces a boundary quantum state whose entanglement structure is consistent with a p-adic conformal field theory. Key CFT data — including the scaling dimension, bulk scalar mass, and leading non-Gaussian coupling — are derived from the Weingarten moments of the random tensors with no free parameters. We derive a bulk–boundary dictionary for two-point observables and modular Hamiltonian structure: the mean mutual information is consistent with the boundary two-point function of a free scalar with Δ=log₂(5/2) and m²=3/10; the modular Hamiltonian admits a decomposition H_A = H_Aᵐᵉʳᵉᵉ + g·δH_A where g = η₄/η₂² − 1 = 9/56 is derived from the fourth Weingarten moment; and the weight function w(v) = K(v,A) = (η₂/2)^{depth(v)} is the unique quasi-local weight in the 13/28 eigenspace of the transfer operator. We test the holographic dictionary under two bulk perturbations. Experiment A (ER=EPR): severing the root edge destroys cross-half mutual information exactly while releasing monogamy to saturate intra-half entanglement at the Page entropy. Experiment D (RT locality): a mid-tree defect reduces mutual information to zero for all boundary pairs whose minimal geodesic crosses the defect, while leaving remote pairs unchanged to within 1%. Both effects are predicted from the Weingarten structure alone. The entire structure — exact results, derivations, and experimental observations — follows from two numbers: η₂ = 2/5 and η₄ = 13/70. The p-adic cascade is structurally distinct from finite-D U(D) Haar cascades; the latter approach the p-adic fixed point at large D but do not realise it exactly. Numerical validation is performed using large-D U(D) cascades, which approximate but do not realise the p-adic fixed point exactly. Keywords: p-adic AdS/CFT, Bruhat-Tits tree, random tensor network, Weingarten calculus, modular Hamiltonian, ER=EPR, Ryu-Takayanagi, holographic entanglement