Quantum computers are capable of generating randomness far more efficiently than previously anticipated. This remarkable discovery reveals the ongoing complexities at the intersection of quantum physics and computation.

Randomness is essential for numerous computational tasks. For instance, weather simulations require multiple iterations with randomly chosen slightly varied initial conditions. In the realm of quantum computing, researchers have demonstrated quantum advantage by arranging qubits randomly to yield outcomes that classical machines struggle to achieve.

Creating these random configurations effectively entails shuffling qubits and connecting them repeatedly, akin to shuffling a deck of cards. Initially, it was believed that adding more qubits to the system would extend the time required for shuffling, analogous to how larger decks of cards are harder to shuffle. With increased shuffling potentially compromising the delicate quantum states of qubits, the prospect of significant applications relying on randomness was thought to be limited to smaller quantum systems.

Recently, Thomas Schuster from the California Institute of Technology and his team found that generating these random sequences requires fewer shuffles than previously believed.

To illustrate this, Schuster and his colleagues conceptualized dividing the qubit ensemble into smaller segments, thereby mathematically demonstrating that each segment could independently produce a random sequence. They further established that these smaller qubit segments could be “joined” to create a well-shuffled version of the original collection of qubits in a manner that defies expectations.

“It’s quite astonishing because it indicates that classical random number generators don’t exhibit anything comparable,” states Schuster. For instance, in the case of card shuffling within a block, the top cards tend to remain near the top. This is not applicable in quantum systems, where quantum shuffles generate a random superposition of all possible arrangements.

“This is a significantly more intricate phenomenon compared to classical shuffling. The order of the top card is not preserved, as can be observed through classical methods where measuring the top card’s position post-shuffle yields a random output each time, devoid of any insights into the shuffling process itself. It’s genuinely a new and fundamentally quantum phenomenon.”

“We anticipated that this sort of random quantum behavior would be exceptionally challenging to achieve. Yet, the authors demonstrated that it can be realized with remarkable efficiency,” remarks Peter Craze from the Max Planck Institute for the Physics of Complex Systems in Germany. “This discovery was quite unexpected.”

“Random quantum circuits hold numerous applications as elements of quantum algorithms and for showcasing what is termed quantum advantage,” notes Ashley Montanaro from the University of Bristol, UK. “The authors have already identified various applications in quantum information and hope that additional applications will emerge.” While researchers can facilitate experiments demonstrating a type of quantum advantage they have previously conducted, Montanaro cautions that this does not imply we are closer to reaping the practical benefits of such advantages.