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•801 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•34 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

Programming a quantum computer

A five-qubit trapped-ion quantum computer that is programmable and reconfigurable has been demonstrated by researchers from the Joint Quantum Institute in the US.

Physics World•Sep 1, 2016•0 citations

Boost for quantum sensing

Tim Wogan

“Quantum memories” could make long-baseline optical astronomy with single photon sensitivity a reality, as Tim Wogan reports.

Physics World•Apr 1, 2026•0 citations
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.