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

Physics World

Quantum computer makes random numbers

Tim Wogan

Published Jun 1, 2025• 0 citations
Publisher

Abstract

Quantinuum’s trapped-ion quantum computer has generated strings of certifiably random numbers that could have applications in quantum cryptography, as Tim Wogan reports.
DOI
10.1088/2058-7058/38/06/09

Related papers

Atomic quantum processors make their debut

Tim Wogan

Two research groups demonstrate quantum algorithms using neutral atoms as qubits. Tim Wogan reports.

Physics World•Aug 1, 2022•0 citations

Quantum random number generators

Miguel Herrero-Collantes, Juan Carlos García-Escartín

In mathematics and computer science, random numbers have the role of a resource for assisting proofs, making cryptography secure, and enabling computational protocols. This role motivates efforts to produce random numbers as a physical process. Potential physical sources abound, but arguably the most fundamental are those based on elementary quantum mechanical processes. This review discusses the current status of devices that generate quantum random numbers.

arXiv:1604.03304•Reviews of Modern Physics•Feb 22, 2017•851 citations

Certified Quantum Randomness

Serge Massar

Randomness is a phenomena which we are confronted with all the time. Will it rain today? Will the train be on time? What present(s) will I receive at Christmas? But are such phenomena truly random?Good randomness is essential for many applications. For instance, cryptography, the art of hiding information from malicious parties, is only as good as the sources of randomness that underlie it. Quantum mechanics, the theory of microscopic phenomena, can only predict the probability of events. For instance quantum theory can only predict the probability that a radioactive nucleus will decay, not when the nucleus will decay. Does this mean that microscopic phenomena are truly random?By studying systems of two entangled particles, it can be shown both theoretically and experimentally that events at the microscopic scale are truly random, truly unpredictable. Beyond its philosophical implications, this result also has important potential applications. Indeed it implies that one can build random number generators whose output is random and certifies that the device works correctly. That is, if the random number generator malfunctions in some way, if the numbers it produces cease to be random, this will automatically be detected. By extending this idea, one could also build quantum cryptographic systems and quantum computers that certify that they work correctly. We discuss the perspectives for practical implementations.

•Jan 1, 2017•0 citations

Certified randomness using a trapped-ion quantum processor

Minzhao Liu, Ruslan Shaydulin, Pradeep Niroula +29 more

Abstract Although quantum computers can perform a wide range of practically important tasks beyond the abilities of classical computers 1,2 , realizing this potential remains a challenge. An example is to use an untrusted remote device to generate random bits that can be certified to contain a certain amount of entropy 3 . Certified randomness has many applications but is impossible to achieve solely by classical computation. Here we demonstrate the generation of certifiably random bits using the 56-qubit Quantinuum H2-1 trapped-ion quantum computer accessed over the Internet. Our protocol leverages the classical hardness of recent random circuit sampling demonstrations 4,5 : a client generates quantum ‘challenge’ circuits using a small randomness seed, sends them to an untrusted quantum server to execute and verifies the results of the server. We analyse the security of our protocol against a restricted class of realistic near-term adversaries. Using classical verification with measured combined sustained performance of 1.1 × 10 18 floating-point operations per second across multiple supercomputers, we certify 71,313 bits of entropy under this restricted adversary and additional assumptions. Our results demonstrate a step towards the practical applicability of present-day quantum computers.

arXiv:2503.20498•Nature•Mar 26, 2025•56 citations

Random Number Generation with Quantum Computers

Hannah Cho, Daniel Quinter, Mohammad Sheikhattari +2 more

Random numbers feature in most cryptographic protocols, including those securing internet traffic. Most random number generators deployed on internet appliances are subject to cryptanalytic attack. We explore generating random numbers on compact quantum computers.

Frontiers in Optics•Jan 1, 2022•1 citation

Towards a high-speed quantum random number generator

Damien Stucki, Samuel Burri, Edoardo Charbon A +3 more

Randomness is of fundamental importance in various fields, such as cryptography, numerical simulations, or the gaming industry. Quantum physics, which is fundamentally probabilistic, is the best option for a physical random number generator. In this article, we will present the work carried out in various projects in the context of the development of a commercial and certified high speed random number generator.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Oct 29, 2013•23 citations
Randomness is a phenomena which we are confronted with all the time. Will it rain today? Will the train be on time? What present(s) will I receive at Christmas? But are such phenomena truly random?Good randomness is essential for many applications. For instance, cryptography, the art of hiding information from malicious parties, is only as good as the sources of randomness that underlie it. Quantum mechanics, the theory of microscopic phenomena, can only predict the probability of events. For instance quantum theory can only predict the probability that a radioactive nucleus will decay, not when the nucleus will decay. Does this mean that microscopic phenomena are truly random?By studying systems of two entangled particles, it can be shown both theoretically and experimentally that events at the microscopic scale are truly random, truly unpredictable. Beyond its philosophical implications, this result also has important potential applications. Indeed it implies that one can build random number generators whose output is random and certifies that the device works correctly. That is, if the random number generator malfunctions in some way, if the numbers it produces cease to be random, this will automatically be detected. By extending this idea, one could also build quantum cryptographic systems and quantum computers that certify that they work correctly. We discuss the perspectives for practical implementations.
Abstract Although quantum computers can perform a wide range of practically important tasks beyond the abilities of classical computers 1,2 , realizing this potential remains a challenge. An example is to use an untrusted remote device to generate random bits that can be certified to contain a certain amount of entropy 3 . Certified randomness has many applications but is impossible to achieve solely by classical computation. Here we demonstrate the generation of certifiably random bits using the 56-qubit Quantinuum H2-1 trapped-ion quantum computer accessed over the Internet. Our protocol leverages the classical hardness of recent random circuit sampling demonstrations 4,5 : a client generates quantum ‘challenge’ circuits using a small randomness seed, sends them to an untrusted quantum server to execute and verifies the results of the server. We analyse the security of our protocol against a restricted class of realistic near-term adversaries. Using classical verification with measured combined sustained performance of 1.1 × 10 18 floating-point operations per second across multiple supercomputers, we certify 71,313 bits of entropy under this restricted adversary and additional assumptions. Our results demonstrate a step towards the practical applicability of present-day quantum computers.