Certified randomness using a trapped-ion quantum processor
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913762126069760 |
|---|---|
| author | 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 |
| author_facet | 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 |
| contents | 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\times10^{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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_20498 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | 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 Quantum Physics Cryptography and Security Emerging Technologies 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\times10^{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. |
| title | Certified randomness using a trapped-ion quantum processor |
| topic | Quantum Physics Cryptography and Security Emerging Technologies |
| url | https://arxiv.org/abs/2503.20498 |