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

Constraint Network Cryptography B2: Dissipative Realisation of Spectral-Layer Readout—Spectral Readout Principle and Relocation of the Computational Phase-Transition Boundary

changzheng zhou, ZIQING zhou

Published Sep 15, 2026• 0 citations
Publisher

Abstract

Period finding is the arithmetic core of integer factorisation. Given a base acoprime to N, the goal is to find the order r of the element a in the multiplicativegroup Z∗N. Quantum computation uses the quantum Fourier transform to accomplish frequency-domain concentration of the periodic signal in a single step, whereasclassical randomised algorithms can only sample point by point in the time domain.This article establishes and systematically expounds a unified spectral readoutprinciple: on the Cayley graph of a cyclic subgroup ⟨b⟩, the identity observationof any ergodic translation-invariant dynamics is a functional of its dual characterspectral data, and the period r is encoded in this functional as a discrete invariant;unitary readout (Fourier support set) and dissipative readout (heat-kernel poweraverage) are two extreme instances of this principle, and the readout complexityis controlled solely by the spectral gap of the transition operator. This articlegives a sieve criterion for lower bounds on the spectral gap (the sieve-hole condition), proves that the exponential range of dyadic generating sets is incompressiblewithin an additive constant, and constructs the first provably fast-mixing example outside the dyadic case (a triple-generator set, with asymptotic iteration countabout 42% of the dyadic one). The core theorem determines the precise asymptotics of the universal spectral-gap constant: for Mersenne moduli r = 2m −1, theworst eigenvalue asymptotically attains the extremum with an explicit constantc0 = j≥1(1 −cos(π/2j−1)) ≈ 3.3946; Fermat-type moduli r = 2m + 1 approachthe same constant from below, forming a two-sided sandwich. This leads to theuniversal constant conjecture: if it holds, the constant in the known spectral-gaplower bound can be precisely improved by about 3.39 times. Furthermore, the variable of the “classical/quantum” phase-transition boundary is relocated to parallelaccess capability Π, a rigorous computational-model semantics of Π (Bulk-RAM)is given, two foundational theorems are proved, and the sublinear simulation lowerbound problem for heat-kernel readout is proposed as the first concrete instance ofthe Π-non-simulability barrier.

DOI
10.5281/zenodo.22766349

Related papers

Constraint Network Cryptography C: Constraint Network Rigidity of Post-Quantum Cryptography — Why Lattice Cryptography Is Quantum-Resistant

changzheng zhou, ZIQING zhou

Under the constraint network phase transition framework, the computationalhardness underlying post-quantum cryptographic standards manifests three fundamental types of rigidity: spectrum-hiding, geometric torsion, and one-way condensation. The vulnerability of integer factorisation and discrete logarithms stems fromthe spectral manifestness of their rigidity kernels — the hidden subgroup structurecan be directly extracted in the frequency domain by the quantum Fourier transform. The quantum resistance of the shortest vector problem, the closest vectorproblem, and the learning with errors problem in lattice cryptography is rootedin the incompressibility of local geometric extrema in a high-dimensional continuous metric space: their rigidity kernels are neither encodable by characters offinite abelian groups, nor can their geometric entropy, which grows linearly withdimension, be altered by diffusive quantum operators beyond reducing exponential constants without changing the exponential type. Hash-based signatures relyon the information potential well of one-way condensation operators and remainexponentially secure even in the quantum random oracle model. This paper provides a quantum immunity criterion at the operator-algebra level and extends itto a generalised criterion covering both spectral-diagnostic and diffusive quantumoperator families, and retrospectively verifies the sufficiency of the parameter designs of Kyber, Dilithium, and SPHINCS+. The entire argument carries explicitcondition-depth annotations, and the entropy budget for cross-domain mappingsis constrained by the axiom of information conservation, thereby establishing thegeometric foundation of post-quantum cryptography within honest boundaries.

•Sep 3, 2026•0 citations

Constraint Network Cryptography B: Sieve-Time Tree Spectral Geometry of Shor's Algorithm and Prime Rigidity Kernel Reading

changzheng zhou, ZIQING zhou

Under the framework of constraint network geometry, this paper reconstructsthe core mechanism of Shor’s quantum factoring algorithm as a spectral diagnosticprocess. By establishing a projective correspondence between the power orbits inthe multiplicative group modulo N and the causal hierarchy structure of sievetime trees, we argue that the period r is geometrically equivalent to the length ofa closed causal chain in the projection fibre, and that this length is constrainedby the factor structure of Euler’s totient function φ(N). The quantum Fouriertransform is reformulated as a spectral condensation operator that maps from thelocal constraint layer in the time domain to the global periodic layer in the frequencydomain; its mathematical backbone is furnished by Pontryagin duality and sheaftheoretic section spaces. The two-register entangled state is mapped to a twonode coupling system in an intertextual network, where the information potentialdifference is transmitted via a correlation matrix and its generalised inverse.This paper attempts to distinguish standard number-theoretic facts from crossdomain heuristic mappings. The boundary of this distinction is given in Chapter8; known ambiguous zones exist (e.g., the q|r ideal condition in Chapter 5, the G2parameter correspondence in Chapter 6). The three layers are connected throughinterlayer composition and conditional reduction, and we clearly distinguish provenfacts, conditional heuristic mappings, and conjectures awaiting formalisation.Keywords: Shor’s algorithm; sieve-time tree; multiplicative group modulo N;quantum Fourier transform; constraint network; spectral condensation; prime rigidity kernel; intertextual coupling

