We study compressed Heisenberg-picture dynamics defined by a unital completely positive compression map $\mathbb E_{\mathcal M}$ whose image is an operator system $\mathcal A_{\mathcal M}$ labeled by a tensor-network geometry $(G,D)$. For physical evolutions $\Lambda_k$, the manifold-induced channels $\Phi_{\mathcal M}^{(k)}=\mathbb E_{\mathcal M}\circ\Lambda_k$ form a class that is exactly closed under composition, and we bound the difference between step-wise compression and compression applied once at the end of the evolution. The bound is stated pointwise on propagated observables and is informative only when these remain close to $\mathcal A_{\mathcal M}$. Tensor-network geometry is connected to this structure through an explicit representability hypothesis: every state on $\mathcal A_{\mathcal M}$ lies within $\eta_D$ of the restriction of a tensor-network state with graph $G$ and bond dimension at most $D$. Under this hypothesis the standard Schmidt-rank argument gives a graph-cut mutual-information bound for the representatives and a geometric capacity functional $2\log D\,|\partial_G|$. These geometric statements are conditional on the hypothesis: the geometry enters through the hypothesis and the admissibility condition on $\mathbb E_{\mathcal M}$, and is not derived from the operator-algebraic layer. We do not construct a nontrivial admissible compression map; constructing one and deriving representability are left as open problems. Version 1.1 (supersedes v1.0). Substantive revision; v1.0 remains available. Title changed to "Compressed Quantum Dynamics on Operator Systems and Graph-Cut Correlation Bounds under Tensor-Network Geometry". The abstract and conclusion are rewritten accordingly. Main changes:- Withdrawn: the claim that tensor-network geometry "emerges" from the compressed dynamics. The geometry enters through the admissibility condition and the representability hypothesis, and the graph-cut bounds are conditional on that hypothesis. This is now stated explicitly, together with a Limitations paragraph (no nontrivial admissible compression map is constructed).- Proposition 1 (stability) is corrected and restated: the error sum runs over n-1 terms, a pointwise form on propagated observables is added, and the proof in Appendix A is rewritten. Idempotence is not used.- New Observation 1: the channel class is exactly closed under composition. This replaces the "approximate algebra closure" definition.- The representability hypothesis is restated as a static hypothesis on the operator system, and the bounds are restricted to the tensor-network representatives. The exact-equality statement in Sec. 6 is replaced by an eta_D-closeness statement.- Removed: the Controlled Leakage assumption, the reconstruction-map discussion, the sequential-propagation estimate, and Example 1 (finite-bond MPS under amplitude damping).- Smaller fixes: composition-order convention, Lemma 1 statement (A and B must partition the whole system), MPS cut counts, notation, roadmap, citations, and typos.
We study compressed Heisenberg-picture dynamics defined by a unital completely positive compression map EM whose image is an operator system AM labeled by a tensor-network geometry (G,D). For physical evolutions Λk, the manifold-induced channels ΦM(k)=EM∘Λk form a class that is exactly closed under composition, and we bound the difference between step-wise compression and compression applied once at the end of the evolution. The bound is stated pointwise on propagated observables and is informative only when these remain close to AM. Tensor-network geometry is connected to this structure through an explicit representability hypothesis: every state on AM lies within ηD of the restriction of a tensor-network state with graph G and bond dimension at most D. Under this hypothesis the standard Schmidt-rank argument gives a graph-cut mutual-information bound for the representatives and a geometric capacity functional 2logD∣∂G∣. These geometric statements are conditional on the hypothesis: the geometry enters through the hypothesis and the admissibility condition on EM, and is not derived from the operator-algebraic layer. We do not construct a nontrivial admissible compression map; constructing one and deriving representability are left as open problems. Version 1.1 (supersedes v1.0). Substantive revision; v1.0 remains available. Title changed to "Compressed Quantum Dynamics on Operator Systems and Graph-Cut Correlation Bounds under Tensor-Network Geometry". The abstract and conclusion are rewritten accordingly. Main changes:- Withdrawn: the claim that tensor-network geometry "emerges" from the compressed dynamics. The geometry enters through the admissibility condition and the representability hypothesis, and the graph-cut bounds are conditional on that hypothesis. This is now stated explicitly, together with a Limitations paragraph (no nontrivial admissible compression map is constructed).- Proposition 1 (stability) is corrected and restated: the error sum runs over n-1 terms, a pointwise form on propagated observables is added, and the proof in Appendix A is rewritten. Idempotence is not used.- New Observation 1: the channel class is exactly closed under composition. This replaces the "approximate algebra closure" definition.- The representability hypothesis is restated as a static hypothesis on the operator system, and the bounds are restricted to the tensor-network representatives. The exact-equality statement in Sec. 6 is replaced by an eta_D-closeness statement.- Removed: the Controlled Leakage assumption, the reconstruction-map discussion, the sequential-propagation estimate, and Example 1 (finite-bond MPS under amplitude damping).- Smaller fixes: composition-order convention, Lemma 1 statement (A and B must partition the whole system), MPS cut counts, notation, roadmap, citations, and typos.
Abstract A confining, non-Abelian gauge connection Uij ∈ SU(N) defined on the links of a dynamical graph has been proposed as the microscopic origin of classical spacetime geometry: the metric is reconstructed from the coset (soldering-form) sector of an enlarged connection, and black-hole and boundary-cut entropy are obtained as the logarithm of a combinatorial microstate count, matched, via the Freedman–Headrick theorem, to the bit-thread (max-flow/min-cut) formulation of holographic entanglement entropy. That matching is exact as a statement about counting, but it is not, by itself, a statement about the entanglement entropy of any specific quantum state: nothing in the combinatorial construction distinguishes a classical ensemble of flux occupation numbers from a genuine quantum wavefunction, so its connection to the entanglement/tensornetwork program of emergent geometry (Van Raamsdonk, Swingle, Ryu–Takayanagi, and the random-tensor-network derivation of Hayden, Qi, Kim, and Preskill) remains an analogy rather than a derivation. This paper closes that gap. We first restate the flux-gauge connection ensemble in full – its partition function, its block-link renormalization-group coarse-graining with closed-form Migdal–Kadanoff coefficients, its emergent metric and Newton’s-constant identification, and its combinatorial boundary-cut entropy – so that the paper is self-contained. We then show, by an exact character-expansion/Peter–Weyl derivation standard in lattice gauge theory but not previously applied to this construction, that the SU(N) link ensemble is a tensor network: each flux-tube segment (link) carries a bond dimension equal to the dimension of the SU(N) representation it transports, and each flux-tube junction (node) carries a gauge-invariant intertwiner tensor, fixed by representation theory rather than assumed. Only a single, narrowly scoped statistical assumption – on the distribution of intertwiners within the multiplicity space that gauge invariance already guarantees – is needed to complete this exact, deterministic tensor network into a genuine random tensor network in the technical sense of Hayden–Qi–Kim–Preskill (HQKP). We further identify the renormalization-group layers of Section 2’s coarse-graining as the isometric maps of a multi-scale entanglement renormalization ansatz (MERA), giving the emergent radial holographic direction a literal tensor-network origin rather than a scaling-dimension analogy. We then investigate, analytically and how the entanglement entropy of such a network reproduces the Ryu–Takayanagi/min-cut law. An exactly solvable limit built from classical (GHZ-type) perfect tensors reproduces the combinatorial law exactly for single-cut (boundary-anchored) regions but is shown to be degenerate for interior, two-sided regions, exposing a genuine gap in the combinatorial entropy argument: classical flux-occupation counting does not, by itself, certify multi-region (entanglement-wedgelevel) quantum entanglement structure. We then construct a genuinely quantum (non-classical, Gaussian-random) tensor-network realization of the link ensemble and confirm numerically, on chains of up to sixteen sites, (i) a clean area-law plateau in which the entanglement entropy of an interior region becomes independent of its size once the region is large enough, in place of continued volume-law growth, and (ii) a linear scaling of the plateau entropy with the logarithm of the bond dimension, S(A) = κNcut(A) logD, fit with R2 = 0.996 and an O(1) efficiency coefficient κ ≈ 0.68 for this finite, non-isometric network. We interpret κ < 1 as a genuine, quantifiable finite-network correction relative to the idealized D → ∞ isometric-projector limit in which HQKP prove κ → 1, and we list the construction of that idealized limit, directly on the SU(N) link ensemble, as the key open numerical task. We close by proposing an explicit correspondence between the tensor-network minimal surface of this paper and the Cartan soldering-form metric of the gauge-connection construction, framed as a falsifiable consistency conjecture rather than an established result.
Local quantum interactions generate dynamics in an exponentially large Hilbert space, yet locality and entanglement restrict the information that can spread and accumulate. Bounds on propagation and entanglement growth, together with tensor networks, exploit these restrictions to discard information unnecessary for describing the evolution. This leads to a sharper question: how much information must any low-rank representation retain? Here we determine these limits, up to logarithmic factors, for short-range interactions. For time-independent evolution, the optimal rank obeys logD=O(t+log(1/ε)), with matching lower bounds fixing the accuracy exponent 1/2; for arbitrary driving, matching fixed-time bounds instead give 2/3. Correspondingly, the corresponding dynamical entanglement spectra exhibit distinct small-α Rényi laws, α−1 and α−2. In one dimension, the static limit is constructively attained by an explicit MPO algorithm, with an analogous extension to Liouvillian dynamics. Together, these results determine the irreducible information required to represent local quantum evolution and uncover distinct entanglement structures in static and driven dynamics.
We study entanglement reachability in quantum many-body systems evolving under local dynamics. We formulate an axiomatic setting (locality, finite-dimensional memory, and representability constraints expressed through operator subsystems) and define reachable, forbidden and kinematically admissible entanglement structures on an induced structural space. We show that, once confinement constants are defined from the reachable set, structural confinement holds by construction, and we isolate the non-definitional input: a representability-invariance estimate (a restatement of the representability axiom) and two explicit hypotheses, one asserting the existence of an unreachable structure and one asserting that a family of structural observables detects all unreachable structures. We instantiate the setting in three realizations (GHZ coherence, an abstract operator-subsystem model adapted to matrix product operators, and protected logical information), in each of which the exclusion of a kinematically admissible structure follows from the representability axiom for a chosen projection. All results are conditional on the stated axioms and hypotheses. v1.1: confinement constants defined from the reachable set; explicit existence and detection hypotheses; representability-invariance estimate; GHZ, tensor-network and QEC examples restated under A6 with explicit initial-state conditions.
This is Paper 006 in the Anaxiomatic Mechanics / pq-Spacetime stack. It develops the emergence of effective operators and norm-preserving dynamics within the Anaxiomatic Mechanics / pq-Spacetime stack. Starting from finite binary-mechanical graph histories and their amplitude structure, it shows how boundary-resolution maps induce effective linear operators between distinguishable completion channels. Linearity is not assumed as a primitive quantum rule; it follows from the additivity of finite history amplitudes before probabilities are assigned. The paper then distinguishes closed boundary maps from open, conditioned, or coarse-grained maps. A closed boundary map carries admissible fine-history support forward without creation, deletion, duplication, selection, or loss. In the effective Hilbert representation, this closed support-preserving transfer appears as an isometry, and when the initial and final effective spaces have equal finite dimension, as a unitary map. Open or conditioned descriptions instead give nonunitary effective operations. The result provides the operator-theoretic bridge in the finite pq-spacetime construction: finite graph histories give amplitudes; amplitudes give Born-type weights; Hilbert representation gives state space; tensor-product structure gives composite records; and closed boundary maps give effective norm-preserving dynamics. Operators, projections, isometries, unitaries, and open-system maps are therefore not inserted as primitive assumptions, but arise as representation-level consequences of finite boundary-resolution structure.
When does operational distinguishability contain sufficient information to identify physical structure? We address this question through a resource-relative framework of Operational Informational Distinguishability (OID), designed to investigate the mathematical consistency of identifiability across quantum states, information geometry, and physical processes. An operational observer is characterized by (\mathcal{D}=(\mathcal{A},\mathcal{M},\mathcal{R},\delta)), whose labelled outcome distributions define an operational signature and induce equivalence classes of physically indistinguishable realizations. We establish an exact reconstruction criterion: a proposed geometric assignment factors uniquely through the operational signature if and only if it is constant on these equivalence classes. This provides a necessary-and-sufficient condition for operational reconstruction, while separating identifiability from the additional requirements of local non-degeneracy and stability. For faithful finite-dimensional quantum-state manifolds, we establish the measurement–information-geometric hierarchy[g^{(\mathcal{M})}\preceq g^{\mathrm{SLD}}\preceq g^{\mathrm{BKM}}relating measurement-restricted Fisher information, the symmetric logarithmic derivative metric, and the Bogoliubov–Kubo–Mori metric. We clarify the directional attainability of the SLD bound and its distinction from simultaneous multiparameter attainability. As an explicit algebraic result, we characterize the operator span generated by diagonal phase modulation of cyclic-shift eigenstate projectors in the one-excitation sector: it is precisely the constant-diagonal Hermitian subspace, of dimension (N^{2}-N+1), leaving (N-1) independent population directions unresolved. Adjoining site-basis projectors restores informational completeness. This idealized construction is connected to experimentally realized entangled measurements of (W) states. We further extend operational distinguishability to quantum processes through tester-restricted signatures and divergences, explicitly separating signalling from intervention-defined causal influence. Finally, we introduce accumulated information-geometric path length as a candidate operational clock parameter, without identifying it with physical time. By relating these constructions to holographic information-distance bounds, bulk entanglement, conditional mutual information and recovery, and recent approaches to emergent geometry and informational time, we formulate a central testable question: can a common resource-relative distinguishability structure remain identifiable, stable, and compositionally consistent across states, processes, geometry, temporal ordering, and causality? The framework makes both constructive reconstruction and mathematically explicit obstructions possible, providing a falsifiable methodological program rather than presupposing the emergence or unification of physical structure.
Tensor networks (TNs) give explicit classical descriptions of structured finite linear maps, while block-encodings (BEs) are the standard quantum access model for such maps. We establish TNs as a universal data interface for quantum algorithms: any explicitly specified TN for an arbitrary finite linear map compiles directly to an explicit qubit BE, with no penalty on the selected-block round trip under faithful compression. Along a chosen sweep, the compiler handles local non-unitarity by exact local dilations and aggregates the resulting post-selection conditions online using logarithmically many additional flag qubits. The chosen sweep incurs three exact, sweep-dependent costs (the accumulated scale, the frontier memory, and the number of genuinely dilated local steps), which the main theorems are stated in terms of. In the bounded-local explicit arithmetic model, this yields linear-time compilation to linear-size circuits with constant-size local gadgets, and hence a constant-factor size correspondence between bounded-local TNs and bounded-local BEs. The same construction gives a selected-block round trip BE->TN->BE: a BE canonically yields a TN for its selected block rather than for an arbitrary unitary extension, which can then be compressed or approximated classically before recompilation. Faithful Schmidt-rank compression transfers monotonically (the scale cost and frontier memory cannot increase, with operator error bounded by the discarded weight), while arbitrary restructuring admits no general scale guarantee, a limitation we show is unavoidable. As consequences and limits of this scale accounting, we characterize exact scale optimality, show that bridge-hourglass forests admit scale-optimal sweeps after exact recursive local bond compression, and prove that certifying unrestricted exact scale optimality is already hard for diagonal MPOs on a path unless P=NP.