Certified randomness using a trapped-ion quantum processor
Preprint
Abstract
While quantum computers have the potential to perform a wide range of practically important tasks beyond the capabilities of classical computers, realizing this potential remains a challenge. One such task is to use an untrusted remote device to generate random bits that can be certified to contain a certain amount of entropy. Certified randomness has many applications but is fundamentally impossible to achieve solely by classical computation. In this work, 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: a client generates quantum "challenge" circuits using a small randomness seed, sends them to an untrusted quantum server to execute, and verifies the server's results. We analyze 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\times10^{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 today's quantum computers.
Keywords
All Related Versions
- Version 1, 2025-03-26, ArXiv
- Published version: Nature, 640 (8058), 343.
This publication has 21 references indexed in Scilit:
- A comprehensive review of quantum random number generators: concepts, classification and the origin of randomnessQuantum Information Processing, 2023
- Quantum computational advantage via 60-qubit 24-cycle random circuit samplingScience Bulletin, 2022
- A rigorous and robust quantum speed-up in supervised machine learningNature Physics, 2021
- Quantum supremacy using a programmable superconducting processorNature, 2019
- Device-independent quantum random-number generationNature, 2018
- Characterizing quantum supremacy in near-term devicesNature Physics, 2018
- Experimentally generated randomness certified by the impossibility of superluminal signalsNature, 2018
- Certified randomness in quantum physicsNature, 2016
- Random numbers certified by Bell’s theoremNature, 2010
- Efficient Quantum Algorithms for Simulating Sparse HamiltoniansCommunications in Mathematical Physics, 2006