Hello,

We noticed you're browsing in private or incognito mode.

To continue reading this article, please exit incognito mode or log in.

Not an Insider? Subscribe now for unlimited access to online articles.

Intelligent Machines

Spooky Computing

The Feynman Processor: Quantum Entanglement and the Computing Revolution

If not for the recent wave of Feynmania, Gerard Milburn’s new book would probably have been called The Einstein Processor. In a 1935 paper, Einstein and colleagues Boris Podolsky and Nathan Rosen tried to discredit the new theory of quantum mechanics by demonstrating that it led to seemingly impossible results. The famous “EPR” paper showed that if two particles, A and B, are related by some past quantum interaction and an observer measures A’s momentum, then B’s momentum must instantaneously take on the opposite value-even if A and B are light-years apart. Einstein scorned this result, with its implication of faster-than-light communication, as “spooky action at a distance.”

Far from undermining quantum mechanics, however, the EPR paper proved to be science’s first glimpse of a bizarre phenomenon: quantum entanglement. Milburn, an Australian theoretical physicist working in the field of “quantum computing,” is the first to make entanglement and its real-world significance penetrable for the lay reader.

For other physicists, Milburn writes, the EPR argument pointed to realities Einstein was reluctant to accept. Most systems in the familiar world have definite states: a tossed coin comes up either heads or tails. But in the quantum world, governed by the uncertainty principle, different states commingle until measured; a bit can be a blend of a 0 and a 1, called a “qubit.” To represent this blending in calculations of the odds in quantum experiments, Milburn explains, Richard Feynman invented a quantity called “probability amplitude.” Entangled particles that seem to communicate instantaneously are simply obeying Feynman’s rule for adding probability amplitudes.

This story is part of our January/February 1999 Issue
See the rest of the issue
Subscribe

This esoteric realm has some remarkably practical implications. A computer using quantum versions of the classic logic gates such as AND, OR and NOT would be able to process all possible inputs simultaneously, Milburn explains, making it useful for problems such as finding the prime factors of very large numbers. (The magnitude of this task is the basis of today’s best encryption methods.)

Researchers have devised simple quantum logic gates and used entanglement to instantaneously impress one particle’s quantum state upon another faraway particle-opening up “teleportation” as a potential way to move information inside a computer. Though the work of Milburn and his colleagues revolves around uncertainty, they show little of this quality themselves when they predict that quantum entanglement will be the key to future gains in computing power. “It may take decades, perhaps a century,” Milburn writes, “but a commercially viable quantum computer is a certainty.”

Want to go ad free? No ad blockers needed.

Become an Insider
Already an Insider? Log in.
More from Intelligent Machines

Artificial intelligence and robots are transforming how we work and live.

Want more award-winning journalism? Subscribe to Insider Online Only.
  • Insider Online Only {! insider.prices.online !}*

    {! insider.display.menuOptionsLabel !}

    Unlimited online access including articles and video, plus The Download with the top tech stories delivered daily to your inbox.

    See details+

    Unlimited online access including all articles, multimedia, and more

    The Download newsletter with top tech stories delivered daily to your inbox

/3
You've read of three free articles this month. for unlimited online access. You've read of three free articles this month. for unlimited online access. This is your last free article this month. for unlimited online access. You've read all your free articles this month. for unlimited online access. You've read of three free articles this month. for more, or for unlimited online access. for two more free articles, or for unlimited online access.