Certified randomness using a trapped-ion quantum processor

• 成果类型: Article
• 署名作者: Liu, Minzhao; Shaydulin, Ruslan; Niroula, Pradeep; Decross, Matthew; Hung, Shih-Han; Kon, Wen Yu; Cervero-Martin, 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
• 署名单位: United States Department of Energy (DOE); Argonne National Laboratory; University of Chicago; University of Texas System; University of Texas Austin; National Taiwan University; United States Department of Energy (DOE); Oak Ridge National Laboratory; United States Department of Energy (DOE); Argonne National Laboratory
• 刊物名称: Nature
• ISSN/ISSBN: 0028-1995
• DOI: 10.1038/s41586-025-08737-1
• 发表日期: 2025-04-10
• 关键词: supremacy

摘要

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 x 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.