Composition Law of Conjugate Observables in Random Permutation Sorting Systems

• URL: http://arxiv.org/abs/2510.08013v1
• Date: Thu, 09 Oct 2025 09:50:21 GMT
• Title: Composition Law of Conjugate Observables in Random Permutation Sorting Systems
• Authors: Yurang R. Kuang,
• Abstract summary: We present the discovery of a fundamental composition law governing conjugate observables in the Random Permutation Sorting System (RPSS)<n>The law links the discrete permutation count Np and the continuous elapsed time T through a functional relation connecting the characteristic function of timing to the probability generating function of permutation counts.<n>This framework enables entropy purification, transforming microarchitectural timing fluctuations into uniform randomness via geometric convergence.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present the discovery of a fundamental composition law governing conjugate observables in the Random Permutation Sorting System (RPSS). The law links the discrete permutation count Np and the continuous elapsed time T through a functional relation connecting the characteristic function of timing distributions to the probability generating function of permutation counts. This framework enables entropy purification, transforming microarchitectural timing fluctuations into uniform randomness via geometric convergence. We establish convergence theorems with explicit bounds and validate the results experimentally, achieving Shannon entropy above 7.9998 bits per byte and chi-square uniformity across diverse platforms. The composition law provides a universal foundation for generating provably uniform randomness from general-purpose computation, securing cryptographic purity from emergent computational dynamics.

Related papers

• Freeness Reined in by a Single Qubit [36.94429692322632]
  We find that, even in this setting, the correlation functions predicted by free probability theory receive corrections of order $O(1)$.<n>We trace their origin to non-uniformly distributed stationary quantum states, which we characterize analytically and confirm numerically.
  arXiv  Detail & Related papers  (2025-12-15T19:00:09Z)
• Digital Coherent-State QRNG Using System-Jitter Entropy via Random Permutation [0.0]
  We present a digital framework that replicates the statistical behavior of coherent-state quantum random number generation (QRNG)<n>Our approach transforms computational timing variations from hardware and operating system sources into permutation dynamics that generate Poisson-distributed numbers.<n>Our results establish that coherent-state QRNG functionality can be entirely realized through classical computational processes.
  arXiv  Detail & Related papers  (2025-12-11T20:47:00Z)
• Statistical Quantum Mechanics of the Random Permutation Sorting System (RPSS): A Self-Stabilizing True Uniform RNG [0.0]
  We present the Random Permutation Sorting System (RPSS), a novel framework for true uniform randomness generation grounded in quantum mechanics.<n>RPSS is built on a pair of conjugate observables, the permutation count and the elapsed sorting time, whose heavy-tailed raw distributions synchronously converge to uniformity through modular reduction.<n>A practical implementation, QPP-RNG, demonstrates how intrinsic system jitter, arising from microarchitectural noise, memory latency, and scheduling dynamics, interacts with complexity to yield a compact, self-stabilizing entropy source.
  arXiv  Detail & Related papers  (2025-09-12T12:04:13Z)
• QPP-RNG: A Conceptual Quantum System for True Randomness [0.0]
  We show a conceptual quantum system for randomness generation built on measuring two conjugate observables of a permutation sorting process.<n>By analogy with quantum systems, these observables are linked by an uncertainty-like constraint.<n>We realize this framework concretely as emphQPP-RNG, a system-embedded, software-based true random number generator.
  arXiv  Detail & Related papers  (2025-08-01T20:08:52Z)
• Learning convolution operators on compact Abelian groups [35.70694383605516]
  We consider the problem of learning convolution operators associated to compact Abelian groups.<n>We study a regularization-based approach and provide learning guarantees under natural regularity conditions.
  arXiv  Detail & Related papers  (2025-01-09T14:43:08Z)
• Probabilistic Representation of Commutative Quantum Circuit Models [1.2733144214254712]
  In commuting quantum circuits, the Fourier series of the pairwise fidelity can be expressed as the characteristic function of random variables.<n>We generalize this construction to any commuting set of Pauli operators.
  arXiv  Detail & Related papers  (2024-10-24T22:02:44Z)
• Random sampling of permutations through quantum circuits [0.0]
  We introduce a classical algorithm for random sampling of permutations, drawing inspiration from the Steinhaus-Johnson-Trotter algorithm.<n>We develop a quantum analogue of the classical algorithm using a quantum circuit model for random sampling of permutations.
  arXiv  Detail & Related papers  (2024-09-04T18:19:30Z)
• Quantum Random Walks and Quantum Oscillator in an Infinite-Dimensional Phase Space [45.9982965995401]
  We consider quantum random walks in an infinite-dimensional phase space constructed using Weyl representation of the coordinate and momentum operators. We find conditions for their strong continuity and establish properties of their generators.
  arXiv  Detail & Related papers  (2024-06-15T17:39:32Z)
• Sampled Transformer for Point Sets [80.66097006145999]
  sparse transformer can reduce the computational complexity of the self-attention layers to $O(n)$, whilst still being a universal approximator of continuous sequence-to-sequence functions. We propose an $O(n)$ complexity sampled transformer that can process point set elements directly without any additional inductive bias.
  arXiv  Detail & Related papers  (2023-02-28T06:38:05Z)
• The Connection between Discrete- and Continuous-Time Descriptions of Gaussian Continuous Processes [60.35125735474386]
  We show that discretizations yielding consistent estimators have the property of invariance under coarse-graining' This result explains why combining differencing schemes for derivatives reconstruction and local-in-time inference approaches does not work for time series analysis of second or higher order differential equations.
  arXiv  Detail & Related papers  (2021-01-16T17:11:02Z)
• Stochastic Saddle-Point Optimization for Wasserstein Barycenters [69.68068088508505]
  We consider the populationimation barycenter problem for random probability measures supported on a finite set of points and generated by an online stream of data. We employ the structure of the problem and obtain a convex-concave saddle-point reformulation of this problem. In the setting when the distribution of random probability measures is discrete, we propose an optimization algorithm and estimate its complexity.
  arXiv  Detail & Related papers  (2020-06-11T19:40:38Z)
• Profile Entropy: A Fundamental Measure for the Learnability and Compressibility of Discrete Distributions [63.60499266361255]
  We show that for samples of discrete distributions, profile entropy is a fundamental measure unifying the concepts of estimation, inference, and compression. Specifically, profile entropy a) determines the speed of estimating the distribution relative to the best natural estimator; b) characterizes the rate of inferring all symmetric properties compared with the best estimator over any label-invariant distribution collection; c) serves as the limit of profile compression.
  arXiv  Detail & Related papers  (2020-02-26T17:49:04Z)

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.