Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Pure Information from Quantum Randomness: QRNGs as Interfaces Between Substrate, Qubits, and the It-From-Bit Cosmos

Douglas C. Youvan

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.13140/rg.2.2.22506.17607

Related papers

Quantum Random Number Generator (QRNG): theoretical and experimental investigations

Z Haider, Muhammad Haroon Saeed, Muhammad Zaheer +6 more

arXiv:2506.02441•The European Physical Journal Plus•Sep 11, 2023•15 citations

Pseudo Quantum Random Number Generator with Quantum Permutation Pad

Randy Kuang, Dafu Lou, Alex He +2 more

Cryptographic random number generation is critical for any quantum-safe encryption. Based on the natural uncertainty of some quantum processes, a variety of quantum random number generators, or QRNGs, have been created with physical quantum processes. These typically generate random numbers with good unpredictable randomness. Of course, physical QRNGs are costic and require physical integrations with computing systems. This paper proposes a pseudo quantum random number generator with a quantum algorithm called a quantum permutation pad, or QPP, leveraging the high entropy of quantum permutation space for its bijective transformation. Unlike Boolean algebra, where the size of information space is 2nfor an n-bit system, an n-bit quantum permutation space consists of 2n! quantum permutation matrices, representing all quantum permutation gates over an n-bit computational basis. This permutation space holds an equivalent Shannon information entropy of log2(2n!). A QPP can be used to create a pseudo-QRNG or pQRNG capable of integration with any classical computing system, or directly with any application, for good-quality deterministic random number generation. Using a QPP pad with 64 8-bit permuation matrices, a pQRNG holds 107,776 bits of entropy for pseudo-random number generation, compared with 4,096 bits of entropy in Linux /dev/random. It can be used as a deterministic PRNG or as an entropy booster for other PRNGs. It can also be used as a whitening algorithm for any hardware random number generator, including QRNGs, without discarding physical bias bits.

arXiv:2303.01315•IEEE International Conference on Quantum Computing and Engineering (QCE)•Oct 1, 2021•28 citations

Implement quantum random number generation on the IBM quantum computer platform

Nhu-Quynh Luc, Le Van Anh

Random numbers are a crucial component of any encryption activity in modern cryptography. Quantum Random Number Generators (QRNGs) produce truly random output strings to replace pseudo-random ones. The principle of QRNG relies on measuring qubit states, which excel in quantum computing applications, particularly on IBM's quantum computing platform. To construct a random number generator, the authors utilized IBM Q Experience's Qiskit quantum development toolkit. We developed QRNG applications on IBM quantum computers (7-qubit, 16-qubit, and 127-qubit) and tested the program's functionality on these quantum computing platforms. The quality assessment of the random strings was conducted according to NIST and AIS-31 standards. For NIST standards, to achieve good quality, the output string must reach a minimum of 1,593,088 bits to pass 16 tests per SP800-22 standard. According to AIS-31 standards, to achieve good quality, the output string must reach a minimum of 8,000,000 bits to pass 8 tests of the standard

The Transport and Communications Science Journal•May 15, 2024•3 citations

Introduction to Quantum Randomness

WORLD SCIENTIFIC eBooks•May 1, 2003•0 citations

Construction of a Quantum Random Number Generator

Kashish Karera, Ayan Khan, Humanyou Tariq +4 more

Quantum random number generators (QRNG) are the prime source of randomness, by exploiting the unpredictable nature of Quantum mechanics QRNG aims to provide a string of completely random utterly unpredictable numbers. QRNGs are crucial for cryptography, scientific calculation, simulation, and many more real-world applications. Our Optical Quantum Random Number Generator (OQRNG) utilizes a high-speed pulsating laser, a Polarizing beam splitter (PBS), photodetectors, and advanced signal processing units that capture and digitize random photon intensity forming the raw random bit stream. This technique is famously known as Branching Path Technique. After that, we implement rigorous testing that encompasses the statistical randomness tests developed by National Institute of Standards and Technology (NIST) to ensure the guaranteed ran-domness meets security standards. A user-friendly Graphic user interface (GUI) simplifies interaction with the QRNG allowing the user to configure device settings, monitor system performance, and securely extract random numbers. Our findings help us demonstrate the superiority of QRNGs over classical random number generators, and highlight the potential of photon-based QRNGs and their environmentally friendly and efficient random number generation.

