• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

使用囚禁离子量子处理器认证随机性。

Certified randomness using a trapped-ion quantum processor.

作者信息

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.

DOI:10.1038/s41586-025-08737-1
PMID:40140579
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC11981928/
Abstract

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比特的熵。我们的结果展示了朝着当今量子计算机实际适用性迈出的一步。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/362e/11981928/77d8db8df674/41586_2025_8737_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/362e/11981928/af8890d4e082/41586_2025_8737_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/362e/11981928/de466351db1a/41586_2025_8737_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/362e/11981928/77d8db8df674/41586_2025_8737_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/362e/11981928/af8890d4e082/41586_2025_8737_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/362e/11981928/de466351db1a/41586_2025_8737_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/362e/11981928/77d8db8df674/41586_2025_8737_Fig3_HTML.jpg

相似文献

1
Certified randomness using a trapped-ion quantum processor.使用囚禁离子量子处理器认证随机性。
Nature. 2025 Apr;640(8058):343-348. doi: 10.1038/s41586-025-08737-1. Epub 2025 Mar 26.
2
Device-independent quantum random-number generation.设备无关的量子随机数生成。
Nature. 2018 Oct;562(7728):548-551. doi: 10.1038/s41586-018-0559-3. Epub 2018 Sep 19.
3
Trading Locality for Time: Certifiable Randomness from Low-Depth Circuits.用局部性换取时间:来自低深度电路的可验证随机性
Commun Math Phys. 2021;382(1):49-86. doi: 10.1007/s00220-021-03963-w. Epub 2021 Feb 9.
4
High-Speed Device-Independent Quantum Random Number Generation without a Detection Loophole.无探测漏洞的高速设备无关量子随机数生成
Phys Rev Lett. 2018 Jan 5;120(1):010503. doi: 10.1103/PhysRevLett.120.010503.
5
Tight Analytic Bound on the Trade-Off between Device-Independent Randomness and Nonlocality.设备无关随机性与非定域性之间权衡的紧密分析界限。
Phys Rev Lett. 2022 Oct 7;129(15):150403. doi: 10.1103/PhysRevLett.129.150403.
6
Experimentally generated randomness certified by the impossibility of superluminal signals.经超光速信号的不可能性证明的实验产生的随机性。
Nature. 2018 Apr;556(7700):223-226. doi: 10.1038/s41586-018-0019-0. Epub 2018 Apr 11.
7
Experimental Realization of Device-Independent Quantum Randomness Expansion.设备无关量子随机性扩展的实验实现
Phys Rev Lett. 2021 Feb 5;126(5):050503. doi: 10.1103/PhysRevLett.126.050503.
8
A simple low-latency real-time certifiable quantum random number generator.一种简单的低延迟实时可验证量子随机数发生器。
Nat Commun. 2021 Feb 24;12(1):1056. doi: 10.1038/s41467-021-21069-8.
9
Verifiable measurement-based quantum random sampling with trapped ions.基于可验证测量的囚禁离子量子随机采样
Nat Commun. 2025 Jan 2;16(1):106. doi: 10.1038/s41467-024-55342-3.
10
Experimental Low-Latency Device-Independent Quantum Randomness.实验性低延迟设备无关量子随机性。
Phys Rev Lett. 2020 Jan 10;124(1):010505. doi: 10.1103/PhysRevLett.124.010505.

引用本文的文献

1
A special machine for solving NP-complete problems.一种用于解决NP完全问题的特殊机器。
Fundam Res. 2025 Jun 6;5(4):1743-1749. doi: 10.1016/j.fmre.2025.05.010. eCollection 2025 Jul.
2
Quantum physicists unveil most 'trustworthy' random-number generator yet.量子物理学家推出迄今最“可靠”的随机数生成器。
Nature. 2025 Jun 11. doi: 10.1038/d41586-025-01849-8.
3
Controlling our online professional persona.掌控我们的在线职业形象。

本文引用的文献

1
Phase transitions in random circuit sampling.随机电路采样中的相变。
Nature. 2024 Oct;634(8033):328-333. doi: 10.1038/s41586-024-07998-6. Epub 2024 Oct 9.
2
Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem.量子近似优化算法在经典难处理问题上的缩放优势证据。
Sci Adv. 2024 May 31;10(22):eadm6761. doi: 10.1126/sciadv.adm6761. Epub 2024 May 29.
3
Verifying Quantum Advantage Experiments with Multiple Amplitude Tensor Network Contraction.利用多重幅度张量网络收缩验证量子优势实验。
Nat Chem. 2025 Jun;17(6):779-780. doi: 10.1038/s41557-025-01839-3.
Phys Rev Lett. 2024 Jan 19;132(3):030601. doi: 10.1103/PhysRevLett.132.030601.
4
Quantum computational advantage via 60-qubit 24-cycle random circuit sampling.通过 60 量子比特 24 循环随机电路采样实现量子计算优势。
Sci Bull (Beijing). 2022 Feb 15;67(3):240-245. doi: 10.1016/j.scib.2021.10.017. Epub 2021 Oct 25.
5
Strong Quantum Computational Advantage Using a Superconducting Quantum Processor.利用超导量子处理器实现强大的量子计算优势。
Phys Rev Lett. 2021 Oct 29;127(18):180501. doi: 10.1103/PhysRevLett.127.180501.
6
Quantum supremacy using a programmable superconducting processor.用量子计算优越性使用可编程超导处理器。
Nature. 2019 Oct;574(7779):505-510. doi: 10.1038/s41586-019-1666-5. Epub 2019 Oct 23.
7
Device-independent quantum random-number generation.设备无关的量子随机数生成。
Nature. 2018 Oct;562(7728):548-551. doi: 10.1038/s41586-018-0559-3. Epub 2018 Sep 19.
8
Experimentally generated randomness certified by the impossibility of superluminal signals.经超光速信号的不可能性证明的实验产生的随机性。
Nature. 2018 Apr;556(7700):223-226. doi: 10.1038/s41586-018-0019-0. Epub 2018 Apr 11.
9
Certified randomness in quantum physics.量子物理学中的认证随机性。
Nature. 2016 Dec 7;540(7632):213-219. doi: 10.1038/nature20119.
10
Random numbers certified by Bell's theorem.经贝尔定理认证的随机数。
Nature. 2010 Apr 15;464(7291):1021-4. doi: 10.1038/nature09008.