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

Undetectable but Unremovable: Capacity versus Topology in Lossy Networks

Juan Carlos Paredes

Published Jul 5, 2026• 0 citations
Publisher

Abstract

A network of lossy translations — partial isometries that destroy information as they carry it — can host a topological charge: a winding in the surviving subspace whose local signature shrinks with system size while the global cost of removing it does not. A companion paper established this plateau empirically and conjectured its mechanism; a separate validation exercise established, on real composed pipelines, the operational detection threshold of a noisy, quantized estimation chain. This paper puts the two results in one inequality. The local evidence of a charge k on an m × m torus is a per-plaquette defect of size ≈ 2πk/m², which falls below the operational detection threshold δ* = max(1.405·σ√ℓ, 0.6·B/√n) at a computable crossover size m*; beyond m*, no local monitor at that instrumentation can see the charge. The cost of removing the charge, by contrast, is bounded below by a constant c(k) independent of m, whose height is now codimension-resolved (companion three-gaps note, §4a): √2 where the surviving subspace has codimension one (measured, converging to √2 from below), exactly 1 at codimension ≥ 2 (proved for r = 2) — either way dozens of times above realistic thresholds. Past the crossover the network carries a stealth charge: undetectable by every local test, unremovable by any local edit. We give the precise statements with their evidence status — the existence floor is a theorem at every fixed size (Stage A; elementary proof, Lean formalization queued); the m-uniform constant is the companion paper's conjecture (Stage B) — derive the crossover, work a numerical example, and map what falsifies what. The claim's proof shape — one topological quantity evaluated two ways, locally as a sum of vanishing defects and globally as a protected obstruction — is the shape of the geometric Szpiro inequality, and we close with that dictionary and its one honest discrepancy.

DOI
10.5281/zenodo.21753471

Related papers

Auditing Mutual Information: A Quantitative Anatomy of Metric Reconstruction from Entanglement

T. Weinmann

The mutual-information route to emergent geometry reads a Riemannian metric off the entanglement of a network state: lengths from a logarithmic functional of pairwise mutual information, distances from shortest paths. This paper is an audit of that route, in the spirit of the companion audit of entanglement equilibrium: every assumption beyond established mathematics is isolated as one of six explicit hypotheses M1 to M6, and each is proved, checked numerically, or refuted on the same exactly solvable pair (two-qubit) sector, supplemented by two synthetic models (a power-law chain, and a quasi-uniform versus designed point-set comparison on S2). The audit yields: M1, the exponential decay law I ~ I* exp(-d/xi), is not a technicality but the load-bearing assumption: it is equivalent to additivity of the length functional, and for power-law mutual information the reconstruction on the complete edge set produces a logarithmic remetrization d_k(u,v) = a + b ln d_h(u,v), verified by exact all-pairs shortest paths - a qualitative failure that no conformal rescaling repairs. Metric convergence (M2), measured by exact Dijkstra reconstruction on S2, holds with rate sup(d_k - d_h) <= 7.3 x 10^-3 at N = 3600 for quasi-random (golden-spiral) sets, while a designed banded equal-area set is disconnected at N <= 900 (isolated polar bands) and inflates the error by a factor of approximately 12 - local isotropy, not density uniformity, controls reconstruction. The area law with finite G (M4) carries a systematic deficit epsilon in [-0.16, -0.02] on quasi-random sets, consistent with the quasi-uniform bound xi + delta/xi. A pre-registered control protocol attributing the deficit to density fluctuations is executed and refuted (the registered correlation has the wrong sign, r = -0.37), locating the leading systematic in the boundary discretization of the regions, exactly the alternative pre-registered in the companion paper. Curvature extraction (M5) is one-sidedly biased (d_k >= d_h always) and only marginally resolvable at accessible sizes. The audit locates the quantitative obstructions precisely: in the decay law (M1), in the edge convention, and in the boundary layer. The ledger records the status of every hypothesis.

•Nov 3, 2026•0 citations

Three Gaps, One Index: the m-uniform rigidity of a lossy magnetic pair is topological, not spectral

Juan Carlos Paredes

