Certified randomness using a trapped-ion quantum processor.

๐Ÿ“… 2025-03-26
๐Ÿ›๏ธ Nature
๐Ÿ“ˆ Citations: 0
โœจ Influential: 0
๐Ÿ“„ PDF
๐Ÿค– AI Summary
This work addresses the fundamental problem of generating certifiable, high-entropy true random bits on an untrusted remote quantum device. We propose a client-server protocol wherein the client constructs challenge random quantum circuits, which are executed remotely on the Quantinuum H2-1 trapped-ion quantum processor (56 qubits); certification is then achieved via classical interactive verification and entropy estimation. To our knowledge, this is the first demonstration of certified randomness generation based on the computational hardness of Random Circuit Sampling (RCS) on real, medium-scale ion-trap hardware, supporting internet-based remote access and lightweight seed initialization. Leveraging multi-supercomputer collaborative verification (1.1ร—10ยนโธ FLOPS), we certify 71,313 bits of min-entropy, providing security guarantees against near-term bounded adversaries. This represents a critical step toward practical, hardware-based certified random number services.

Technology Category

Application Category

๐Ÿ“ Abstract
Although quantum computers can perform a wide range of practically important tasks beyond the abilities of classical computers1,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 entropy3. 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 demonstrations4,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โ€‰ร—โ€‰1018 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.
Problem

Research questions and friction points this paper is trying to address.

Generate certified random bits using quantum computers
Verify randomness via classical computation against adversaries
Demonstrate practical quantum applications with trapped-ion processors
Innovation

Methods, ideas, or system contributions that make the work stand out.

Uses 56-qubit trapped-ion quantum processor
Generates verifiable random bits remotely
Leverages classical hardness for security
Minzhao Liu
Minzhao Liu
Applied Research Associate Sr., JPMorgan Chase & Co.
Quantum Algorithms
Ruslan Shaydulin
Ruslan Shaydulin
JPMorganChase
Quantum AlgorithmsQuantum Optimization
Pradeep Niroula
Pradeep Niroula
JPMorganChase
M
M. DeCross
Quantinuum, Broomfield, CO 80021, USA
Shih-Han Hung
Shih-Han Hung
Department of Computer Science, The University of Texas at Austin, Austin, TX 78712, USA
Wen Yu Kon
Wen Yu Kon
Quantum Cryptography Researcher, JPMorganChase
Quantum Communication
E
Enrique Cervero-Mart'in
Global Technology Applied Research, JPMorganChase, New York, NY 10017, USA
K
Kaushik Chakraborty
Global Technology Applied Research, JPMorganChase, New York, NY 10017, USA
Omar Amer
Omar Amer
Global Technologies Applied Research, JPMorgan Chase
Quantum CryptographyQuantum Information TheoryCryptography
Scott Aaronson
Scott Aaronson
Schlumberger Chair of Computer Science, University of Texas at Austin
Quantum computingcomputational complexity
Atithi Acharya
Atithi Acharya
Global Technology Applied Research, JPMorgan Chase
Quantum InformationTensor Networks
Yuri Alexeev
Yuri Alexeev
Senior Quantum Algorithm Engineer
Quantum Information Science
K
K. J. Berg
Quantinuum, Broomfield, CO 80021, USA
Shouvanik Chakrabarti
Shouvanik Chakrabarti
JPMorgan Chase
Quantum ComputingAlgorithmsMachine LearningTheoretical Computer ScienceFinance
F
Florian J. Curchod
Quantinuum, Terrington House, 13โ€“15 Hills Road, Cambridge CB2 1NL, United Kingdom
J
J. Dreiling
Quantinuum, Broomfield, CO 80021, USA
N
Neal Erickson
Quantinuum, Broomfield, CO 80021, USA
C
C. Foltz
Quantinuum, Broomfield, CO 80021, USA
M
M. Foss-Feig
Quantinuum, Broomfield, CO 80021, USA
David Hayes
David Hayes
Quantinuum, Broomfield, CO 80021, USA
Travis Humble
Travis Humble
Oak Ridge National Laboratory
quantum computingquantum algorithmsinformation physicsquantum information
N
Niraj Kumar
Global Technology Applied Research, JPMorganChase, New York, NY 10017, USA
Jeffrey Larson
Jeffrey Larson
Computational Mathematician, Argonne National Laboratory
Optimization for Quantum ComputingSimulation-based OptimizationVehicle PlatooningNumerical Optimization
D
Danylo Lykov
Global Technology Applied Research, JPMorganChase, New York, NY 10017, USA
Michael Mills
Michael Mills
Quantinuum, Broomfield, CO 80021, USA
S
S. Moses
Quantinuum, Broomfield, CO 80021, USA
B
B. Neyenhuis
Quantinuum, Broomfield, CO 80021, USA
Shaltiel Eloul
Shaltiel Eloul
University of Cambridge
P
P. Siegfried
Quantinuum, Broomfield, CO 80021, USA
James Walker
James Walker
Quantinuum, Broomfield, CO 80021, USA
Charles Lim
Charles Lim
National University of Singapore
Quantum EngineeringInfrastructuresNetworkingCybersecurity
Marco Pistoia
Marco Pistoia
Senior Vice President of Industry Relations, IonQ
Quantum ComputingQuantum CommunicationsApplication SecurityLanguage-based Security