International Conference on Innovations in Computer Science & Software Engineering (ICONICS)•Nov 13, 2024•0 citations

Exploiting randomness in quantum information processing

Chiu Fan Lee, Neil F. Johnson

arXiv:quant-ph/0207080•Physics Letters A•Sep 1, 2002•38 citations
Cryptographic random number generation is critical for any quantum-safe encryption. Based on the natural uncertainty of some quantum processes, a variety of quantum random number generators, or QRNGs, have been created with physical quantum processes. These typically generate random numbers with good unpredictable randomness. Of course, physical QRNGs are costic and require physical integrations with computing systems. This paper proposes a pseudo quantum random number generator with a quantum algorithm called a quantum permutation pad, or QPP, leveraging the high entropy of quantum permutation space for its bijective transformation. Unlike Boolean algebra, where the size of information space is 2nfor an n-bit system, an n-bit quantum permutation space consists of 2n! quantum permutation matrices, representing all quantum permutation gates over an n-bit computational basis. This permutation space holds an equivalent Shannon information entropy of log2(2n!). A QPP can be used to create a pseudo-QRNG or pQRNG capable of integration with any classical computing system, or directly with any application, for good-quality deterministic random number generation. Using a QPP pad with 64 8-bit permuation matrices, a pQRNG holds 107,776 bits of entropy for pseudo-random number generation, compared with 4,096 bits of entropy in Linux /dev/random. It can be used as a deterministic PRNG or as an entropy booster for other PRNGs. It can also be used as a whitening algorithm for any hardware random number generator, including QRNGs, without discarding physical bias bits.
Random numbers are a crucial component of any encryption activity in modern cryptography. Quantum Random Number Generators (QRNGs) produce truly random output strings to replace pseudo-random ones. The principle of QRNG relies on measuring qubit states, which excel in quantum computing applications, particularly on IBM's quantum computing platform. To construct a random number generator, the authors utilized IBM Q Experience's Qiskit quantum development toolkit. We developed QRNG applications on IBM quantum computers (7-qubit, 16-qubit, and 127-qubit) and tested the program's functionality on these quantum computing platforms. The quality assessment of the random strings was conducted according to NIST and AIS-31 standards. For NIST standards, to achieve good quality, the output string must reach a minimum of 1,593,088 bits to pass 16 tests per SP800-22 standard. According to AIS-31 standards, to achieve good quality, the output string must reach a minimum of 8,000,000 bits to pass 8 tests of the standard
Quantum random number generators (QRNG) are the prime source of randomness, by exploiting the unpredictable nature of Quantum mechanics QRNG aims to provide a string of completely random utterly unpredictable numbers. QRNGs are crucial for cryptography, scientific calculation, simulation, and many more real-world applications. Our Optical Quantum Random Number Generator (OQRNG) utilizes a high-speed pulsating laser, a Polarizing beam splitter (PBS), photodetectors, and advanced signal processing units that capture and digitize random photon intensity forming the raw random bit stream. This technique is famously known as Branching Path Technique. After that, we implement rigorous testing that encompasses the statistical randomness tests developed by National Institute of Standards and Technology (NIST) to ensure the guaranteed ran-domness meets security standards. A user-friendly Graphic user interface (GUI) simplifies interaction with the QRNG allowing the user to configure device settings, monitor system performance, and securely extract random numbers. Our findings help us demonstrate the superiority of QRNGs over classical random number generators, and highlight the potential of photon-based QRNGs and their environmentally friendly and efficient random number generation.