ÌÇÐÄÊÓÆµ

July 4, 2025

Improving randomness may be the key to more powerful quantum computers

The circuit construction used to prove the paper's main result. Each block represents a quantum circuit acting on a small patch of the entire system. Credit: Thomas Schuster, Jonas Haferkamp, Hsin-Yuan Huang
× close
The circuit construction used to prove the paper's main result. Each block represents a quantum circuit acting on a small patch of the entire system. Credit: Thomas Schuster, Jonas Haferkamp, Hsin-Yuan Huang

Understanding randomness is crucial in many fields. From computer science and engineering to cryptography and weather forecasting, studying and interpreting randomness helps us simulate real-world phenomena, design algorithms and predict outcomes in uncertain situations.

Randomness is also important in quantum computing, but generating it typically involves a large number of operations. However, Thomas Schuster and colleagues at the California Institute of Technology have demonstrated that quantum computers can produce randomness much more easily than previously thought.

And that's good news because the research could pave the way for faster and more efficient quantum computers.

Shuffling in the quantum world

Unlike that encode information in "bits" (either zeros or ones), the basic unit of information in is the quantum bit or qubit. Arranging or shuffling these in random configurations is one way scientists have demonstrated how quantum computers can outperform classical ones. It's known as the quantum advantage.

Shuffling qubits is a bit like shuffling a pack of playing cards. The more you add, the harder it becomes and the longer the process takes.

Also, the more you shuffle in the quantum world, the greater the chance of ruining the delicate quantum state of each qubit. For this reason, it was thought that only small quantum computers could handle applications that relied on randomness.

An overview of the main result of our paper. We show that short time i.e. low depth quantum circuits can rapidly become indistinguishable from exponential time random unitary operations. Credit: Thomas Schuster, Jonas Haferkamp, Hsin-Yuan Huang
× close
An overview of the main result of our paper. We show that short time i.e. low depth quantum circuits can rapidly become indistinguishable from exponential time random unitary operations. Credit: Thomas Schuster, Jonas Haferkamp, Hsin-Yuan Huang

What the team at the California Institute of Technology has done is show that these random qubit configurations can be produced with fewer shuffles. So, how did they do it?

They imagined splitting a group of qubits into smaller blocks and then proved mathematically that each block could generate .

Describing their research in a in Science, the team showed how these smaller qubit blocks could be "glued" together to create a well-shuffled version of the original qubit sequence.

As a result, it may be possible to use randomly arranged qubit sequences on larger . That means it could be easier to build more powerful quantum computers for tasks such as cryptography, simulations and a host of other real-world applications.

An illustration of several applications of our results. (Left) We show that a popular protocol for benchmarking quantum devices, classical shadow tomography, can be implemented with many fewer resources than previously thought. (Middle) Our results also have surprising implications for the complexity of recognizing quantum phases of matter such as topological order. We prove that the topological order of a quantum state cannot be efficiently recognized by any quantum or classical computation. (Right) Our results also show that quantum experiments with the ability to reverse time can detect properties of quantum dynamics that require exponential resources to detect without time-reversal. Credit: Thomas Schuster, Jonas Haferkamp, Hsin-Yuan Huang
× close
An illustration of several applications of our results. (Left) We show that a popular protocol for benchmarking quantum devices, classical shadow tomography, can be implemented with many fewer resources than previously thought. (Middle) Our results also have surprising implications for the complexity of recognizing quantum phases of matter such as topological order. We prove that the topological order of a quantum state cannot be efficiently recognized by any quantum or classical computation. (Right) Our results also show that quantum experiments with the ability to reverse time can detect properties of quantum dynamics that require exponential resources to detect without time-reversal. Credit: Thomas Schuster, Jonas Haferkamp, Hsin-Yuan Huang

Deeper implications

The researchers also believe their findings point to something even deeper. Namely, there may be fundamental limits to what we can observe in nature because quantum systems hide information incredibly quickly.

"Our results show that several fundamental physical properties—evolution time, phases of matter, and causal structure— are probably hard to learn through conventional quantum experiments. This raises profound questions about the nature of physical observation itself."

Get free science updates with Science X Daily and Weekly Newsletters — to customize your preferences!

More information: Thomas Schuster et al, Random unitaries in extremely low depth, Science (2025).

Naoki Yamamoto et al, Shrinking quantum randomization, Science (2025).

Journal information: Science

Load comments (0)

This article has been reviewed according to Science X's and . have highlighted the following attributes while ensuring the content's credibility:

fact-checked
peer-reviewed publication
trusted source
proofread

Get Instant Summarized Text (GIST)

Quantum computers can generate randomness more efficiently than previously believed by dividing qubits into smaller blocks, each producing randomness, and then combining them. This approach enables larger quantum systems to use random qubit arrangements, potentially leading to faster, more powerful quantum computers. The findings also suggest fundamental limits to observing certain properties in quantum systems.

This summary was automatically generated using LLM.