In one fully specified, machine-checked special case — the charge-k magnetic flux family on an m × m torus of lossy (rank-deficient) links — we disambiguate three distinct quantities that the almost-commuting-operator and topological-protection literatures all call “the gap,” and determine which survive uniformly in the system size m. The local gaps — the commutator norm ‖[U,V]‖, the magnetic Hamiltonian's spectral gap, and the spectral-localizer gap they control — all vanish like the flux-per-plaquette 2πk/m² → 0. Two other gaps are m-uniform: the core gap (the rank/isometry structure of the links, independent of the magnetic data) and the Bott branch gap (well-definedness of the index). The consequence is a sharp negative with a constructive moral: the m-uniform operator-norm separation c(k) between charge and flatness — the Plateau quantity — cannot be sourced from any local spectral gap, and is therefore irreducibly topological (a Voiculescu distance-to-commuting that stays ≈ √2 while every local gap collapses), transported into the non-invertible setting by the rank-structure core gap, not by a spectral gap. This locates exactly where a proof of the Plateau Conjecture must, and must not, look. We then make the positive locale concrete: reading the rank loss as the ideal of an extension reduces the remaining unitary-to-contraction passage to a single off-diagonal Schur block, which numerics (Exp. E, and an adversarial worst-case Exp. F) show is core-gap-controlled and m-uniform — recasting “extend a dimension-free theorem to contractions” as “bound one block.” A direct minimization of the distance to flatness itself (Exp. G) independently fails to collapse the distance, converging up to the same √2 as the index-jump radius — the conjecture's most direct numerical test, passed. The √2 above is the codimension-1 value (d = r+1; the tested case d = 3, r = 2). For codim = d−r ≥ 2, a trivial flat competitor supported on an r-plane orthogonal to the rotating core sits at operator distance exactly 1 from the flux family at every m, so distOpFlat ≤ 1 < √2 there. The separation is therefore codimension-dependent: c(k) = √2 at codimension 1, c(k) = 1 at codimension ≥ 2 — both m- and k-uniform. The Plateau Conjecture (c(k) > 0) holds across 2 ≤ r ≤ d, with uniform floor 1; what is codimension-1-specific is the mechanism — the dimension-free unitary (Voiculescu/Exel–Loring) bound transports only at codimension 1, while for codimension ≥ 2 the binding competitor is the orthogonal one the unitary bound cannot see. House style. Every claim in this note compiles in Lean ([THEOREM]), cites the literature ([CITED]), carries numerical evidence with its script ([EVIDENCE]), or wears a [CONJECTURE] tag. Numerics (experiments A–G, full detail in §9) are the evidence base and are referenced throughout by letter.

•Jul 2, 2026•1 citation

Estimating Overheads for Topological Quantum Codes

Fern H. E. Watson, S. D. Barrett

•Dec 18, 2013•1 citation

Convergence of the Modular Data of a Solvable Gaussian Network: Conjectures, a Band-Edge Obstruction, and a Controlled Numerical Window

T. Weinmann

