QPP-RNG: A Conceptual Quantum System for True Randomness
- URL: http://arxiv.org/abs/2508.01051v1
- Date: Fri, 01 Aug 2025 20:08:52 GMT
- Title: QPP-RNG: A Conceptual Quantum System for True Randomness
- Authors: Randy Kuang,
- Abstract summary: 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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: We propose and experimentally demonstrate the \emph{Quasi-Superposition Quantum-inspired System (QSQS)} -- a conceptual quantum system for randomness generation built on measuring two conjugate observables of a permutation sorting process: the deterministic permutation count $n_p$ and the fundamentally non-deterministic sorting time $t$. By analogy with quantum systems, these observables are linked by an uncertainty-like constraint: algorithmic determinism ensures structural uniformity, while system-level fluctuations introduce irreducible unpredictability. We realize this framework concretely as \emph{QPP-RNG}, a system-embedded, software-based true random number generator (TRNG). In QPP-RNG, real-time measurements of sorting time $t$ -- shaped by CPU pipeline jitter, cache latency, and OS scheduling -- dynamically reseed the PRNG driving the permutation sequence. Crucially, QSQS transforms initially right-skewed raw distributions of $n_p$ and $t$ into nearly uniform outputs after modulo reduction, thanks to internal degeneracies that collapse many distinct states into the same output symbol. Empirical results show that as the repetition factor $m$ increases, output entropy converges toward theoretical maxima: Shannon and min-entropy values approach 8 bits, chi-squared statistics stabilize near ideal uniformity, and bell curves visually confirm the flattening from skewed to uniform distributions. Beyond practical implications, QSQS unifies deterministic algorithmic processes with non-deterministic physical fluctuations, offering a physics-based perspective for engineering true randomness in post-quantum cryptographic systems.
Related papers
- Complexity in multiqubit and many-body systems [0.0]
In case of an $n$-qubit system the disturbance due to depolarization and dephasing is identified.<n>Many body systems modelled using deformed random matrix ensembles and deformed two-body random interaction ensembles.<n>States with maximal complexity mark the cross-over or the transition point between integrability and full quantum chaos.
arXiv Detail & Related papers (2025-07-29T21:46:43Z) - 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) - Observable-manifested correlations in many-body quantum chaotic systems [5.009081786741903]
We find that for realistic systems, the envelope function of off-diagonal elements of observables exhibits an exponential decay at large $Delta E$, while for randomized models, it tends to be flat.<n>We demonstrate that the correlations of chaotic eigenstates, originating from the delicate structures of Hamiltonians, play a crucial role in the non-trivial structure of the envelope function.
arXiv Detail & Related papers (2025-02-24T06:33:22Z) - Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML)
At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
arXiv Detail & Related papers (2024-11-13T23:56:20Z) - Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem.<n>We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions.<n>We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
arXiv Detail & Related papers (2024-10-10T16:10:10Z) - Optimal Conversion from Classical to Quantum Randomness via Quantum Chaos [0.0]
In a recently proposed paradigm known as deep thermalization, random quantum states of system A are generated by performing projective measurements on system B.<n>In this scheme, the randomness of the projected state ensemble arises from the intrinsic randomness of the outcomes when B is measured.<n>We show that for generic chaotic systems this conversion is optimal in that each bit of injected classical entropy generates as much additional quantum randomness as adding an extra qubit to B.
arXiv Detail & Related papers (2024-10-07T16:41:23Z) - Halving the Cost of Quantum Algorithms with Randomization [0.138120109831448]
Quantum signal processing (QSP) provides a systematic framework for implementing a transformation of a linear operator.<n>Recent works have developed randomized compiling, a technique that promotes a unitary gate to a quantum channel.<n>Our algorithm implements a probabilistic mixture of randomizeds, strategically chosen so that the average evolution converges to that of a target function, with an error quadratically smaller than that of an equivalent individual.
arXiv Detail & Related papers (2024-09-05T17:56:51Z) - Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
arXiv Detail & Related papers (2024-05-03T17:32:55Z) - Quantum Conformal Prediction for Reliable Uncertainty Quantification in
Quantum Machine Learning [47.991114317813555]
Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots.
This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
arXiv Detail & Related papers (2023-04-06T22:05:21Z) - 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) - Testing randomness of series generated in Bell's experiment [62.997667081978825]
We use a toy fiber optic based setup to generate binary series, and evaluate their level of randomness according to Ville principle.
Series are tested with a battery of standard statistical indicators, Hurst, Kolmogorov complexity, minimum entropy, Takensarity dimension of embedding, and Augmented Dickey Fuller and Kwiatkowski Phillips Schmidt Shin to check station exponent.
The level of randomness of series obtained by applying Toeplitz extractor to rejected series is found to be indistinguishable from the level of non-rejected raw ones.
arXiv Detail & Related papers (2022-08-31T17:39:29Z) - Optimality and Complexity in Measured Quantum-State Stochastic Processes [0.0]
We show that optimal prediction requires using an infinite number of temporal features.
We identify the mechanism underlying this complicatedness as generator nonunifilarity.
This makes it possible to quantitatively explore the influence that measurement choice has on a quantum process' degrees of randomness.
arXiv Detail & Related papers (2022-05-08T21:43:06Z) - Unification of Random Dynamical Decoupling and the Quantum Zeno Effect [68.8204255655161]
We show that the system dynamics under random dynamical decoupling converges to a unitary with a decoupling error that characteristically depends on the convergence speed of the Zeno limit.
This reveals a unification of the random dynamical decoupling and the quantum Zeno effect.
arXiv Detail & Related papers (2021-12-08T11:41:38Z) - The Model of Quantum Thermodynamics From the First Principles: Quantum
Halo or Small Environment [0.0]
The evolution of the joint system (JS) - quantum system (QS)+thermal bath (TB)" is considered.
The transition between $(in)$ and $(out$) states of the QS are studied in detail taking into account the influence of TB.
arXiv Detail & Related papers (2020-07-31T19:07:29Z)
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.