随机性
计算机科学
量子计算机
量子位元
随机数生成
理论计算机科学
量子
计算机工程
协议(科学)
对手
算法
计算机安全
数学
物理
量子力学
统计
医学
病理
替代医学
作者
Minzhao Liu,Ruslan Shaydulin,Pradeep Niroula,Matthew P. DeCross,Shih-Han Hung,Wen Yu Kon,Enrique Cervero-Martín,Kaushik Chakraborty,Omar Amer,Scott Aaronson,Atithi Acharya,Yuri Alexeev,K. Jordan Berg,Shouvanik Chakrabarti,Florian J. Curchod,Joan Dreiling,Neal R. Erickson,Cameron Foltz,Michael Foss‐Feig,David Hayes
出处
期刊:Nature
[Nature Portfolio]
日期:2025-03-26
卷期号:640 (8058): 343-348
被引量:33
标识
DOI:10.1038/s41586-025-08737-1
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI