A 56 Qubit Quantum Computer Just Did What No Supercomputer Can

Researchers have achieved a major quantum computing breakthrough: certified randomness, a process where a quantum computer generates truly random numbers, which are then proven to be genuinely random by classical supercomputers. This innovation has deep implications for cryptography, fairness, and security, and marks a shift from theoretical potential to practical, real-world applications of quantum advantage. In a new study published in Nature, researchers from JPMorganChase, Quantinuum, Argonne National Laboratory, Oak Ridge National Laboratory, and The University of Texas at Austin report a major milestone in quantum computing, with promising... Using a 56-qubit quantum computer, the team successfully demonstrated certified randomness for the first time. This process involves generating random numbers on a quantum computer, and then using a classical supercomputer to verify that the numbers are truly random and newly produced. The achievement represents a concrete step toward using quantum computers for practical tasks that are currently impossible with classical systems.

The certified randomness protocol was originally proposed by Scott Aaronson, a computer science professor at UT Austin and director of its Quantum Information Center. Aaronson and his former postdoctoral researcher, Shih-Han Hung, provided the theoretical foundation and analytical support for the experimental demonstration. A team including Scott Aaronson demonstrated what may be the first practical application of quantum computers to a real world problem Using a 56-qubit quantum computer, researchers have for the first time experimentally demonstrated a way of generating random numbers from a quantum computer and then using a classical supercomputer to prove they are truly... In a new paper in Nature, a team of researchers from JPMorganChase, Quantinuum, Argonne National Laboratory, Oak Ridge National Laboratory and The University of Texas at Austin describe a milestone in the field of... Using a 56-qubit quantum computer, they have for the first time experimentally demonstrated certified randomness, a way of generating random numbers from a quantum computer and then using a classical supercomputer to prove they...

This could pave the way towards the use of quantum computers for a practical task unattainable through classical methods. Scott Aaronson, Schlumberger Centennial Chair of Computer Science and director of the Quantum Information Center at UT Austin, invented the certified randomness protocol that was demonstrated. He and his former postdoctoral researcher, Shih-Han Hung, provided theoretical and analytical support to the experimentalists on this latest project. 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. A quantum machine has used entangled qubits to generate a number certified as truly random for the first time, demonstrating a handy function that's physically beyond even the most powerful supercomputer.

Researchers from the US and UK repurposed existing quantum supremacy experiments on Quantinuum's 56-qubit computer to roll God's dice. The result was a number so random, no amount of physics could have predicted it. Quantum technology is becoming critical for secure electronic communication as cybersecurity threats increase. Computer scientist Rajeeb Hazra, president and CEO of Quantinuum, says this is "a pivotal milestone that brings quantum computing firmly into the realm of practical, real-world applications." Several years ago, University of Texas Austin computer scientists Scott Aaronson and Shih-Han Hung proposed a way to generate certified random bits based on random circuit sampling – a method to test a device's... 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.

Broomfield, Colorado and London, UK, June 5th, 2024 — Quantinuum, the world’s largest integrated quantum computing company, today unveiled the industry’s first quantum computer with 56 trapped-ion qubits. H2-1 has further enhanced its market-leading fidelity and is now impossible for a classical computer to fully simulate. A joint team from Quantinuum and JPMorgan Chase ran a Random Circuit Sampling (RCS) algorithm, achieving a remarkable 100x improvement over prior industry results from Google in 2019 and setting a new world record... H2-1’s combination of scale and hardware fidelity makes it difficult for today’s most powerful supercomputers and other quantum computing architectures to match this result. “We’re extending our lead in the race towards fault tolerant quantum computing, accelerating research for customers like JPMorgan Chase in ways that aren’t possible with any other technology,” said Rajeeb Hazra, CEO of Quantinuum. “Our focus on quality of qubits versus quantity of qubits is changing what’s possible, and bringing us closer to the long-awaited commercialization of quantum’s applications across industries like finance, logistics, transportation and chemistry.”

