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

International Conference on Intelligent Communication Technologies and Virtual Mobile Networks (ICICV)

Random Sequence Generation using Superconducting Qubits

Mayank Gupta, Manisha J. Nene

Published Feb 4, 2021• 11 citations
Publisher

Abstract

Randomness property is an essential component in fields of cryptography, scientific simulations, secure communications and randomized algorithms. In this study, the reason for pseudo random generators were analyzed and illustrated for which are being slowly replaced by quantum random number generators. Quantum mechanics has emerged as a domain with extreme potential, however, the biggest challenge being faced towards practical utilization is that of scalability. This study proposes a method for Truly Random Bit Sequence (TRBS) generation also determining the most suitable physical implementation of qubits in the process for application in domains of data security, integrity and authentication as a precursor to secure communications. Illustration of the proposed method reaffirms that the probabilistic nature of quantum measurement and inherent randomness being used for the sequence generation lead to a truly random sequence which is also validated through NIST testing suite results.

DOI
10.1109/icicv50876.2021.9388495

Related papers

Quantum Random Number Generation

Jincheng Zhang

Quantum random number generation (QRNG) offers a fundamentally different approach to randomness compared to classical methods. This paper explores the design and principles of a QRNG based on harnessing the inherent uncertainty in quantum measurements. The core claim is the development of a system capable of generating truly random quantum bit sequences. This is achieved by exploiting the probabilistic nature of quantum measurement, specifically the collapse of the wave function upon observation, which yields unpredictable outcomes. The generated sequences are expected to exhibit statistical independence, a crucial property for various quantum computing applications. This work lays the groundwork for a detailed exploration of QRNG techniques, highlighting their potential impact on secure quantum communication and simulation. We will detail the theoretical underpinnings, focusing on the mathematical formulation of the process and the statistical properties of the generated random numbers.

•Aug 31, 2026•0 citations

Quantum Random Number Generator Based on Quantum Mechanical Principles

Jincheng Zhang

This paper presents the design and theoretical framework for a quantum random number generator (QRNG) rooted in the principles of quantum mechanics. The core innovation lies in leveraging the inherent randomness associated with quantum measurement, specifically the uncertainty principle, to generate truly random numbers, a significant departure from the limitations of classical random number generators. The proposed system utilizes a measurement process involving a quantum system, such as a photon polarization or a quantum bit, to produce a sequence of random bits. The generated bits are then processed to eliminate bias and ensure high uniformity. The theoretical analysis focuses on quantifying the randomness inherent in the measurement process and demonstrating the potential for generating high-quality random numbers. This work addresses the growing demand for secure communication, cryptography, and simulation applications that require truly random numbers, offering a fundamentally different approach compared to traditional methods.

•Sep 3, 2026•0 citations

Quantum generators of random numbers

Marcin M. Jacak, Piotr Paweł Jóźwiak, Jakub Niemczuk +1 more

Generation of random numbers is a central problem for many applications in the field of information processing, including, e.g., cryptography, in classical and quantum regime, but also mathematical modeling, Monte Carlo methods, gambling and many others. Both, the quality of the randomness and efficiency of the random numbers generation process are crucial for the most of these applications. Software produced pseudorandom bit sequences, though sufficiently quick, do not fulfill required randomness quality demands. Hence, the physical hardware methods are intensively developed to generate truly random number sequences for information processing and electronic security application. In the present paper we discuss the idea of the quantum random number generators. We also present a variety of tests utilized to assess the quality of randomness of generated bit sequences. In the experimental part we apply such tests to assess and compare two quantum random number generators, PQ4000KSI (of company ComScire US) and JUR01 (constructed in Wroclaw University of Science and Technology upon the project of The National Center for Research and Development) as well as a pseudorandom generator from the Mathematica Wolfram package. Finally, we present our new prototype of fully operative miniaturized quantum random generator JUR02 producing a random bit sequence with velocity of 1 Mb/s, which successfully passed standard tests of randomness quality (like NIST and Dieharder tests). We also shortly discuss our former concept of an entanglement-based quantum random number generator protocol with unconditionally secure public randomness verification.

