Slashdot Mirror
Several Quantum Calculations Combined At NIST
Al writes "Researchers at the National Institute of Standards and Technology (NIST) have demonstrated a crucial step toward building a practical quantum computer: multiple computing operations on quantum bits. The NIST team performed five quantum logic operations and 10 transport operations (meaning they moved the qubit from one part of the system to another) in series, while reliably maintaining the states of their ions — a tricky task because the ions can easily be knocked out of their prepared state. The researchers used beryllium ions stored within so-called ion traps and added magnesium ions to keep the beryllium ones cool and prevent them from losing their quantum state." In related news, another reader links to an Australian study indicating that quantum computers "can continue to work perfectly even if half their components, or qubits, are missing."
To truly understand a quantum computer you need a fairly strong understanding of linear algebra, although knowing quantum mechanics isn't actually necessary. I'll repost an explanation I wrote for another site:
Not 100% accurate, but here's a rough way to understand a quantum computer: If you've ever heard of the concept that whenever there's some chance, the universe 'splits' and both events occur, that's what's going on. When the quantum computer makes a qubit 1 and 0 at the same time, it basically uses a truly random event to determine which value the bit will be. The universe 'splits' and down one path there is a 1, and down the other there is a 0. Except the quantum computer 'splits' the universe in such a way that the two universes can interact with each other. It is even possible to have the quantum computer compute something on every input at once and then search through all the different universes to find an answer; this is known as Gover's algorithm.
The critical part is coherence: making sure that the only difference between the different universes is inside the quantum computer itself. So long as coherence is maintained, the universes can merge back together and all you're left with is the right answer (99.99999% of the time). If coherence isn't maintained then the universes can't remerge, and you don't get a correct answer. Decoherence is actually extremely hard to deal with, and the biggest engineering challenge in designing a quantum computer.
Typically with these searches you know the answer you want, and you're interested in which input gives you that answer (the inverse problem). An important caveat about Grover's algorithm is that, while it's significantly faster than classical unordered search, it's still non-polynomial.
That's a horribly misleading summary. Quantum computation is plagued with error... the same thing occurs in classical scenarios but we have error correction schemes to deal with that (for example, error correcting codes). Analagously there's quantum error correction which lets you recover your quantum information after corruption, however previously it was fairly limited in capability. The new research is a way to improve quantum error correction, so that the original information is recoverable after much more substantial corruption than was possible before.
You might check it with a classical-computing algorithm. For NP problems, verification of the answer is often substantially faster than computing the answer itself.
The World Wide Web is dying. Soon, we shall have only the Internet.