•Sep 3, 2026•0 citations

The Ladder of Spectral Gaps B; From Anyon Gap to Operator Spectral Gap– Construction and Verification of the Spectral Functor

changzheng zhou, ZIQING zhou

The energy gaps appearing in different physical systems– the anyonic excitation gap of Kitaev’s toric code, the first eigenvalue of the Laplacian on a compactRiemannian manifold, and the mass gap of Yang–Mills theory– traditionally belong to three isolated domains: topological order, spectral geometry, and quantumfield theory. In this paper we construct a covariant functor, called the spectralfunctor, between the category of weighted constraint networks and the category ofself-adjoint operators, and prove that the three types of gaps are not independentphenomena but manifestations of a common spectral structure on different physicalsource objects. The codomain of the spectral functor is the SA-Hilb category whichcarries self-adjoint operator information, thereby avoiding the categorical defect ofattaching spectral information externally to Hilbert spaces. Rigorous verification ofthe functor axioms ensures covariance between coarse-graining and spectral preservation. For the toric code, the gap ∆ = 4J is strictly derived from the stabilizeralgebra; under coarse-graining the effective coupling constant is strictly given bythe compression of matrix elements of the Galerkin projection, and the dimensionless gap remains invariant. For the Laplacian, the finite element discretisationresolves the conflict between negative stiffness matrix entries and the positivityaxiom of weights by distinguishing geometric weights from coupling operators; theclosed-form solution of the first eigenvalue (4/h2)sin2(h/2) converges exactly tothe continuum spectral gap, and the deviation from asymptotic commutativity ofcoarse-graining is controlled by O(H2). For Yang–Mills theory, we draw an honestboundary between classical constraint networks and quantum operators, formulatethe mass gap problem as a uniform positivity condition for the spectral gap of lattice constraint networks, and establish a one-way logical closure, clearly indicatingthe mathematical obstacles for the reverse reconstruction. The Bures informationgeometric metric based on thermal states further unifies the spectral gap and theinformation-geometric distance through two-way inequalities, making the physicalenergy gap, the operator spectral gap, and the information-geometric rigidity radius equivalent. The commutativity verification of the three examples– strictlycommutative, asymptotically commutative, and conditionally commutative– fullyconfirms the spectral functor as a categorical foundation for the transfer of stabilityacross scales.

•May 29, 2026•0 citations

Complexity as Geodesic Depth Off the Compact-Dual Fixed Locus: A Geometric Reading of Computational Hardness in the Compact Dual Object

Karl J Kreder III

The compact dual object is ℂH²/ℂP². Its noncompact presentation ℂH² is a negatively curved continuous-frequency reading; its compact presentation ℂP² is a closed, discrete, finite readout. The compact-dual transform Π is the curved analogue of the Fourier transform. Computational complexity is treated here as a geometric quantity of this object: the search cost of a problem is the geodesic depth of its answer in the noncompact presentation, while the verification cost is the evaluation of a discrete standing mode in the compact presentation, with both evaluations belonging to the same compact-dual object. A problem is easy exactly when its certificate lies on the compact-dual fixed locus of ρ → iρ, where search depth and finite readout agree; hardness is the distance off that locus. This geometric dictionary organizes the known hardness hierarchy by geodesic distance from the fixed locus, with an Euler-product/character handle setting sub-exponential versus exponential search. On finite abelian periods, Π restricts to the finite Fourier transform used by Shor-type algorithms; non-abelian obstructions are not reduced by this abelian Fourier mechanism. The arithmetic instance is derived directly from the Gaussian-rational node calculus: search on ℂH² is the factorization shift operator, verification on ℂP² is the discrete self-adjoint spectrum, and primality is read by a fixed-locus gcd spectrum rather than by factorization. The required closures are supplied in the body. The finite abelian restriction of Π is proved to be the finite Fourier transform. The exponential search exponent ½ is derived from a single off-locus distance, while the sub-exponential exponent ⅓ follows from a two-sided compact-dual balance traded through a ℂP² capacity, with the coupled fixed point forcing ⅓ algebraically by 4x = 1 + x. The prefactor is also recovered: the collapsed evaluation gives 3^(1/3), and the resolved compact-dual balance gives the number-field-sieve constant (64/9)^(1/3), the two differing exactly by the closure Hessian ∇²Θ(0) = ¾, so c_NFS = 3^(1/3)/(¾). The invariant calculus anchors this structure on the signed curvature tensor Rε = ε(gg + gg) and the shared ⅜ r² germ. The lattice case closes by embedding a lattice as a compact-dual Gram packet, whose dihedral reflection is the antiunitary conjugation-parity sector, disjoint from the unitary determinant-lock on which Π lives; therefore the abelian Fourier reduction does not apply. The conjugacy bound is recognized as the fundamental complexity, with operation count as its projection onto a chosen solver or platform.

•Jun 23, 2026•0 citations

The Geometry of Invariance: Replacing the Hardware-First Quantum Roadmap with Algebraic Spectral Determinism

Frank Morales