Scientific Reports•Aug 9, 2021•85 citations

A New Trend of Pseudo Random Number Generation using QKD

Omer K. Jasim Mohammad, Safia Abbas, El-Sayed M. El-Horbaty +1 more

Random Numbers determine the security level of cryptographic applications as they are used to generate padding schemes in the encryption/decryption process as well as used to generate cryptographic keys. This paper utilizes the QKD to generate a random quantum bit rely on BB84 protocol, using the NIST and DIEHARD randomness test algorithms to test and evaluate the randomness rates for key generation. The results show that the bits generated using QKD are truly random, which in turn, overcomes the distance limitation (associated with QKD) issue, its well-known challenges with the sending/ receiving data process between different communication parties

arXiv:1411.2469•Oct 2, 2014•4 citations

Design of a quantum true random number generator using quantum gates and benchmarking its performance on an IBM quantum-computer

Vaishnavi Kumar, Padmapriya Praveenkumar

Random numbers are used in various domains, including quantum communication and cryptography applications such as key generation and authentication. Quantum mechanics has the intrinsic ability to generate truly random numbers, making it an ideal alternative for scientific applications that require randomness. Quantum wireless communication is proposed as a new means of communication that is safe, secure, and efficient. The simplicity of our source rotation gate, combined with its independently verifiable solitary unpredictability, is essential to obtain quantum random number generators without spending any money. In this chapter, we explore and study the 24-qubit random number. The worst-case entropy value for such randomly produced integers is 0.999445, with the min-entropy of such numbers being 0.0008. Additionally, steering restart tests were used to validate later verification of true randomness, and the statistical characteristics of the True Random Number Generation (TRNG) were assessed using an autocorrelation study and the statistical test suites.

•Jul 20, 2023•1 citation

A New Trend of Pseudo Random Number Generation using QKD

Omer K. Jasim Mohammad, Safia Abbas, El-Sayed M. El-Horbaty +1 more

Random Numbers determine the security level of cryptographic applications as they are used to generate padding schemes in the encryption/decryption process as well as used to generate cryptographic keys.This paper utilizes the QKD to generate a random quantum bit rely on BB84 protocol, using the NIST and DIEHARD randomness test algorithms to test and evaluate the randomness rates for key generation.The results show that the bits generated using QKD are truly random, which in turn, overcomes the distance limitation (associated with QKD) issue, its well-known challenges with the sending/ receiving data process between different communication parties.

