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

arXiv:2512.09862

True Random Number Generators on IQM Spark

Andrzej Gnatowski, Jarosław Rudy, Teodor Niżyński, Krzysztof Święcicki

quant-phcs.CRSubmitted Dec 10, 2025• Announced Dec 11, 2025• 0 citations
arXivHTMLPDF

Abstract

Random number generation is fundamental for many modern applications including cryptography, simulations and machine learning. Traditional pseudo-random numbers may offer statistical unpredictability, but are ultimately deterministic. On the other hand, True Random Number Generation (TRNG) offers true randomness. One way of obtaining such randomness are quantum systems, including quantum computers. As such the use of quantum computers for TRNG has received considerable attention in recent years. However, existing studies almost exclusively consider IBM quantum computers, often stop at using simulations and usually test only a handful of different TRNG quantum circuits. In this paper, we address those issues by presenting a study of TRNG circuits on Odra 5 a real-life quantum computer installed at Wrocław University of Science and Technology. It is also the first study to utilize the IQM superconducting architecture. Since Odra 5 is available on-premises it allows for much more comprehensive study of various TRNG circuits. In particular, we consider 5 types of TRNG circuits with 105 circuit subvariants in total. Each circuit is used to generate 1 million bits. We then perform an analysis of the quality of the obtained random sequences using the NIST SP 800-22 and NIST SP 800-90B test suites. We also provide a comprehensive review of existing literature on quantum computer-based TRNGs.

Related papers

Quantum true random number generation on IBM’s cloud platform

Vaishnavi Kumar, John Bosco Balaguru Rayappan, Rengarajan Amirtharajan +1 more

Random numbers are the lifeline of any cryptographic operation in modern computing. Quantum True Random Number Generator (QTRNG) can yield real random data to replace random-looking periodic sequences. Here, we present the fastest QTRNG on factual Quantum Computational Devices (QCD) locally on our device to save time. To construct a random number generator, the IBM Q Experience called Qiskit is used. The ease of our source Hadamard gate pooled with its verifiably sole randomness is imperative for attaining quantum random number generators at no cost. The inner matrix product of the square of the Hadamard gate is proved to be identified in the quantum lab. Applying the H gate twice on the quantum register cancelled out the H gate pair. It acted as a single Hadamard gate that was practically visualised using the IMB Q experience. The 24-qubit random number is experimented with and investigated in this work. The min-entropy of such generated random numbers is 0.0007244 with the worst-case entropy value of 0.999507. Besides, subsequent verification of genuine randomness was confirmed by steering restart experimentation, & the statistical properties of TRNG were evaluated over autocorrelation study, National Institute of Standards and Technology (NIST) SP 800-90B & 800-22 tests.

Journal of King Saud University - Computer and Information Sciences•Jan 31, 2022•39 citations

True Random Number Generator using Superconducting Qubits

Abdullah Ash Saki, Mahabubul Alam, Swaroop Ghosh

We evaluated the quality of conventional quantum True Random Number Generator (TRNG) using superconducting qubits from IBM. Our analysis indicated that the 1/0 ratio is severely affected by the noise. We proposed swapping of readout qubit and parameter optimization to fix readout and gate errors. We validate our proposals by running experiments of IBM's su-perconducitng qubit based quantum computer. Experiments show deviation of ≈ 35% from ideal 1/0 ratio for baseline implementation. After the application of our proposed techniques the ratio improves and reaches close to ideal value of 1. The random bits generated through our techniques passes NIST statistical tests as well.

Conference digest•Jun 1, 2019•5 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

Implementation of RQFT-QTRNG Using Quantum Gates in the IBM Quantum Lab

T. S. Gururaja, Padmapriya Praveenkumar, Neha Chaubey