Quantinuum’s analysis also indicates that the H2-1 executes RCS at 56 qubits with an estimated 30,000x reduction in power consumption compared to classical supercomputers, reinforcing it as the preferred solution for a wide array... “The fidelity achieved in our random circuit sampling experiment shows unprecedented system-level performance of the Quantinuum quantum computer. We are excited to leverage this high fidelity to advance the field of quantum algorithms for industrial use cases broadly, and financial use cases in particular,” said Marco Pistoia, Head of Global Technology Applied... Using a powerful machine made up of 56 trapped-ion quantum bits, or qubits, researchers have achieved something once thought impossible. They have proven, for the first time, that a quantum computer can generate bits of randomness that are certifiably random—verified using classical supercomputers. This breakthrough goes beyond theory, showing that quantum computers can now solve real-world problems that classical ones simply can’t handle.

Back in 2018, a scientist from the University of Texas at Austin proposed a protocol to generate randomness in a way that could be certified as truly unpredictable. That scientist, Scott Aaronson, now sees that idea become a working reality. "When I first proposed my certified randomness protocol in 2018, I had no idea how long I’d need to wait to see an experimental demonstration of it,” said Aaronson, who now directs a quantum... The experiment was carried out on a cutting-edge 56-qubit quantum computer, accessed remotely over the internet. The machine belongs to a company that recently made a significant upgrade to its system. The research team included experts from a large bank’s tech lab, national research centers, and universities.

To generate certified randomness, the team used a method called random circuit sampling, or RCS. The idea is to feed the quantum computer a series of tough problems, known as challenge circuits. The computer must solve them by choosing among many possible outcomes in a way that’s impossible to predict. Then, classical supercomputers step in to confirm whether the answers are genuinely random or not. Random numbers may seem like a simple thing, but they are a key ingredient in many areas of modern life. They help protect digital data, keep online communications private, and ensure fairness in things like online voting and lottery systems.

But there’s a problem. Classical computers cannot generate truly random numbers. They rely on algorithms or hardware random number generators, which can be manipulated. In a major breakthrough, scientists have used a 56-qubit quantum computer to create and confirm truly random numbers — something that’s impossible for regular computers to do alone. This achievement could have big impacts on data security, privacy, and future technologies. The research, published in Nature, was carried out by a team from JPMorganChase, Quantinuum, Argonne and Oak Ridge National Laboratories, and The University of Texas at Austin.

They used Quantinuum’s upgraded quantum computer, called the System Model H2, which contains 56 powerful trapped-ion qubits. This system was able to generate random numbers and then prove they were genuinely unpredictable — a task regular computers can’t reliably do. Quantum Randomness Could Create a Spoof-Proof Internet Quantinuum’s 56-bit trapped-ion computer has succeeded in demonstrating randomness in quantum circuits to establish secure, private connections The allure of quantum computers is, at its heart, quite simple: by leveraging counterintuitive quantum effects, they could perform computational feats utterly impossible for any classical computer. But reality is more complex: to date, most claims of quantum “advantage”—an achievement by a quantum computer that a regular machine can’t match—have struggled to show they truly exceed classical capabilities.

And many of these claims involve contrived tasks of minimal practical use, fueling criticisms that quantum computing is at best overhyped and at worst on a road to nowhere. Now, however, a team of researchers from JPMorganChase, quantum computing firm Quantinuum, Argonne National Laboratory, Oak Ridge National Laboratory and the University of Texas at Austin seems to have shown a genuine advantage that’s... The group’s results, published recently in Nature, build upon a previous certification protocol—a way to check that random numbers were generated fairly—developed by U.T. Austin computer scientist Scott Aaronson and his former postdoctoral researcher Shih-Han Hung. Using a Quantinuum-developed quantum computer in tandem with classical, or traditional, supercomputers at Argonne and Oak Ridge, the team demonstrated a technique that achieves what is called certified randomness. This method generates random numbers from a quantum computer that are then verified using classical supercomputers, allowing the now-certified random numbers to be safely used as passkeys for encrypted communications.

People Also Search

• A 56-Qubit Quantum Computer Just Did What No Supercomputer Can
• Researchers achieve quantum computing milestone, realizing certified ...
• Quantum Leap: 56-Qubit Computer Achieves Certified Randomness
• Quantum Computer Generates Truly Random Number in Scientific First
• Certified randomness using a trapped-ion quantum processor
• Quantinuum Launches Industry-First, Trapped-Ion 56-Qubit Quantum ...
• Global first: Quantum computer generates bits of unpredictable ... - AOL
• Scientists use 56-qubit quantum computer to prove true randomness
• Quantum Computer Makes Random-Number Breakthrough | Scientific American