A solvable Gaussian network, the ground state of a scalar field on a weighted lattice with a truncated exponential interaction kernel, admits exact computation of the entropies and modular Hamiltonians of arbitrary regions. In the companion paper this model was used to test the matter sector of Jacobson's entanglement-equilibrium argument, with a first law whose contact term is consistent with the conformal value 2πξ_c. That consistency is a statement about finite lattices extrapolated to the continuum; the present paper isolates the step that was extrapolated: the convergence of the lattice modular data of a ball to the continuum modular Hamiltonian computed by Longo and Morsella. I formulate convergence conjectures (C1, C1a, C1a', C1b) and prove none of the deep ones. What is proved is elementary and stated with its proof status: the exact first law with the modular-Hamiltonian matrices of a restricted Gaussian state; a bulk identity for lattice balls, Σᵤ κᵤ = K(ℓ_A)(1 + O(ℓ⁻²)); sharp cell estimates for smooth lattice sums; a purely geometric test of the bulk identity over 4 ≤ ℓ ≤ 32; a non-Lipschitz obstruction at the band edge ν = 1/2, illustrated exactly by a two-oscillator model; and perturbation bounds with an accumulated-weight estimate which organises one proof strategy for C1a around a counting statement, provided a mode-wise condition holds, which fails at the extreme edge. For the counting I state a hypothesis E1' at fixed threshold s. The numerical section reports every value computed here, over 4 ≤ ℓ ≤ 12 with five dilute band probes per radius. The two-parameter decomposition R_c − 1 = a + b/x_eff² gives b = 0.959, 0.985, 0.997 and a = 0.039, 0.027, 0.021 at ℓ = 8, 10, 12, both moving towards the conformal values 1 and 0; the rates are not resolved, the direction of the trend is not robust against removing the smallest-band probe, and the dominant systematic of the pipeline (the k = 0 infrared prescription) shifts b by up to 0.23 at ℓ = 8, an order of magnitude above the ℓ-trend itself. The ℓ ≤ 32 field data of the companion paper remain cited, not recomputed. All numbers generated in this work are reproduced by distributed programs with a test suite.

•Nov 8, 2026•0 citations

Certifying Hidden Paths: Scalable Topology Assurance for QKD Networks

Alessandro Colombo, Margherita Cozzolino, Stephan Krenn +1 more

Large-scale Quantum Key Distribution (QKD) networks rely on trusted repeaters, making the security properties of the selected communication path an essential part of end-to-end assurance. At the same time, network operators may be unwilling to disclose their internal topology. We present a topology-certification mechanism that lets a provider prove in zero knowledge that policy-compliant routes between two endpoints exist, without disclosing the routes in an individual presentation. Our main idea is to certify nodes and edges independently using multi-message signatures, rather than signing the complete graph as one object. For a route chosen in advance, proof size and cryptographic proving and verification work depend on its positions and attributes, independently of the overall network size, whereas route discovery and certification have separate graph-dependent costs. The construction hides the actual route length up to a public bound and sketches extensions to node-disjoint routes and monotonic additions within a graph epoch. We give a formal security model and conditional proofs of unforgeability and graph hiding for a generic construction. For a BBS-based construction, presentation-size estimates remain below $300$\,KiB at $\ell=m=n=50$, and measured generation and verification times remain below $400$\,ms at $\ell=64$ and $m=n=8$.

cs.CRCross-listedarXiv:2610.11513•Oct 9, 2026•0 citations

Convergence of the Modular Data of a Solvable Gaussian Network: Conjectures, a Band-Edge Obstruction, and a Controlled Numerical Window

T. Weinmann

A solvable Gaussian network, the ground state of a scalar field on a weighted lattice with a truncated exponential interaction kernel, admits exact computation of the entropies and modular Hamiltonians of arbitrary regions. In the companion paper this model was used to test the matter sector of Jacobson's entanglement-equilibrium argument, with a first law whose contact term is consistent with the conformal value 2π ξ_c. That consistency is a statement about finite lattices extrapolated to the continuum; the present work isolates the step that was extrapolated: the convergence of the lattice modular data of a ball to the continuum modular Hamiltonian computed by Longo and Morsella. We formulate convergence conjectures (C1, C1a, C1a', C1b) and prove none of the deep ones. What is proved is elementary and stated with its proof status: the exact first law with the modular-Hamiltonian matrices of a restricted Gaussian state; a bulk identity for lattice balls, Σ_u κ_u = K(ℓ_A)(1 + O(ℓ^(-2))); sharp cell estimates for smooth lattice sums; a purely geometric test of the bulk identity over 4 ≤ ℓ ≤ 32; a non-Lipschitz obstruction at the band edge ν = 1/2, illustrated exactly by a two-oscillator model; and perturbation bounds with an accumulated-weight estimate that organises one proof strategy for C1a around a counting statement, provided a mode-wise condition holds—which fails at the extreme edge. For the counting we state a hypothesis E1' at fixed threshold. The numerical section reports every value computed here, over 4 ≤ ℓ ≤ 12 with five dilute band probes per radius. The two-parameter decomposition R_c - 1 = a + b / x_eff^2 gives b = 0.959, 0.985, 0.997 and a = 0.039, 0.027, 0.021 at ℓ = 8, 10, 12, both moving towards the conformal values 1 and 0; the rates are not resolved, the direction of the trend is not robust against removing the smallest-band probe, and the dominant systematic of the pipeline (the k = 0 infrared prescription) shifts b by up to 0.23 at ℓ = 8, an order of magnitude above the ℓ-trend itself. The ℓ ≤ 32 field data of the companion paper remain cited, not recomputed. All numbers generated in this work are reproduced by distributed programs with a test suite.