We propose to develop quantum true random number generation (QTRNG) in IBM's quantum laboratory by implementing the Random Quantum Fourier Transform (RQFT) technique utilizing quantum gates. This approach overcomes the imperfections caused by noise and decoherence in quantum circuits by utilizing the quantum Fourier transform (QFT) to replace the computational basis with a Fourier basis comprising a complex superposition of qubit states. For usage in symmetric and asymmetric cryptographic applications, the RQFT-based QTRNG produces unpredictable high quality random numbers. It satisfies all the preliminary tests, Autocorrelation test, and extensive National Institute of Standards and Technology (NIST) test suites, such as SP 800-90 and SP 800-22 are used to assess the generated sequences randomness in order to guarantee their robustness and reliability.

Advances in information security, privacy, and ethics book series•Nov 27, 2024•2 citations

Improving Reliability of Quantum True Random Number Generator using Machine Learning

Abdullah Ash Saki, Mahabubul Alam, Swaroop Ghosh

Quantum computer (QC) can be used as a true random number generator (TRNG). However, various noise sources introduce a bias in the generated number which affects the randomness. In this work, we analyze the impact of noise sources e.g., gate error, decoherence, and readout error in QC-based TRNG by running a set of error calibration and quantum tomography experiments. We employ a hybrid quantum-classical gate parameter optimization routine to find an optimal gate parameter. The optimal parameter compensates for error-induced bias and improves the quality of the random number by exploiting even the worst quality qubits. However, searching the optimal parameter in a hybrid setup requires time-consuming iterations between classical and quantum machines. We propose a machine learning model to predict optimal quantum gate parameters based on the qubit error specifications. We validate our approach using experimental results from IBM's publicly accessible quantum computers and the NIST statistical test suite. The proposed method can correct bias in any worst-case qubit by up to 88.57% in real quantum hardware.

International Symposium on Quality Electronic Design (ISQED)•Mar 1, 2020•16 citations

A Comparative Study and Analysis of Quantum Random Number Generator with True Random Number Generator

Shashi Kant Pandey, R. Jenef

Random numbers play a central role in cryptography, cyber security, and gaming applications. Extracting bits from some random natural activity is one of the primitive ways to generate random numbers. True random number generator(TRNG) and quantum random number generator(QRNG) are examples of this random number sequence. The development of quantum technology made it possible to extract random sequences from quantum entropy sources. This sequence is called quantum random numbers and the whole setup is named a quantum random number generator. A suitable sampling and a physical device for the entropy source are the building blocks for a TRNG. Here we present a comparative analysis of two random number generators. Apart from the conventional statistical test for randomness, here we introduce a straightforward coefficient based on the concept of non-linearity of the Boolean function to determine the availability of any linearity in a chosen random binary sequence. It reveals the cryptographic suitability of the generated sequence w.r.t any correlation attack. A comparison of the nonlinearity of two Boolean sequences generated from two different random sources is presented.

