Digital Coherent-State QRNG Using System-Jitter Entropy via Random Permutation

• URL: http://arxiv.org/abs/2512.11107v1
• Date: Thu, 11 Dec 2025 20:47:00 GMT
• Title: Digital Coherent-State QRNG Using System-Jitter Entropy via Random Permutation
• Authors: Randy Kuang,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a fully digital framework that replicates the statistical behavior of coherent-state quantum random number generation (QRNG) by harnessing system timing jitter through random permutation processes. Our approach transforms computational timing variations from hardware and operating system sources into permutation dynamics that generate Poisson-distributed numbers, accurately reproducing the photon statistics of optical coherent states. The theoretical foundation is established by the Uniform Convergence Theorem, which provides exponential convergence to uniformity under modular projection with rigorous error bounds. Extensive experimental validation across multiple parameter regimes and sample sizes up to $10^8$ bytes demonstrates exceptional performance: Shannon entropy approaching 7.999998 bits/byte and min-entropy exceeding 7.99 bits/byte, outperforming theoretical bounds at scale. The architecture inherently resists side-channel attacks through compound timing distributions and adaptive permutation behavior, while operating without classical cryptographic post-processing. Our results establish that coherent-state QRNG functionality can be entirely realized through classical computational processes, delivering mathematically provable uniformity and practical cryptographic security without quantum photonic hardware.

Related papers

• Design and Optimization of Adaptive Diversity Schemes in Quantum MIMO Channels [45.812053169933705]
  We study an adaptive diversity strategy for discrete-variable QuMIMO systems based on universal asymmetric cloning at the transmitter and probabilistic purification at the receiver.<n>Results show that the proposed scheme yields significant fidelity gains in crosstalk-dominated settings and automatically adapts to channel symmetry and channel conditions.<n>This work provides design guidelines for future QuMIMO systems and establishes a robust baseline for more advanced transmission and decoding strategies.
  arXiv  Detail & Related papers  (2025-11-19T15:58:10Z)
• Composition Law of Conjugate Observables in Random Permutation Sorting Systems [0.0]
  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.
  arXiv  Detail & Related papers  (2025-10-09T09:50:21Z)
• 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)
• Modular Debiasing: A Robust Method for Quantum Randomness Extraction [0.0]
  We propose a novel modular debiasing technique applicable to any discrete random source.<n>We provide a rigorous theoretical framework, utilizing probability generating functions and roots of unity.<n>This work contributes a valuable tool to the field of Quantum Information Science.
  arXiv  Detail & Related papers  (2025-04-23T23:28:47Z)
• IID-Based QPP-RNG: A Random Number Generator Utilizing Random Permutation Sorting Driven by System Jitter [0.8192907805418583]
  We propose a groundbreaking random number generator that achieves uniform, independent, and identically distributed (IID) randomness.<n>Our design uses system jitter solely to generate ephemeral QPP pads and derives 8-bit outputs directly from permutation counts.<n>IID-based QPP-RNG achieves a min-entropy of 7.85-7.95 bits per byte from IID min-entropy estimate.
  arXiv  Detail & Related papers  (2025-02-25T19:53:54Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• A tunable quantum random number generator based on a fiber-optical Sagnac interferometer [0.0]
  Quantum random number generators (QRNG) are based on the naturally random measurement results performed on individual quantum systems. We demonstrate a branching-path photonic QRNG implemented with a Sagnac interferometer with a tunable splitting ratio.
  arXiv  Detail & Related papers  (2022-05-09T18:00:08Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.