analiza aiqbench
This paper proposes ModularPhaseNet, a classical architecture that discretizes continuous complex phase geometry into integer computations for standard Transformers without requiring quantum hardware. By introducing finite cyclic subgroups to model semantic hierarchy and context consistency, the authors aim to improve tasks like contradiction detection and hallucination risk prediction through exact modular arithmetic rather than floating-point approximations. The work represents a theoretical extension of prior research on phase-based attention mechanisms, focusing on mathematical invariants that could enhance reasoning capabilities in existing models.
ModularPhaseNet: Finite-Cyclic Phase Geometry for Computable Semantic Hierarchy, Direction, and Context Consistency in Standard Transformers
arXiv:2609.06000v1 Announce Type: cross Abstract: We propose ModularPhaseNet, a classical and integer-computable discretization of the continuous complex phase geometry introduced in QuantumPhaseNet. The real-valued hidden states of a standard Transformer are retained, while only an auxiliary phase channel is quantized into a cyclic subgroup G = of order q | (p-1) in the multiplicative group of F_p. A continuous phase e^{i phi} is represented by z = g^a mod p; phase composition becomes group multiplication, relative phase becomes group division, conceptual hierarchy is induced by a filtration of cyclic quotients, semantic direction is represented by oriented relative group elements, and contextual consistency is measured by gauge-invariant cycle holonomy. The method introduces three components into an otherwise standard Transformer: a finite-phase encoder, a quotient-filtration hierarchy module, and a group-valued connection module. Their outputs enter self-attention as real-valued bias terms. Training uses distributions in the real group algebra or straight-through Gumbel-Softmax, whereas inference uses exact modular exponentiation and precomputed tables. No quantum hardware, complex-valued matrix multiplication, or discrete-logarithm computation is required. We prove quantization-distortion bounds, nesting of quotient-induced partitions, gauge invariance, a discrete integrability result for flat connections, and boundedness of the resulting attention output. The central empirical hypothesis is that these exact discrete invariants improve hierarchy recovery, discourse alignment, contradiction detection, and calibrated hallucination-risk prediction under a controlled compute budget. This paper reports the theory together with a pre-registered evaluation plan; the experiments described in Section 14 have not yet been carried out, and no empirical result is claimed here.
Abstract:We propose ModularPhaseNet, a classical and integer-computable discretization of the continuous complex phase geometry introduced in QuantumPhaseNet. The real-valued hidden states of a standard Transformer are retained, while only an auxiliary phase channel is quantized into a cyclic subgroup G = <g> of order q | (p-1) in the multiplicative group of F_p. A continuous phase e^{i phi} is represented by z = g^a mod p; phase composition becomes group multiplication, relative phase becomes group division, conceptual hierarchy is induced by a filtration of cyclic quotients, semantic direction is represented by oriented relative group elements, and contextual consistency is measured by gauge-invariant cycle holonomy. The method introduces three components into an otherwise standard Transformer: a finite-phase encoder, a quotient-filtration hierarchy module, and a group-valued connection module. Their outputs enter self-attention as real-valued bias terms. Training uses distributions in the real group algebra or straight-through Gumbel-Softmax, whereas inference uses exact modular exponentiation and precomputed tables. No quantum hardware, complex-valued matrix multiplication, or discrete-logarithm computation is required. We prove quantization-distortion bounds, nesting of quotient-induced partitions, gauge invariance, a discrete integrability result for flat connections, and boundedness of the resulting attention output. The central empirical hypothesis is that these exact discrete invariants improve hierarchy recovery, discourse alignment, contradiction detection, and calibrated hallucination-risk prediction under a controlled compute budget. This paper reports the theory together with a pre-registered evaluation plan; the experiments described in Section 14 have not yet been carried out, and no empirical result is claimed here.
16 pages, 1 figure. Extends arXiv:2602.14419 (WavePhaseNet) and arXiv:2608.15820 (QuantumPhaseNet). Theory and a pre-registered evaluation plan; no experimental results are reported
Computation and Language (cs.CL); Machine Learning (cs.LG)
arXiv:2609.06000 [cs.CL]
(or arXiv:2609.06000v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2609.06000 arXiv-issued DOI via DataCite (pending registration)
Text integral sub licența deschisă a publicației · 288 cuvinte
Subiecte conexe
HodgePhaseNet: Discrete Hodge Decomposition of Semantic Flows in Transformer Attention
arXiv · 14 oct. 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · 15 aug. 2026

Measurement incompatibility in Bayesian multiparameter quantum estimation
Quantum Journal · 13 aug. 2026
Majorana Constellations: A Geometric Lens on Multipartite Entanglement and Geometric Phases
arXiv · 6 aug. 2026