Executive Summary "The Geometry of Invariance: Replacing the Hardware-First Quantum Roadmap with Algebraic Spectral Determinism" (Morales Aguilera, October 2026) argues that the physicalist approach to quantum computation—relying on cryogenic superconducting circuits, optical traps, and physical qubit superposition—is an engineering surrogate for an incomplete analytical geometry. The paper introduces Arithmetic Spectral Theory (AST) and the Laplace–Euler–Fourier–Mellin (LEFM) operator, presenting a deterministic, closed-form mathematical framework running on classical silicon. Across 19 canonical computational problems traditionally reserved for quantum advantage (including Shor-type factoring, discrete logarithms, Grover search, VQE, and Hamiltonian simulation), the framework executes deterministically on a single classical CPU thread in 0.8672 seconds with an invariant memory footprint of approximately 650 KB, verified under deterministic initialization (Seed = 123) and sealed by immutable SHA-256 digests (c27ea09... and 8dd8c75...). Key Mathematical Foundations The Pure Prime Kernel ($\mathcal{P}$): The infinite Euler product of the Riemann zeta function is truncated to the first six prime numbers: $$\mathcal{P} = \{2, 3, 5, 7, 11, 13\}$$ The Dynamic LEFM Operator Symbol: Defined over the complex spectral coordinate $s = \sigma + i\gamma$ as: $$\mathcal{E}_{\text{LEFM}}(s) = \prod_{p \in \mathcal{P}} (1 - p^{-s})^{-1} = \prod_{p \in \mathcal{P}} (1 - e^{-s \ln p})^{-1}$$ This acts as a simultaneous continuous Fourier transform along the frequency coordinate $\gamma$ and a Mellin transform along the scaling coordinate $\sigma$. The Euler Attenuation Constant ($\Lambda$): $$\Lambda = 1 - \prod_{p \in \mathcal{P}} (1 - p^{-1/2}) \approx 0.9785142874$$ The paper proves that this finite kernel accounts for $97.8514\%$ of the total spectral coherence energy of the prime continuum. The Spectral Trap Theorem on $\sigma = 1/2$: Mapping the continuous response into the Gelfand–Shilov distribution space $\mathcal{S}'$ enforces the admissibility condition $e^{\alpha u} \in \mathcal{S}' \iff \alpha = 0$ (where $\alpha = \sigma - 1/2$). Deviations from $\sigma = 1/2$ lead to unbounded growth, trapping the continuous operator response directly on the critical line. Self-Adjoint Hilbert–Pólya Realization: Resolving prior anti-Hermitian cancellation artifacts, the Hamiltonian is structured in a symmetric Berry–Keating momentum-coordinate form: $$H_{ij} = \begin{cases} \gamma_i, & i = j \\ \frac{c_0 \cdot \Lambda}{1 + (i - j)^2}, & i \neq j \end{cases}$$ where $\gamma_i$ are ordered non-trivial Riemann zeta zeros and $c_0 = 0.05$, guaranteeing real, non-degenerate energy spectra. Topological Continual Backpropagation (Topo-CBP): Catastrophic forgetting in learning systems is eliminated by masking gradient updates on prime-indexed coordinate intersections: $$(\mathcal{M}_{\mathcal{P}})_{ij} = \begin{cases} 1, & i \in \mathcal{P} \text{ or } j \in \mathcal{P} \\ 0, & \text{otherwise} \end{cases}$$ Constrained weight updates yield an invariant parameter drift of exactly $\Vert{}\Delta \mathcal{W}_{\mathcal{P}}\Vert{}_F = 0.000000$ with $\mathcal{O}(1)$ storage overhead. Solutions to the 19 Canonical QC Problems ID Problem / Target Domain Classical AST/LEFM Method Key Result / Metric Execution Time PROB-01 Large Number Factorization Fermat–Riemann coordinate scan + Pollard-rho batch-GCD Factored composites up to 64-bit semiprime 0.0335 s PROB-02 Hilbert–Pólya Energy Spectrum LAPACK eigvalsh on symmetric Berry–Keating matrix $E_1 \approx 14.135, E_2 \approx 21.022, E_3 \approx 25.011$ 0.0042 s PROB-03 Non-Convex Energy Minima LEFM spectral potential mapping $V(\gamma) = \Vert{}\mathcal{E}(0.5+i\gamma)\Vert{}$ Global min found at $\gamma^* = 14.008, E_{\min} = 0.1675$ 0.0121 s PROB-04 Polynomial Intersection Fit Logarithmic prime kernel transform + classical SVD Resolved polynomial coefficients ($c_2=9.214, c_1=-10.005$) 0.0018 s PROB-05 Quantum Optical Network (64 Ports) Polar-decomposed unitary transfer matrix $H$ Unitary error $\Vert{}H - H^\dagger\Vert{}_F = 0.00000$ 0.0165 s PROB-06 3D Spin Lattice (64 Sites) $4 \times 4 \times 4$ cubic lattice with LEFM on-site potentials Ground-state energy $E_0 = -0.1267$ 0.0084 s PROB-07 Graph Max-Cut (QAOA Alternative) Spectral Graph Theory: sign of the Fiedler vector ($v_2$) Unweighted 20-node graph cut weight $= 13.0$ 0.0029 s PROB-08 Discrete Logarithm Extraction Baby-step giant-step over prime subfields Solved $5^x \equiv 9525 \pmod{10007} \implies x = 2468$ 0.0182 s PROB-09 Deterministic State Teleportation Transfer channel parameterized by $\Lambda$ Unitary state fidelity $\mathcal{F} = 1.00000$ 0.0009 s PROB-10 Continual Learning Zero-Drift Prime-anchor subspace freezing ($\mathcal{M}_{\mathcal{P}}$) Exact zero parameter drift: $\Vert{}\Delta \mathcal{W}_{\mathcal{P}}\Vert{}_F = 0.000000$ 0.0031 s PROB-11 Molecular Ground State (VQE) STO-3G minimal basis electronic Hamiltonian for $\text{H}_2$ Exact ground state $E_{\text{ground}} = -1.161952 \text{ Hartree}$ 0.0008 s PROB-12 Travelling Salesperson Problem (TSP) Distance Laplacian sorted via Fiedler vector coordinates 12-city optimal closed tour length $= 6.5908$ 0.0025 s PROB-13 Quantum Phase Estimation (QPE) Direct unitary matrix phase diagonalization Target $\theta = 0.4375 \implies \theta_{\text{recovered}} = 0.437500$ 0.0007 s PROB-14 Unstructured Database Search Spectral coordinate array embedding ($N = 4096$) Target index $k^* = 2841$ located in $\mathcal{O}(1)$ time 0.0006 s PROB-15 High-Dimensional Integration Weyl–Mellin quasi-Monte Carlo grid on $\sqrt{p}$ 4D hypercube integral evaluated with 0.048% error 0.0041 s PROB-16 Linear Systems Solver (HHL) Spectral inversion $x = V \operatorname{diag}(1/\lambda) V^T b$ Residual $\Vert{}Ax - b\Vert{}_2 = 4.94 \times 10^{-15}$ 0.0011 s PROB-17 Quantum Random Number Gen (QRNG) Continuous phase angle thresholding for $p \in [17, 37]$ Cryptographically non-periodic bitstream generated 0.0038 s PROB-18 Lindblad Master Dissipation Open system density matrix commutator evolution Strict trace conservation: $\frac{d}{dt}\operatorname{Tr}(\rho) = 0.00000$ 0.0014 s PROB-19 Post-Quantum Signature Token Kernel spectral response XOR token + SHA-256 Deterministic invariant signature generated 0.0022 s Comparative Ablation Analysis When the LEFM operator, prime kernel $\mathcal{P}$, and $\Lambda$ are removed under identical test conditions: Factoring ($N=91$): Standard solvers converged to saddle points ($x = 45.5$) instead of resolving $7 \times 13$. Energy Minimization: Ablated solvers became trapped in local minima ($E = 1.335955$ vs. AST global minimum $E = 0.519975$). Optical Networks & State Evolution: Unitarity error degraded to $30.6258$ and wave function norm exploded ($\Vert{}\psi(t)\Vert{} = 1.314279$), whereas AST preserved machine-precision unitarity ($\sim 10^{-14}$) and exact norm conservation ($1.000000000000$). Optimization & Inversion: Standard linear solvers crashed with singular-matrix errors in portfolio routines and caused severe noise cascades in fraud detection. Core Conclusion The monograph concludes that physical quantum computing represents an attempt to brute-force exponential complexity by building cryogenic, decoherence-prone hardware. In contrast, Arithmetic Spectral Theory links quantum unitarity directly to the critical line $\sigma = 1/2$ of the Riemann zeta function, showing that the underlying state-space manifolds can be evaluated deterministically on commodity silicon using closed-form algebraic geometry.

