Liu Minzhao, Shaydulin Ruslan, Niroula Pradeep, DeCross Matthew, Hung Shih-Han, Kon Wen Yu, Cervero-Martín Enrique, Chakraborty Kaushik, Amer Omar, Aaronson Scott, Acharya Atithi, Alexeev Yuri, Berg K Jordan, Chakrabarti Shouvanik, Curchod Florian J, Dreiling Joan M, Erickson Neal, Foltz Cameron, Foss-Feig Michael, Hayes David, Humble Travis S, Kumar Niraj, Larson Jeffrey, Lykov Danylo, Mills Michael, Moses Steven A, Neyenhuis Brian, Eloul Shaltiel, Siegfried Peter, Walker James, Lim Charles, Pistoia Marco
Global Technology Applied Research, JPMorganChase, New York, NY, USA.
Computational Science Division, Argonne National Laboratory, Lemont, IL, USA.
Nature. 2025 Apr;640(8058):343-348. doi: 10.1038/s41586-025-08737-1. Epub 2025 Mar 26.
Although quantum computers can perform a wide range of practically important tasks beyond the abilities of classical computers, 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. 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: 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 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.
尽管量子计算机能够执行一系列超出经典计算机能力范围的实际重要任务,但要实现这一潜力仍然是一项挑战。一个例子是使用不可信的远程设备生成可被证明包含一定量熵的随机比特。经认证的随机性有许多应用,但仅通过经典计算是无法实现的。在这里,我们展示了使用通过互联网访问的56比特的Quantinuum H2-1囚禁离子量子计算机生成可认证的随机比特。我们的协议利用了近期随机电路采样演示中的经典难度:客户端使用一个小的随机种子生成量子“挑战”电路,将其发送到不可信的量子服务器执行并验证服务器的结果。我们针对一类受限的现实近期对手分析了我们协议的安全性。通过在多个超级计算机上进行经典验证,测量得到的综合持续性能为每秒1.1×10次浮点运算,在此受限对手和其他假设下,我们认证了71313比特的熵。我们的结果展示了朝着当今量子计算机实际适用性迈出的一步。