•Nov 8, 2026•0 citations
A network of lossy translations — partial isometries that destroy information as they carry it — can host a topological charge: a winding in the surviving subspace whose local signature shrinks with system size while the global cost of removing it does not. A companion paper established this plateau empirically and conjectured its mechanism; a separate validation exercise established, on real composed pipelines, the operational detection threshold of a noisy, quantized estimation chain. This paper puts the two results in one inequality. The local evidence of a charge k on an m × m torus is a per-plaquette defect of size ≈ 2πk/m², which falls below the operational detection threshold δ* = max(1.405·σ√ℓ, 0.6·B/√n) at a computable crossover size m*; beyond m*, no local monitor at that instrumentation can see the charge. The cost of removing the charge, by contrast, is bounded below by a constant c(k) independent of m, whose height is now codimension-resolved (companion three-gaps note, §4a): √2 where the surviving subspace has codimension one (measured, converging to √2 from below), exactly 1 at codimension ≥ 2 (proved for r = 2) — either way dozens of times above realistic thresholds. Past the crossover the network carries a stealth charge: undetectable by every local test, unremovable by any local edit. We give the precise statements with their evidence status — the existence floor is a theorem at every fixed size (Stage A; elementary proof, Lean formalization queued); the m-uniform constant is the companion paper's conjecture (Stage B) — derive the crossover, work a numerical example, and map what falsifies what. The claim's proof shape — one topological quantity evaluated two ways, locally as a sum of vanishing defects and globally as a protected obstruction — is the shape of the geometric Szpiro inequality, and we close with that dictionary and its one honest discrepancy.
The mutual-information route to emergent geometry reads a Riemannian metric off the entanglement of a network state: lengths from a logarithmic functional of pairwise mutual information, distances from shortest paths. This paper is an audit of that route, in the spirit of the companion audit of entanglement equilibrium: every assumption beyond established mathematics is isolated as one of six explicit hypotheses M1 to M6, and each is proved, checked numerically, or refuted on the same exactly solvable pair (two-qubit) sector, supplemented by two synthetic models (a power-law chain, and a quasi-uniform versus designed point-set comparison on S2). The audit yields: M1, the exponential decay law I ~ I* exp(-d/xi), is not a technicality but the load-bearing assumption: it is equivalent to additivity of the length functional, and for power-law mutual information the reconstruction on the complete edge set produces a logarithmic remetrization d_k(u,v) = a + b ln d_h(u,v), verified by exact all-pairs shortest paths - a qualitative failure that no conformal rescaling repairs. Metric convergence (M2), measured by exact Dijkstra reconstruction on S2, holds with rate sup(d_k - d_h) <= 7.3 x 10^-3 at N = 3600 for quasi-random (golden-spiral) sets, while a designed banded equal-area set is disconnected at N <= 900 (isolated polar bands) and inflates the error by a factor of approximately 12 - local isotropy, not density uniformity, controls reconstruction. The area law with finite G (M4) carries a systematic deficit epsilon in [-0.16, -0.02] on quasi-random sets, consistent with the quasi-uniform bound xi + delta/xi. A pre-registered control protocol attributing the deficit to density fluctuations is executed and refuted (the registered correlation has the wrong sign, r = -0.37), locating the leading systematic in the boundary discretization of the regions, exactly the alternative pre-registered in the companion paper. Curvature extraction (M5) is one-sidedly biased (d_k >= d_h always) and only marginally resolvable at accessible sizes. The audit locates the quantitative obstructions precisely: in the decay law (M1), in the edge convention, and in the boundary layer. The ledger records the status of every hypothesis.
In one fully specified, machine-checked special case — the charge-k magnetic flux family on an m × m torus of lossy (rank-deficient) links — we disambiguate three distinct quantities that the almost-commuting-operator and topological-protection literatures all call “the gap,” and determine which survive uniformly in the system size m. The local gaps — the commutator norm ‖[U,V]‖, the magnetic Hamiltonian's spectral gap, and the spectral-localizer gap they control — all vanish like the flux-per-plaquette 2πk/m² → 0. Two other gaps are m-uniform: the core gap (the rank/isometry structure of the links, independent of the magnetic data) and the Bott branch gap (well-definedness of the index). The consequence is a sharp negative with a constructive moral: the m-uniform operator-norm separation c(k) between charge and flatness — the Plateau quantity — cannot be sourced from any local spectral gap, and is therefore irreducibly topological (a Voiculescu distance-to-commuting that stays ≈ √2 while every local gap collapses), transported into the non-invertible setting by the rank-structure core gap, not by a spectral gap. This locates exactly where a proof of the Plateau Conjecture must, and must not, look. We then make the positive locale concrete: reading the rank loss as the ideal of an extension reduces the remaining unitary-to-contraction passage to a single off-diagonal Schur block, which numerics (Exp. E, and an adversarial worst-case Exp. F) show is core-gap-controlled and m-uniform — recasting “extend a dimension-free theorem to contractions” as “bound one block.” A direct minimization of the distance to flatness itself (Exp. G) independently fails to collapse the distance, converging up to the same √2 as the index-jump radius — the conjecture's most direct numerical test, passed. The √2 above is the codimension-1 value (d = r+1; the tested case d = 3, r = 2). For codim = d−r ≥ 2, a trivial flat competitor supported on an r-plane orthogonal to the rotating core sits at operator distance exactly 1 from the flux family at every m, so distOpFlat ≤ 1 < √2 there. The separation is therefore codimension-dependent: c(k) = √2 at codimension 1, c(k) = 1 at codimension ≥ 2 — both m- and k-uniform. The Plateau Conjecture (c(k) > 0) holds across 2 ≤ r ≤ d, with uniform floor 1; what is codimension-1-specific is the mechanism — the dimension-free unitary (Voiculescu/Exel–Loring) bound transports only at codimension 1, while for codimension ≥ 2 the binding competitor is the orthogonal one the unitary bound cannot see. House style. Every claim in this note compiles in Lean ([THEOREM]), cites the literature ([CITED]), carries numerical evidence with its script ([EVIDENCE]), or wears a [CONJECTURE] tag. Numerics (experiments A–G, full detail in §9) are the evidence base and are referenced throughout by letter.
A solvable Gaussian network, the ground state of a scalar field on a weighted lattice with a truncated exponential interaction kernel, admits exact computation of the entropies and modular Hamiltonians of arbitrary regions. In the companion paper this model was used to test the matter sector of Jacobson's entanglement-equilibrium argument, with a first law whose contact term is consistent with the conformal value 2πξ_c. That consistency is a statement about finite lattices extrapolated to the continuum; the present paper isolates the step that was extrapolated: the convergence of the lattice modular data of a ball to the continuum modular Hamiltonian computed by Longo and Morsella. I formulate convergence conjectures (C1, C1a, C1a', C1b) and prove none of the deep ones. What is proved is elementary and stated with its proof status: the exact first law with the modular-Hamiltonian matrices of a restricted Gaussian state; a bulk identity for lattice balls, Σᵤ κᵤ = K(ℓ_A)(1 + O(ℓ⁻²)); sharp cell estimates for smooth lattice sums; a purely geometric test of the bulk identity over 4 ≤ ℓ ≤ 32; a non-Lipschitz obstruction at the band edge ν = 1/2, illustrated exactly by a two-oscillator model; and perturbation bounds with an accumulated-weight estimate which organises one proof strategy for C1a around a counting statement, provided a mode-wise condition holds, which fails at the extreme edge. For the counting I state a hypothesis E1' at fixed threshold s. The numerical section reports every value computed here, over 4 ≤ ℓ ≤ 12 with five dilute band probes per radius. The two-parameter decomposition R_c − 1 = a + b/x_eff² gives b = 0.959, 0.985, 0.997 and a = 0.039, 0.027, 0.021 at ℓ = 8, 10, 12, both moving towards the conformal values 1 and 0; the rates are not resolved, the direction of the trend is not robust against removing the smallest-band probe, and the dominant systematic of the pipeline (the k = 0 infrared prescription) shifts b by up to 0.23 at ℓ = 8, an order of magnitude above the ℓ-trend itself. The ℓ ≤ 32 field data of the companion paper remain cited, not recomputed. All numbers generated in this work are reproduced by distributed programs with a test suite.
Large-scale Quantum Key Distribution (QKD) networks rely on trusted repeaters, making the security properties of the selected communication path an essential part of end-to-end assurance. At the same time, network operators may be unwilling to disclose their internal topology. We present a topology-certification mechanism that lets a provider prove in zero knowledge that policy-compliant routes between two endpoints exist, without disclosing the routes in an individual presentation. Our main idea is to certify nodes and edges independently using multi-message signatures, rather than signing the complete graph as one object. For a route chosen in advance, proof size and cryptographic proving and verification work depend on its positions and attributes, independently of the overall network size, whereas route discovery and certification have separate graph-dependent costs. The construction hides the actual route length up to a public bound and sketches extensions to node-disjoint routes and monotonic additions within a graph epoch. We give a formal security model and conditional proofs of unforgeability and graph hiding for a generic construction. For a BBS-based construction, presentation-size estimates remain below 300300300\,KiB at ℓ=m=n=50\ell=m=n=50ℓ=m=n=50, and measured generation and verification times remain below 400400400\,ms at ℓ=64\ell=64ℓ=64 and m=n=8m=n=8m=n=8.
A solvable Gaussian network, the ground state of a scalar field on a weighted lattice with a truncated exponential interaction kernel, admits exact computation of the entropies and modular Hamiltonians of arbitrary regions. In the companion paper this model was used to test the matter sector of Jacobson's entanglement-equilibrium argument, with a first law whose contact term is consistent with the conformal value 2π ξ_c. That consistency is a statement about finite lattices extrapolated to the continuum; the present work isolates the step that was extrapolated: the convergence of the lattice modular data of a ball to the continuum modular Hamiltonian computed by Longo and Morsella. We formulate convergence conjectures (C1, C1a, C1a', C1b) and prove none of the deep ones. What is proved is elementary and stated with its proof status: the exact first law with the modular-Hamiltonian matrices of a restricted Gaussian state; a bulk identity for lattice balls, Σ_u κ_u = K(ℓ_A)(1 + O(ℓ^(-2))); sharp cell estimates for smooth lattice sums; a purely geometric test of the bulk identity over 4 ≤ ℓ ≤ 32; a non-Lipschitz obstruction at the band edge ν = 1/2, illustrated exactly by a two-oscillator model; and perturbation bounds with an accumulated-weight estimate that organises one proof strategy for C1a around a counting statement, provided a mode-wise condition holds—which fails at the extreme edge. For the counting we state a hypothesis E1' at fixed threshold. The numerical section reports every value computed here, over 4 ≤ ℓ ≤ 12 with five dilute band probes per radius. The two-parameter decomposition R_c - 1 = a + b / x_eff^2 gives b = 0.959, 0.985, 0.997 and a = 0.039, 0.027, 0.021 at ℓ = 8, 10, 12, both moving towards the conformal values 1 and 0; the rates are not resolved, the direction of the trend is not robust against removing the smallest-band probe, and the dominant systematic of the pipeline (the k = 0 infrared prescription) shifts b by up to 0.23 at ℓ = 8, an order of magnitude above the ℓ-trend itself. The ℓ ≤ 32 field data of the companion paper remain cited, not recomputed. All numbers generated in this work are reproduced by distributed programs with a test suite.