•Oct 23, 2026•0 citations

Holographic Constraint Network Spectral Flow Program C: Spectral Entanglement Entropy and Holographic Area Law — The Ryu-Takayanagi Formula within the Constraint Network Framework

changzheng zhou, ZIQING zhou

This paper encodes the subsystem entanglement structure of boundary conformal field theory into a weighted graph and defines the spectral entanglemententropy via the spectral theory of the Dirichlet-to-Neumann map. Within the constraint network framework, a continuum limit and a mechanism for dimensionalemergence are introduced to establish a rigorous transition from discrete spectrato continuous holographic geometry. It is proved that, in the rigid limit, the spectral entanglement entropy strictly decomposes into the sum of a geometric areaterm and a topological correction term: the area term arises from a strictly positive lower bound on the spectral gap of the Dirichlet-to-Neumann map and ispinned by the curvature of the extremal surface; the topological correction termoriginates from the nullity of the coarse-grained rigid kernel, whose value is proportional to the absolute value of the Euler characteristic. It is further proved thatthe stability of a quantum extremal surface is equivalent to the algebraic connectivity of the quotient graph being strictly positive, a condition characterized bythe Fiedler value. This yields three testable predictions, encompassing a universal difference in the topological correction, multi-surface transitions for non-convexregions, and the finite-temperature spectral-gap scaling, and reveals a deep isomorphism with holographic quantum error correction. This framework unifies thegeometric origin, quantum corrections, and the recoverability of error correction ofthe Ryu-Takayanagi formula within a single spectral flow structure.