International Conference on Communication Systems & Networks (COMSNETS)•Jan 3, 2024•12 citations
Random number generation is fundamental for many modern applications including cryptography, simulations and machine learning. Traditional pseudo-random numbers may offer statistical unpredictability, but are ultimately deterministic. On the other hand, True Random Number Generation (TRNG) offers true randomness. One way of obtaining such randomness are quantum systems, including quantum computers. As such the use of quantum computers for TRNG has received considerable attention in recent years. However, existing studies almost exclusively consider IBM quantum computers, often stop at using simulations and usually test only a handful of different TRNG quantum circuits. In this paper, we address those issues by presenting a study of TRNG circuits on Odra 5 a real-life quantum computer installed at Wrocław University of Science and Technology. It is also the first study to utilize the IQM superconducting architecture. Since Odra 5 is available on-premises it allows for much more comprehensive study of various TRNG circuits. In particular, we consider 5 types of TRNG circuits with 105 circuit subvariants in total. Each circuit is used to generate 1 million bits. We then perform an analysis of the quality of the obtained random sequences using the NIST SP 800-22 and NIST SP 800-90B test suites. We also provide a comprehensive review of existing literature on quantum computer-based TRNGs.
Random numbers are the lifeline of any cryptographic operation in modern computing. Quantum True Random Number Generator (QTRNG) can yield real random data to replace random-looking periodic sequences. Here, we present the fastest QTRNG on factual Quantum Computational Devices (QCD) locally on our device to save time. To construct a random number generator, the IBM Q Experience called Qiskit is used. The ease of our source Hadamard gate pooled with its verifiably sole randomness is imperative for attaining quantum random number generators at no cost. The inner matrix product of the square of the Hadamard gate is proved to be identified in the quantum lab. Applying the H gate twice on the quantum register cancelled out the H gate pair. It acted as a single Hadamard gate that was practically visualised using the IMB Q experience. The 24-qubit random number is experimented with and investigated in this work. The min-entropy of such generated random numbers is 0.0007244 with the worst-case entropy value of 0.999507. Besides, subsequent verification of genuine randomness was confirmed by steering restart experimentation, & the statistical properties of TRNG were evaluated over autocorrelation study, National Institute of Standards and Technology (NIST) SP 800-90B & 800-22 tests.
We evaluated the quality of conventional quantum True Random Number Generator (TRNG) using superconducting qubits from IBM. Our analysis indicated that the 1/0 ratio is severely affected by the noise. We proposed swapping of readout qubit and parameter optimization to fix readout and gate errors. We validate our proposals by running experiments of IBM's su-perconducitng qubit based quantum computer. Experiments show deviation of ≈ 35% from ideal 1/0 ratio for baseline implementation. After the application of our proposed techniques the ratio improves and reaches close to ideal value of 1. The random bits generated through our techniques passes NIST statistical tests as well.
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.
We propose to develop quantum true random number generation (QTRNG) in IBM's quantum laboratory by implementing the Random Quantum Fourier Transform (RQFT) technique utilizing quantum gates. This approach overcomes the imperfections caused by noise and decoherence in quantum circuits by utilizing the quantum Fourier transform (QFT) to replace the computational basis with a Fourier basis comprising a complex superposition of qubit states. For usage in symmetric and asymmetric cryptographic applications, the RQFT-based QTRNG produces unpredictable high quality random numbers. It satisfies all the preliminary tests, Autocorrelation test, and extensive National Institute of Standards and Technology (NIST) test suites, such as SP 800-90 and SP 800-22 are used to assess the generated sequences randomness in order to guarantee their robustness and reliability.
Quantum computer (QC) can be used as a true random number generator (TRNG). However, various noise sources introduce a bias in the generated number which affects the randomness. In this work, we analyze the impact of noise sources e.g., gate error, decoherence, and readout error in QC-based TRNG by running a set of error calibration and quantum tomography experiments. We employ a hybrid quantum-classical gate parameter optimization routine to find an optimal gate parameter. The optimal parameter compensates for error-induced bias and improves the quality of the random number by exploiting even the worst quality qubits. However, searching the optimal parameter in a hybrid setup requires time-consuming iterations between classical and quantum machines. We propose a machine learning model to predict optimal quantum gate parameters based on the qubit error specifications. We validate our approach using experimental results from IBM's publicly accessible quantum computers and the NIST statistical test suite. The proposed method can correct bias in any worst-case qubit by up to 88.57% in real quantum hardware.
Random numbers play a central role in cryptography, cyber security, and gaming applications. Extracting bits from some random natural activity is one of the primitive ways to generate random numbers. True random number generator(TRNG) and quantum random number generator(QRNG) are examples of this random number sequence. The development of quantum technology made it possible to extract random sequences from quantum entropy sources. This sequence is called quantum random numbers and the whole setup is named a quantum random number generator. A suitable sampling and a physical device for the entropy source are the building blocks for a TRNG. Here we present a comparative analysis of two random number generators. Apart from the conventional statistical test for randomness, here we introduce a straightforward coefficient based on the concept of non-linearity of the Boolean function to determine the availability of any linearity in a chosen random binary sequence. It reveals the cryptographic suitability of the generated sequence w.r.t any correlation attack. A comparison of the nonlinearity of two Boolean sequences generated from two different random sources is presented.