International Journal of Computer Applications•Jun 18, 2014•4 citations
Randomness property is an essential component in fields of cryptography, scientific simulations, secure communications and randomized algorithms. In this study, the reason for pseudo random generators were analyzed and illustrated for which are being slowly replaced by quantum random number generators. Quantum mechanics has emerged as a domain with extreme potential, however, the biggest challenge being faced towards practical utilization is that of scalability. This study proposes a method for Truly Random Bit Sequence (TRBS) generation also determining the most suitable physical implementation of qubits in the process for application in domains of data security, integrity and authentication as a precursor to secure communications. Illustration of the proposed method reaffirms that the probabilistic nature of quantum measurement and inherent randomness being used for the sequence generation lead to a truly random sequence which is also validated through NIST testing suite results.
Quantum random number generation (QRNG) offers a fundamentally different approach to randomness compared to classical methods. This paper explores the design and principles of a QRNG based on harnessing the inherent uncertainty in quantum measurements. The core claim is the development of a system capable of generating truly random quantum bit sequences. This is achieved by exploiting the probabilistic nature of quantum measurement, specifically the collapse of the wave function upon observation, which yields unpredictable outcomes. The generated sequences are expected to exhibit statistical independence, a crucial property for various quantum computing applications. This work lays the groundwork for a detailed exploration of QRNG techniques, highlighting their potential impact on secure quantum communication and simulation. We will detail the theoretical underpinnings, focusing on the mathematical formulation of the process and the statistical properties of the generated random numbers.
This paper presents the design and theoretical framework for a quantum random number generator (QRNG) rooted in the principles of quantum mechanics. The core innovation lies in leveraging the inherent randomness associated with quantum measurement, specifically the uncertainty principle, to generate truly random numbers, a significant departure from the limitations of classical random number generators. The proposed system utilizes a measurement process involving a quantum system, such as a photon polarization or a quantum bit, to produce a sequence of random bits. The generated bits are then processed to eliminate bias and ensure high uniformity. The theoretical analysis focuses on quantifying the randomness inherent in the measurement process and demonstrating the potential for generating high-quality random numbers. This work addresses the growing demand for secure communication, cryptography, and simulation applications that require truly random numbers, offering a fundamentally different approach compared to traditional methods.
Generation of random numbers is a central problem for many applications in the field of information processing, including, e.g., cryptography, in classical and quantum regime, but also mathematical modeling, Monte Carlo methods, gambling and many others. Both, the quality of the randomness and efficiency of the random numbers generation process are crucial for the most of these applications. Software produced pseudorandom bit sequences, though sufficiently quick, do not fulfill required randomness quality demands. Hence, the physical hardware methods are intensively developed to generate truly random number sequences for information processing and electronic security application. In the present paper we discuss the idea of the quantum random number generators. We also present a variety of tests utilized to assess the quality of randomness of generated bit sequences. In the experimental part we apply such tests to assess and compare two quantum random number generators, PQ4000KSI (of company ComScire US) and JUR01 (constructed in Wroclaw University of Science and Technology upon the project of The National Center for Research and Development) as well as a pseudorandom generator from the Mathematica Wolfram package. Finally, we present our new prototype of fully operative miniaturized quantum random generator JUR02 producing a random bit sequence with velocity of 1 Mb/s, which successfully passed standard tests of randomness quality (like NIST and Dieharder tests). We also shortly discuss our former concept of an entanglement-based quantum random number generator protocol with unconditionally secure public randomness verification.
Random Numbers determine the security level of cryptographic applications as they are used to generate padding schemes in the encryption/decryption process as well as used to generate cryptographic keys. This paper utilizes the QKD to generate a random quantum bit rely on BB84 protocol, using the NIST and DIEHARD randomness test algorithms to test and evaluate the randomness rates for key generation. The results show that the bits generated using QKD are truly random, which in turn, overcomes the distance limitation (associated with QKD) issue, its well-known challenges with the sending/ receiving data process between different communication parties
Random numbers are used in various domains, including quantum communication and cryptography applications such as key generation and authentication. Quantum mechanics has the intrinsic ability to generate truly random numbers, making it an ideal alternative for scientific applications that require randomness. Quantum wireless communication is proposed as a new means of communication that is safe, secure, and efficient. The simplicity of our source rotation gate, combined with its independently verifiable solitary unpredictability, is essential to obtain quantum random number generators without spending any money. In this chapter, we explore and study the 24-qubit random number. The worst-case entropy value for such randomly produced integers is 0.999445, with the min-entropy of such numbers being 0.0008. Additionally, steering restart tests were used to validate later verification of true randomness, and the statistical characteristics of the True Random Number Generation (TRNG) were assessed using an autocorrelation study and the statistical test suites.
Random Numbers determine the security level of cryptographic applications as they are used to generate padding schemes in the encryption/decryption process as well as used to generate cryptographic keys.This paper utilizes the QKD to generate a random quantum bit rely on BB84 protocol, using the NIST and DIEHARD randomness test algorithms to test and evaluate the randomness rates for key generation.The results show that the bits generated using QKD are truly random, which in turn, overcomes the distance limitation (associated with QKD) issue, its well-known challenges with the sending/ receiving data process between different communication parties.