From: John K Clark (johnkc@well.com)
Date: Thu Oct 31 1996 - 10:57:57 MST
-----BEGIN PGP SIGNED MESSAGE-----
Forward:
PHYSICS NEWS UPDATE
The American Institute of Physics Bulletin of Physics News
Number 293 October 30, 1996
by Phillip F. Schewe and Ben Stein
A QUANTUM COMPUTER COULD TOLERATE ERRORS while carrying out
calculations, researchers at Los Alamos have now shown.
Computers that operated according to the rules of quantum
mechanics have the potential to perform powerful tasks (such as
factoring huge numbers) because of their radically different
approach to logic: unlike a conventional computer's bits, which exist
either as a 0 or a 1, a quantum bit (or "qubit") could not only exist
simultaneously as a 0 and a 1 but could interact with other qubits so
that its properties became "entangled" with those of the other qubits.
Yet some physicists argue quantum computers may be impossible to
achieve on a practical level because the slightest amount of noise
would destroy the entanglement and thus corrupt the state of the
qubits. Up to now, proposed "quantum error correction" schemes
have shown merely how to preserve the state of qubits. Now, Los
Alamos researchers (Raymond Laflamme, 505-665-3394) have
developed an algorithm for carrying out reliable calculations on a
"qubyte" made of 7 entangled qubits while accounting for the
possibility that one of the qubits is corrupt (upcoming paper in Phys
Rev Lett). Experimentally, quantum computing is regarded as a
long-term possibility: although quantum versions of logic gates have
been constructed (see Update #250), researchers are still working to
entangle more than two quantum systems at a time.
-----BEGIN PGP SIGNATURE-----
Version: 2.6.i
iQCzAgUBMnjvf303wfSpid95AQGB7gTsDnyVsjLIwWx+SIezINwxKmY1d1q/wGxE
unAJgB5e6ONgKVnXAHoW+v3bVGZQuu4jR3saUS26BGS6l+X3yeuKWHJE1kBQL3a3
hgsDo7nxi//jmb2VOCF8QKmEMmavJXGcqn15fS139+dcblpL8j9jX7ryJuX9q7sH
Q5yec+zgYOX4joG4owLNtYsWIYI6F3BH3fJpLBqOVPHNsSTU17Q=
=0mxN
-----END PGP SIGNATURE-----
This archive was generated by hypermail 2.1.5 : Fri Nov 01 2002 - 14:35:48 MST