•Jul 9, 2026•0 citations
Period finding is the arithmetic core of integer factorisation. Given a base acoprime to N, the goal is to find the order r of the element a in the multiplicativegroup Z∗N. Quantum computation uses the quantum Fourier transform to accomplish frequency-domain concentration of the periodic signal in a single step, whereasclassical randomised algorithms can only sample point by point in the time domain.This article establishes and systematically expounds a unified spectral readoutprinciple: on the Cayley graph of a cyclic subgroup ⟨b⟩, the identity observationof any ergodic translation-invariant dynamics is a functional of its dual characterspectral data, and the period r is encoded in this functional as a discrete invariant;unitary readout (Fourier support set) and dissipative readout (heat-kernel poweraverage) are two extreme instances of this principle, and the readout complexityis controlled solely by the spectral gap of the transition operator. This articlegives a sieve criterion for lower bounds on the spectral gap (the sieve-hole condition), proves that the exponential range of dyadic generating sets is incompressiblewithin an additive constant, and constructs the first provably fast-mixing example outside the dyadic case (a triple-generator set, with asymptotic iteration countabout 42% of the dyadic one). The core theorem determines the precise asymptotics of the universal spectral-gap constant: for Mersenne moduli r = 2m −1, theworst eigenvalue asymptotically attains the extremum with an explicit constantc0 = j≥1(1 −cos(π/2j−1)) ≈ 3.3946; Fermat-type moduli r = 2m + 1 approachthe same constant from below, forming a two-sided sandwich. This leads to theuniversal constant conjecture: if it holds, the constant in the known spectral-gaplower bound can be precisely improved by about 3.39 times. Furthermore, the variable of the “classical/quantum” phase-transition boundary is relocated to parallelaccess capability Π, a rigorous computational-model semantics of Π (Bulk-RAM)is given, two foundational theorems are proved, and the sublinear simulation lowerbound problem for heat-kernel readout is proposed as the first concrete instance ofthe Π-non-simulability barrier.
Under the constraint network phase transition framework, the computationalhardness underlying post-quantum cryptographic standards manifests three fundamental types of rigidity: spectrum-hiding, geometric torsion, and one-way condensation. The vulnerability of integer factorisation and discrete logarithms stems fromthe spectral manifestness of their rigidity kernels — the hidden subgroup structurecan be directly extracted in the frequency domain by the quantum Fourier transform. The quantum resistance of the shortest vector problem, the closest vectorproblem, and the learning with errors problem in lattice cryptography is rootedin the incompressibility of local geometric extrema in a high-dimensional continuous metric space: their rigidity kernels are neither encodable by characters offinite abelian groups, nor can their geometric entropy, which grows linearly withdimension, be altered by diffusive quantum operators beyond reducing exponential constants without changing the exponential type. Hash-based signatures relyon the information potential well of one-way condensation operators and remainexponentially secure even in the quantum random oracle model. This paper provides a quantum immunity criterion at the operator-algebra level and extends itto a generalised criterion covering both spectral-diagnostic and diffusive quantumoperator families, and retrospectively verifies the sufficiency of the parameter designs of Kyber, Dilithium, and SPHINCS+. The entire argument carries explicitcondition-depth annotations, and the entropy budget for cross-domain mappingsis constrained by the axiom of information conservation, thereby establishing thegeometric foundation of post-quantum cryptography within honest boundaries.
Under the framework of constraint network geometry, this paper reconstructsthe core mechanism of Shor’s quantum factoring algorithm as a spectral diagnosticprocess. By establishing a projective correspondence between the power orbits inthe multiplicative group modulo N and the causal hierarchy structure of sievetime trees, we argue that the period r is geometrically equivalent to the length ofa closed causal chain in the projection fibre, and that this length is constrainedby the factor structure of Euler’s totient function φ(N). The quantum Fouriertransform is reformulated as a spectral condensation operator that maps from thelocal constraint layer in the time domain to the global periodic layer in the frequencydomain; its mathematical backbone is furnished by Pontryagin duality and sheaftheoretic section spaces. The two-register entangled state is mapped to a twonode coupling system in an intertextual network, where the information potentialdifference is transmitted via a correlation matrix and its generalised inverse.This paper attempts to distinguish standard number-theoretic facts from crossdomain heuristic mappings. The boundary of this distinction is given in Chapter8; known ambiguous zones exist (e.g., the q|r ideal condition in Chapter 5, the G2parameter correspondence in Chapter 6). The three layers are connected throughinterlayer composition and conditional reduction, and we clearly distinguish provenfacts, conditional heuristic mappings, and conjectures awaiting formalisation.Keywords: Shor’s algorithm; sieve-time tree; multiplicative group modulo N;quantum Fourier transform; constraint network; spectral condensation; prime rigidity kernel; intertextual coupling
The energy gaps appearing in different physical systems– the anyonic excitation gap of Kitaev’s toric code, the first eigenvalue of the Laplacian on a compactRiemannian manifold, and the mass gap of Yang–Mills theory– traditionally belong to three isolated domains: topological order, spectral geometry, and quantumfield theory. In this paper we construct a covariant functor, called the spectralfunctor, between the category of weighted constraint networks and the category ofself-adjoint operators, and prove that the three types of gaps are not independentphenomena but manifestations of a common spectral structure on different physicalsource objects. The codomain of the spectral functor is the SA-Hilb category whichcarries self-adjoint operator information, thereby avoiding the categorical defect ofattaching spectral information externally to Hilbert spaces. Rigorous verification ofthe functor axioms ensures covariance between coarse-graining and spectral preservation. For the toric code, the gap ∆ = 4J is strictly derived from the stabilizeralgebra; under coarse-graining the effective coupling constant is strictly given bythe compression of matrix elements of the Galerkin projection, and the dimensionless gap remains invariant. For the Laplacian, the finite element discretisationresolves the conflict between negative stiffness matrix entries and the positivityaxiom of weights by distinguishing geometric weights from coupling operators; theclosed-form solution of the first eigenvalue (4/h2)sin2(h/2) converges exactly tothe continuum spectral gap, and the deviation from asymptotic commutativity ofcoarse-graining is controlled by O(H2). For Yang–Mills theory, we draw an honestboundary between classical constraint networks and quantum operators, formulatethe mass gap problem as a uniform positivity condition for the spectral gap of lattice constraint networks, and establish a one-way logical closure, clearly indicatingthe mathematical obstacles for the reverse reconstruction. The Bures informationgeometric metric based on thermal states further unifies the spectral gap and theinformation-geometric distance through two-way inequalities, making the physicalenergy gap, the operator spectral gap, and the information-geometric rigidity radius equivalent. The commutativity verification of the three examples– strictlycommutative, asymptotically commutative, and conditionally commutative– fullyconfirms the spectral functor as a categorical foundation for the transfer of stabilityacross scales.
The compact dual object is ℂH²/ℂP². Its noncompact presentation ℂH² is a negatively curved continuous-frequency reading; its compact presentation ℂP² is a closed, discrete, finite readout. The compact-dual transform Π is the curved analogue of the Fourier transform. Computational complexity is treated here as a geometric quantity of this object: the search cost of a problem is the geodesic depth of its answer in the noncompact presentation, while the verification cost is the evaluation of a discrete standing mode in the compact presentation, with both evaluations belonging to the same compact-dual object. A problem is easy exactly when its certificate lies on the compact-dual fixed locus of ρ → iρ, where search depth and finite readout agree; hardness is the distance off that locus. This geometric dictionary organizes the known hardness hierarchy by geodesic distance from the fixed locus, with an Euler-product/character handle setting sub-exponential versus exponential search. On finite abelian periods, Π restricts to the finite Fourier transform used by Shor-type algorithms; non-abelian obstructions are not reduced by this abelian Fourier mechanism. The arithmetic instance is derived directly from the Gaussian-rational node calculus: search on ℂH² is the factorization shift operator, verification on ℂP² is the discrete self-adjoint spectrum, and primality is read by a fixed-locus gcd spectrum rather than by factorization. The required closures are supplied in the body. The finite abelian restriction of Π is proved to be the finite Fourier transform. The exponential search exponent ½ is derived from a single off-locus distance, while the sub-exponential exponent ⅓ follows from a two-sided compact-dual balance traded through a ℂP² capacity, with the coupled fixed point forcing ⅓ algebraically by 4x = 1 + x. The prefactor is also recovered: the collapsed evaluation gives 3^(1/3), and the resolved compact-dual balance gives the number-field-sieve constant (64/9)^(1/3), the two differing exactly by the closure Hessian ∇²Θ(0) = ¾, so c_NFS = 3^(1/3)/(¾). The invariant calculus anchors this structure on the signed curvature tensor Rε = ε(gg + gg) and the shared ⅜ r² germ. The lattice case closes by embedding a lattice as a compact-dual Gram packet, whose dihedral reflection is the antiunitary conjugation-parity sector, disjoint from the unitary determinant-lock on which Π lives; therefore the abelian Fourier reduction does not apply. The conjugacy bound is recognized as the fundamental complexity, with operation count as its projection onto a chosen solver or platform.
Executive Summary "The Geometry of Invariance: Replacing the Hardware-First Quantum Roadmap with Algebraic Spectral Determinism" (Morales Aguilera, October 2026) argues that the physicalist approach to quantum computation—relying on cryogenic superconducting circuits, optical traps, and physical qubit superposition—is an engineering surrogate for an incomplete analytical geometry. The paper introduces Arithmetic Spectral Theory (AST) and the Laplace–Euler–Fourier–Mellin (LEFM) operator, presenting a deterministic, closed-form mathematical framework running on classical silicon. Across 19 canonical computational problems traditionally reserved for quantum advantage (including Shor-type factoring, discrete logarithms, Grover search, VQE, and Hamiltonian simulation), the framework executes deterministically on a single classical CPU thread in 0.8672 seconds with an invariant memory footprint of approximately 650 KB, verified under deterministic initialization (Seed = 123) and sealed by immutable SHA-256 digests (c27ea09... and 8dd8c75...). Key Mathematical Foundations The Pure Prime Kernel (P\mathcal{P}P): The infinite Euler product of the Riemann zeta function is truncated to the first six prime numbers: P={2,3,5,7,11,13}\mathcal{P} = \{2, 3, 5, 7, 11, 13\}P={2,3,5,7,11,13} The Dynamic LEFM Operator Symbol: Defined over the complex spectral coordinate s=σ+iγs = \sigma + i\gammas=σ+iγ as: ELEFM(s)=∏p∈P(1−p−s)−1=∏p∈P(1−e−sln⁡p)−1\mathcal{E}_{\text{LEFM}}(s) = \prod_{p \in \mathcal{P}} (1 - p^{-s})^{-1} = \prod_{p \in \mathcal{P}} (1 - e^{-s \ln p})^{-1}ELEFM​(s)=∏p∈P​(1−p−s)−1=∏p∈P​(1−e−slnp)−1 This acts as a simultaneous continuous Fourier transform along the frequency coordinate γ\gammaγ and a Mellin transform along the scaling coordinate σ\sigmaσ. The Euler Attenuation Constant (Λ\LambdaΛ): Λ=1−∏p∈P(1−p−1/2)≈0.9785142874\Lambda = 1 - \prod_{p \in \mathcal{P}} (1 - p^{-1/2}) \approx 0.9785142874Λ=1−∏p∈P​(1−p−1/2)≈0.9785142874 The paper proves that this finite kernel accounts for 97.8514%97.8514\%97.8514% of the total spectral coherence energy of the prime continuum. The Spectral Trap Theorem on σ=1/2\sigma = 1/2σ=1/2: Mapping the continuous response into the Gelfand–Shilov distribution space S′\mathcal{S}'S′ enforces the admissibility condition eαu∈S′  ⟺  α=0e^{\alpha u} \in \mathcal{S}' \iff \alpha = 0eαu∈S′⟺α=0 (where α=σ−1/2\alpha = \sigma - 1/2α=σ−1/2). Deviations from σ=1/2\sigma = 1/2σ=1/2 lead to unbounded growth, trapping the continuous operator response directly on the critical line. Self-Adjoint Hilbert–Pólya Realization: Resolving prior anti-Hermitian cancellation artifacts, the Hamiltonian is structured in a symmetric Berry–Keating momentum-coordinate form: Hij={γi,i=jc0⋅Λ1+(i−j)2,i≠jH_{ij} = \begin{cases} \gamma_i, & i = j \\ \frac{c_0 \cdot \Lambda}{1 + (i - j)^2}, & i \neq j \end{cases}Hij​={γi​,1+(i−j)2c0​⋅Λ​,​i=ji=j​ where γi\gamma_iγi​ are ordered non-trivial Riemann zeta zeros and c0=0.05c_0 = 0.05c0​=0.05, guaranteeing real, non-degenerate energy spectra. Topological Continual Backpropagation (Topo-CBP): Catastrophic forgetting in learning systems is eliminated by masking gradient updates on prime-indexed coordinate intersections: (MP)ij={1,i∈P or j∈P0,otherwise(\mathcal{M}_{\mathcal{P}})_{ij} = \begin{cases} 1, & i \in \mathcal{P} \text{ or } j \in \mathcal{P} \\ 0, & \text{otherwise} \end{cases}(MP​)ij​={1,0,​i∈P or j∈Potherwise​ Constrained weight updates yield an invariant parameter drift of exactly ∥ΔWP∥F=0.000000\Vert{}\Delta \mathcal{W}_{\mathcal{P}}\Vert{}_F = 0.000000∥ΔWP​∥F​=0.000000 with O(1)\mathcal{O}(1)O(1) storage overhead. Solutions to the 19 Canonical QC Problems ID Problem / Target Domain Classical AST/LEFM Method Key Result / Metric Execution Time PROB-01 Large Number Factorization Fermat–Riemann coordinate scan + Pollard-rho batch-GCD Factored composites up to 64-bit semiprime 0.0335 s PROB-02 Hilbert–Pólya Energy Spectrum LAPACK eigvalsh on symmetric Berry–Keating matrix E1≈14.135,E2≈21.022,E3≈25.011E_1 \approx 14.135, E_2 \approx 21.022, E_3 \approx 25.011E1​≈14.135,E2​≈21.022,E3​≈25.011 0.0042 s PROB-03 Non-Convex Energy Minima LEFM spectral potential mapping V(γ)=∥E(0.5+iγ)∥V(\gamma) = \Vert{}\mathcal{E}(0.5+i\gamma)\Vert{}V(γ)=∥E(0.5+iγ)∥ Global min found at γ∗=14.008,Emin⁡=0.1675\gamma^* = 14.008, E_{\min} = 0.1675γ∗=14.008,Emin​=0.1675 0.0121 s PROB-04 Polynomial Intersection Fit Logarithmic prime kernel transform + classical SVD Resolved polynomial coefficients (c2=9.214,c1=−10.005c_2=9.214, c_1=-10.005c2​=9.214,c1​=−10.005) 0.0018 s PROB-05 Quantum Optical Network (64 Ports) Polar-decomposed unitary transfer matrix HHH Unitary error ∥H−H†∥F=0.00000\Vert{}H - H^\dagger\Vert{}_F = 0.00000∥H−H†∥F​=0.00000 0.0165 s PROB-06 3D Spin Lattice (64 Sites) 4×4×44 \times 4 \times 44×4×4 cubic lattice with LEFM on-site potentials Ground-state energy E0=−0.1267E_0 = -0.1267E0​=−0.1267 0.0084 s PROB-07 Graph Max-Cut (QAOA Alternative) Spectral Graph Theory: sign of the Fiedler vector (v2v_2v2​) Unweighted 20-node graph cut weight =13.0= 13.0=13.0 0.0029 s PROB-08 Discrete Logarithm Extraction Baby-step giant-step over prime subfields Solved 5x≡9525(mod10007)  ⟹  x=24685^x \equiv 9525 \pmod{10007} \implies x = 24685x≡9525(mod10007)⟹x=2468 0.0182 s PROB-09 Deterministic State Teleportation Transfer channel parameterized by Λ\LambdaΛ Unitary state fidelity F=1.00000\mathcal{F} = 1.00000F=1.00000 0.0009 s PROB-10 Continual Learning Zero-Drift Prime-anchor subspace freezing (MP\mathcal{M}_{\mathcal{P}}MP​) Exact zero parameter drift: ∥ΔWP∥F=0.000000\Vert{}\Delta \mathcal{W}_{\mathcal{P}}\Vert{}_F = 0.000000∥ΔWP​∥F​=0.000000 0.0031 s PROB-11 Molecular Ground State (VQE) STO-3G minimal basis electronic Hamiltonian for H2\text{H}_2H2​ Exact ground state Eground=−1.161952 HartreeE_{\text{ground}} = -1.161952 \text{ Hartree}Eground​=−1.161952 Hartree 0.0008 s PROB-12 Travelling Salesperson Problem (TSP) Distance Laplacian sorted via Fiedler vector coordinates 12-city optimal closed tour length =6.5908= 6.5908=6.5908 0.0025 s PROB-13 Quantum Phase Estimation (QPE) Direct unitary matrix phase diagonalization Target θ=0.4375  ⟹  θrecovered=0.437500\theta = 0.4375 \implies \theta_{\text{recovered}} = 0.437500θ=0.4375⟹θrecovered​=0.437500 0.0007 s PROB-14 Unstructured Database Search Spectral coordinate array embedding (N=4096N = 4096N=4096) Target index k∗=2841k^* = 2841k∗=2841 located in O(1)\mathcal{O}(1)O(1) time 0.0006 s PROB-15 High-Dimensional Integration Weyl–Mellin quasi-Monte Carlo grid on p\sqrt{p}p​ 4D hypercube integral evaluated with 0.048% error 0.0041 s PROB-16 Linear Systems Solver (HHL) Spectral inversion x=Vdiag⁡(1/λ)VTbx = V \operatorname{diag}(1/\lambda) V^T bx=Vdiag(1/λ)VTb Residual ∥Ax−b∥2=4.94×10−15\Vert{}Ax - b\Vert{}_2 = 4.94 \times 10^{-15}∥Ax−b∥2​=4.94×10−15 0.0011 s PROB-17 Quantum Random Number Gen (QRNG) Continuous phase angle thresholding for p∈[17,37]p \in [17, 37]p∈[17,37] Cryptographically non-periodic bitstream generated 0.0038 s PROB-18 Lindblad Master Dissipation Open system density matrix commutator evolution Strict trace conservation: ddtTr⁡(ρ)=0.00000\frac{d}{dt}\operatorname{Tr}(\rho) = 0.00000dtd​Tr(ρ)=0.00000 0.0014 s PROB-19 Post-Quantum Signature Token Kernel spectral response XOR token + SHA-256 Deterministic invariant signature generated 0.0022 s Comparative Ablation Analysis When the LEFM operator, prime kernel P\mathcal{P}P, and Λ\LambdaΛ are removed under identical test conditions: Factoring (N=91N=91N=91): Standard solvers converged to saddle points (x=45.5x = 45.5x=45.5) instead of resolving 7×137 \times 137×13. Energy Minimization: Ablated solvers became trapped in local minima (E=1.335955E = 1.335955E=1.335955 vs. AST global minimum E=0.519975E = 0.519975E=0.519975). Optical Networks & State Evolution: Unitarity error degraded to 30.625830.625830.6258 and wave function norm exploded (∥ψ(t)∥=1.314279\Vert{}\psi(t)\Vert{} = 1.314279∥ψ(t)∥=1.314279), whereas AST preserved machine-precision unitarity (∼10−14\sim 10^{-14}∼10−14) and exact norm conservation (1.0000000000001.0000000000001.000000000000). Optimization & Inversion: Standard linear solvers crashed with singular-matrix errors in portfolio routines and caused severe noise cascades in fraud detection. Core Conclusion The monograph concludes that physical quantum computing represents an attempt to brute-force exponential complexity by building cryogenic, decoherence-prone hardware. In contrast, Arithmetic Spectral Theory links quantum unitarity directly to the critical line σ=1/2\sigma = 1/2σ=1/2 of the Riemann zeta function, showing that the underlying state-space manifolds can be evaluated deterministically on commodity silicon using closed-form algebraic geometry.
This paper encodes the subsystem entanglement structure of boundary conformal field theory into a weighted graph and defines the spectral entanglemententropy via the spectral theory of the Dirichlet-to-Neumann map. Within the constraint network framework, a continuum limit and a mechanism for dimensionalemergence are introduced to establish a rigorous transition from discrete spectrato continuous holographic geometry. It is proved that, in the rigid limit, the spectral entanglement entropy strictly decomposes into the sum of a geometric areaterm and a topological correction term: the area term arises from a strictly positive lower bound on the spectral gap of the Dirichlet-to-Neumann map and ispinned by the curvature of the extremal surface; the topological correction termoriginates from the nullity of the coarse-grained rigid kernel, whose value is proportional to the absolute value of the Euler characteristic. It is further proved thatthe stability of a quantum extremal surface is equivalent to the algebraic connectivity of the quotient graph being strictly positive, a condition characterized bythe Fiedler value. This yields three testable predictions, encompassing a universal difference in the topological correction, multi-surface transitions for non-convexregions, and the finite-temperature spectral-gap scaling, and reveals a deep isomorphism with holographic quantum error correction. This framework unifies thegeometric origin, quantum corrections, and the recoverability of error correction ofthe Ryu-Takayanagi formula within a single spectral flow structure.