Discrete Action, Graph Evolution, and the Hierarchy of Symmetries: A Rigorous Construction of Temporal Layers $C1 \to C2 \to C3 \to C4$

• URL: http://arxiv.org/abs/2511.18295v1
• Date: Sun, 23 Nov 2025 05:25:00 GMT
• Title: Discrete Action, Graph Evolution, and the Hierarchy of Symmetries: A Rigorous Construction of Temporal Layers $C1 \to C2 \to C3 \to C4$
• Authors: Medeu Abishev, Daulet Berkimbayev,
• Abstract summary: We construct a strict hierarchy of temporal layers $C N$ with discrete periods $_N=Nhbar/E$.<n>Each layer is specified by its configuration space, symplectic structure, update rule, and emergent symmetry.<n>We show that these structures follow from discrete-action principles, and that graph growth naturally provides mechanisms for decoherence and spontaneous symmetry breaking.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Postulating a minimal discrete quantum of action $S=\hbar$ and a simple rule for the growth of an oriented graph, we construct a strict hierarchy of temporal layers $C N$ with discrete periods $τ_N=N\hbar/E$. Each layer is specified by its configuration space, symplectic structure, update rule, and emergent symmetry. At $C1$ the state is represented by a single oriented edge with $U(1)$ phase $e^{i E t/\hbar}$. The transition $C1 \to C2$ splits the edge into two independent flows, which yields canonical pairs $(x_a,p_a)$, local $U(1)$ invariance, and an effective $(2{+}1)$ metric with signature $(+--)$. The closure $C2 \to C3$ produces $SU(3)$ connections and an Einstein-Yang-Mills type action. We show that these structures follow from discrete-action principles, and that stochastic graph growth naturally provides mechanisms for decoherence and spontaneous symmetry breaking.

Related papers

• Approximating the operator norm of local Hamiltonians via few quantum states [53.16156504455106]
  Consider a Hermitian operator $A$ acting on a complex Hilbert space of $2n$.<n>We show that when $A$ has small degree in the Pauli expansion, or in other words, $A$ is a local $n$-qubit Hamiltonian.<n>We show that whenever $A$ is $d$-local, textiti.e., $deg(A)le d$, we have the following discretization-type inequality.
  arXiv  Detail & Related papers  (2025-09-15T14:26:11Z)
• Contributions to the Theory of Clifford-Cyclotomic Circuits [0.0]
  We make two contributions to the theory of Clifford-cyclotomic circuits.<n>We improve the existing synthesis algorithm by showing that, when $n=2k$ and $kgeq 4$, only $k-3$ ancillas are needed to synthesize a circuit for $U$.
  arXiv  Detail & Related papers  (2025-08-20T12:44:39Z)
• Wigner quasi-probability distribution for symmetric multi-quDit systems and their generalized heat kernel [0.0]
  We analyze the phase-space structure of Schr"odinger $U(D)$-spin cat states.<n>We compute the generalized heat kernel relating two quasi-probability distributions $mathcalF(s)_rho$ and $mathcalF(s')_rho$.
  arXiv  Detail & Related papers  (2025-07-20T08:26:28Z)
• Leading and beyond leading-order spectral form factor in chaotic quantum many-body systems across all Dyson symmetry classes [8.105213101498085]
  We show the emergence of random matrix theory (RMT) spectral correlations in the chaotic phase of generic periodically kicked interacting many-body systems.<n>We analytically calculating spectral form factor (SFF), $K(t)$, up to two leading orders in time, $t$.<n>Our derivation only assumes random phase approximation to enable ensemble average.
  arXiv  Detail & Related papers  (2025-02-06T15:37:18Z)
• A General Framework for Robust G-Invariance in G-Equivariant Networks [5.227502964814928]
  We introduce a general method for achieving robust group-invariance in group-equivariant convolutional neural networks ($G$-CNNs) The completeness of the triple correlation endows the $G$-TC layer with strong robustness. We demonstrate the benefits of this method on both commutative and non-commutative groups.
  arXiv  Detail & Related papers  (2023-10-28T02:27:34Z)
• A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
  Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
  arXiv  Detail & Related papers  (2023-09-25T17:54:19Z)
• Synthesis and upper bound of Schmidt rank of the bipartite controlled-unitary gates [0.0]
  We show that $2(N-1)$ generalized controlled-$X$ (GCX) gates, $6$ single-qubit rotations about the $y$- and $z$-axes, and $N+5$ single-partite $y$- and $z$-rotation-types are required to simulate it. The quantum circuit for implementing $mathcalU_cu(2otimes N)$ and $mathcalU_cd(Motimes N)$ are presented.
  arXiv  Detail & Related papers  (2022-09-11T06:24:24Z)
• The Approximate Degree of DNF and CNF Formulas [95.94432031144716]
  For every $delta>0,$ we construct CNF and formulas of size with approximate degree $Omega(n1-delta),$ essentially matching the trivial upper bound of $n. We show that for every $delta>0$, these models require $Omega(n1-delta)$, $Omega(n/4kk2)1-delta$, and $Omega(n/4kk2)1-delta$, respectively.
  arXiv  Detail & Related papers  (2022-09-04T10:01:39Z)
• Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions [51.19236668224547]
  We study low rank approximation of tensors, focusing on the tensor train and Tucker decompositions. For tensor train decomposition, we give a bicriteria $(1 + eps)$-approximation algorithm with a small bicriteria rank and $O(q cdot nnz(A))$ running time. In addition, we extend our algorithm to tensor networks with arbitrary graphs.
  arXiv  Detail & Related papers  (2022-07-15T11:55:09Z)
• Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
  We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann. We show how our results have immediate applications to the modern theory of polarization.
  arXiv  Detail & Related papers  (2022-05-30T18:01:34Z)
• Horizon-Free Reinforcement Learning in Polynomial Time: the Power of Stationary Policies [88.75843804630772]
  We design an algorithm that achieves an $Oleft(mathrmpoly(S,A,log K)sqrtKright)$ regret in contrast to existing bounds. Our result relies on a sequence of new structural lemmas establishing the approximation power, stability, and concentration property of stationary policies.
  arXiv  Detail & Related papers  (2022-03-24T08:14:12Z)
• Low-Rank Approximation with $1/\epsilon^{1/3}$ Matrix-Vector Products [58.05771390012827]
  We study iterative methods based on Krylov subspaces for low-rank approximation under any Schatten-$p$ norm. Our main result is an algorithm that uses only $tildeO(k/sqrtepsilon)$ matrix-vector products.
  arXiv  Detail & Related papers  (2022-02-10T16:10:41Z)
• A General Derivative Identity for the Conditional Mean Estimator in Gaussian Noise and Some Applications [128.4391178665731]
  Several identities in the literature connect $E[bf X|bf Y=bf y]$ to other quantities such as the conditional variance, score functions, and higher-order conditional moments. The objective of this paper is to provide a unifying view of these identities.
  arXiv  Detail & Related papers  (2021-04-05T12:48:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.