University of Kwazulu-Natal

Certified Randomness Using A Trapped Ion Quantum Processor

Bonisiwe Shabane
-
certified randomness using a trapped ion quantum processor

Nature volume 640, pages 343–348 (2025)Cite this article 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...

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 × 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. In recent years, numerous theoretical results have shown evidence that quantum computers have the potential to tackle a wide range of problems out of reach of classical techniques. The main examples include factoring large integers6, implicitly solving exponentially sized systems of linear equations7, optimizing intractable problems8, learning certain functions9 and simulating large quantum many-body systems10. However, accounting for considerations such as quantum error correction overheads and gate speeds, the resource requirements of known quantum algorithms for these problems put them far outside the reach of near-term quantum devices, including...

Consequently, it is unclear whether the devices available in the near term can benefit a practical application11. Starting with one of the first ‘quantum supremacy’ demonstrations5, several groups have used random circuit sampling (RCS) as an example of a task that can be executed faster and with a lower energy cost... Yet, despite rapid experimental progress, a beyond-classical demonstration of a practically useful task performed by gate-based quantum computers has so far remained unknown. Random number generation is a natural task for the beyond-classical demonstration because randomness is intrinsic to quantum mechanics, and it is important in many applications, ranging from information security to ensuring the fairness of... The main challenge for any client receiving randomness from a third-party provider, such as a hardware security module, is to verify that the bits received are truly random and freshly generated. Although certified randomness is not necessary for every use of random numbers, the freshness requirement is especially important in applications such as lotteries and e-games, in which several parties (which may or may not...

Moreover, certified randomness can be used to verify the position of a dishonest party18,19,20. arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

In a groundbreaking study published in Nature, a team of researchers from JPMorgan Chase, Quantinuum, Argonne National Laboratory, Oak Ridge National Laboratory, and The University of Texas at Austin has unveiled a major advancement... This achievement, realized using a 56-qubit quantum computer, opens new possibilities in various fields, including cryptography, fairness, and privacy. For the first time, the team demonstrated how a quantum computer can generate truly random numbers, validated by a classical supercomputer to confirm their freshness and authenticity. This milestone represents not just a theoretical breakthrough but also a practical application of quantum computers for tasks that classical systems could never achieve. Quantum computing has long been celebrated for its immense computational potential. Unlike classical computers, which rely on bits that are either 0 or 1, quantum computers utilize quantum bits, or qubits, that can exist in multiple states simultaneously.

This inherent parallelism enables quantum computers to perform calculations that are exponentially faster than classical systems. In recent years, companies like Google and teams from academic institutions have demonstrated “quantum supremacy,” where a quantum computer solves tasks impossible for classical computers to complete in a reasonable timeframe. However, the shift from theoretical potential to practical applications has remained a challenge. Quantum supremacy was an impressive demonstration of quantum computers’ power, but it still lacked real-world utility—until now. The new research, led by experts like Scott Aaronson from The University of Texas at Austin, has made significant strides in applying quantum computing to tangible problems. The work described in the Nature paper illustrates how quantum computers can solve a real-world problem—certified randomness—that has direct applications in fields such as cryptography and data security.

Randomness is a crucial resource in modern computing, particularly in cryptography, statistical sampling, and privacy-enhancing technologies. Traditional, classical computers struggle with generating truly random numbers. They often rely on pseudo-random number generators (PRNGs), which are algorithms that produce sequences of numbers that appear random but are ultimately deterministic and can be replicated if the algorithm’s state is known. This predictability becomes a problem in areas like cryptography, where the security of encryption methods depends on the randomness of the numbers used. While PRNGs can suffice for many applications, they are vulnerable to manipulation. An adversary who gains control over the generator could predict or alter the random sequence, potentially compromising sensitive systems.

For example, if an attacker can predict the randomness in a cryptographic algorithm, they could crack encryption codes and gain unauthorized access to secure data. Thus, the need for “true randomness” has grown as an essential aspect of cryptographic systems, privacy protocols, and even fairness in algorithms. You've probably all waited for the expression “it's random” several times in your life. The phrase is frequently used to describe unpredictable situations, but true randomness, in physics as in mathematics, has long remained an elusive concept. However, a team of quantum computing researchers has just taken a major step forward. For the first time, they have generated a number that is certified as fundamentally random.

Their work, based on a 56-qubit quantum computer, has just been published in the journal Nature. What's fascinating is that this work could have an impact on very concrete areas such as cybersecurity in the future. The very idea of “true randomness” goes far beyond the mere drawing of a number. For physicists, what we commonly describe as random often obeys deterministic physical or mathematical laws. The real challenge lies in demonstrating that a number is fundamentally unpredictable. This certification is just as difficult as generating the number itself since it is so difficult to guarantee the absolute independence of the verification mechanism.

This is precisely where the concept of “certified randomness” comes into play - a notion with far-reaching implications for both IT security and the integrity of decision-making processes. This innovative protocol was theorized by Scott Aaronson, Professor of Computer Science at the University of Texas at Austin. Together with his colleague Shi-Han Hung, he developed the theoretical basis for moving from abstract models to concrete experimentation, ushering in a new era of quantum computing. “When I first proposed my certified randomization protocol in 2018, I had no idea how many years would pass before an experimental demonstration,” confides Aaronson in a statement. “Developing the original protocol and understanding it is a first step towards using quantum computers to generate certified random bits, exploitable in real cryptographic applications,” he adds. A recent peer-reviewed study published in Nature has demonstrated a compelling real-world use case for quantum processors: certifiably random number generation.

Using a 56-qubit quantum computer, the researchers successfully generated 71,313 bits of certified entropy, random bits proven to be unpredictable, even when the quantum device itself is untrusted and remote. The protocol works by sending quantum circuits to the server, verifying specific output patterns, and confirming randomness with mathematical rigor. Randomness is foundational to cryptography, secure communications, and scientific simulations. Classical methods rely on pseudo-random algorithms, which—while efficient—are not truly unpredictable. Quantum-generated randomness, on the other hand, is rooted in the fundamental uncertainty of quantum mechanics. What sets this work apart is its device-independent approach: even if the quantum computer is not fully trusted, the randomness can still be verified and certified.

This has meaningful implications for future digital infrastructure, where trust-minimized, verifiable processes are increasingly important. This breakthrough points to a maturing field where quantum computers are not just theoretical tools, but operational assets in real-world systems. As research continues, certified randomness could become a cornerstone service in the future quantum-powered internet.

People Also Search

Nature Volume 640, Pages 343–348 (2025)Cite This Article Although Quantum

Nature volume 640, pages 343–348 (2025)Cite this article 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 a...

We Analyse The Security Of Our Protocol Against A Restricted

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 × 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 pra...

Consequently, It Is Unclear Whether The Devices Available In The

Consequently, it is unclear whether the devices available in the near term can benefit a practical application11. Starting with one of the first ‘quantum supremacy’ demonstrations5, several groups have used random circuit sampling (RCS) as an example of a task that can be executed faster and with a lower energy cost... Yet, despite rapid experimental progress, a beyond-classical demonstration of a...

Moreover, Certified Randomness Can Be Used To Verify The Position

Moreover, certified randomness can be used to verify the position of a dishonest party18,19,20. arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these val...

In A Groundbreaking Study Published In Nature, A Team Of

In a groundbreaking study published in Nature, a team of researchers from JPMorgan Chase, Quantinuum, Argonne National Laboratory, Oak Ridge National Laboratory, and The University of Texas at Austin has unveiled a major advancement... This achievement, realized using a 56-qubit quantum computer, opens new possibilities in various fields, including cryptography, fairness, and privacy. For the firs...