"Even primitive quantum processors of only a few qubits can perform important computations."

Quantum computers perfect for calculating true randomness

#Computers

Mon, May 16th, 2016 11:00 by capnasty NEWS

According to Science Alert, Australian researchers proved that even a "primitive" two qubit quantum computer is capable of outperforming a classic computer "in certain highly specialised problems," particularly when these problems involve randomness.

"An exciting outcome of our work is that we may have found a new example of quantum walk physics that we can observe with a primitive quantum computer, that otherwise a classical computer could not see," said Jonathan Matthews of the Centre for Quantum Photonics. "These otherwise hidden properties have practical use, perhaps in helping to design more sophisticated quantum computers."

The 'quantum walk' is a quantum mechanical version of such things as Brownian motion, which describes the movement of particles in a suspension, and the 'drunken sailor's random walk' i.e., all the possible directions that a staggering inebriate could turn, and thus the many different ways he could get from point A to point B.

  569

 

You may also be interested in:

Why I Married a Geek
The $37 Laptop. For Real
Open Source Makes Big Gains at the London Stock Exchange
Speech Synthesizer in 1k of Javascript
No More Perks: Coffee Shops Pull the Plug on Laptop Users