Certified randomness using a trapped-ion quantum processor

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\times 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 today's quantum computers.

References in corpus (21)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum algorithm for solving linear systems of equations
• Random Numbers Certified by Bell's Theorem
• Characterizing Quantum Supremacy in Near-Term Devices
• Strong quantum computational advantage using a superconducting quantum processor
• Quantum Random Number Generators
• Efficient quantum algorithms for simulating sparse Hamiltonians
• A rigorous and robust quantum speed-up in supervised machine learning
• Certified randomness in quantum physics
• Quantum computing for finance
• Device independent quantum random number generation
• Quantum Computer Systems for Scientific Discovery
• Experimentally Generated Randomness Certified by the Impossibility of Superluminal Signals
• Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
• Phase transition in Random Circuit Sampling
• A Comprehensive Review of Quantum Random Number Generators: Concepts, Classification and the Origin of Randomness
• Practical randomness amplification and privatisation with implementations on quantum computers
• Quantum Computational Advantage via 60-Qubit 24-Cycle Random Circuit Sampling
• Validating quantum-supremacy experiments with exact and fast tensor network contraction
• Cryptomite: A versatile and user-friendly library of randomness extractors
• On the Equivalence between Classical Position Verification and Certified Randomness

Cited by in corpus (8)

• Tensor networks for quantum computing
• The future of secure communications: device independence in quantum key distribution
• Applications of Certified Randomness
• Certified Random Number Generation using Quantum Computers
• Distributed-HISQ: A Distributed Quantum Control Architecture
• High-speed and high-connectivity two-qubit gates in long chains of trapped ions
• IF-QAOA: A Penalty-Free Approach to Accelerating Constrained Quantum Optimization
• Quantum Random Number Generation with Partial Source Assumptions