Quantum computer solves problem, without running

Feb 22, 2006
Quantum

By combining quantum computation and quantum interrogation, scientists at the University of Illinois at Urbana-Champaign have found an exotic way of determining an answer to an algorithm – without ever running the algorithm.

Using an optical-based quantum computer, a research team led by physicist Paul Kwiat has presented the first demonstration of "counterfactual computation," inferring information about an answer, even though the computer did not run. The researchers report their work in the Feb. 23 issue of Nature.

Quantum computers have the potential for solving certain types of problems much faster than classical computers. Speed and efficiency are gained because quantum bits can be placed in superpositions of one and zero, as opposed to classical bits, which are either one or zero. Moreover, the logic behind the coherent nature of quantum information processing often deviates from intuitive reasoning, leading to some surprising effects.

"It seems absolutely bizarre that counterfactual computation – using information that is counter to what must have actually happened – could find an answer without running the entire quantum computer," said Kwiat, a John Bardeen Professor of Electrical and Computer Engineering and Physics at Illinois. "But the nature of quantum interrogation makes this amazing feat possible."

Sometimes called interaction-free measurement, quantum interrogation is a technique that makes use of wave-particle duality (in this case, of photons) to search a region of space without actually entering that region of space.

Utilizing two coupled optical interferometers, nested within a third, Kwiat's team succeeded in counterfactually searching a four-element database using Grover's quantum search algorithm. "By placing our photon in a quantum superposition of running and not running the search algorithm, we obtained information about the answer even when the photon did not run the search algorithm," said graduate student Onur Hosten, lead author of the Nature paper. "We also showed theoretically how to obtain the answer without ever running the algorithm, by using a 'chained Zeno' effect."

Through clever use of beam splitters and both constructive and destructive interference, the researchers can put each photon in a superposition of taking two paths. Although a photon can occupy multiple places simultaneously, it can only make an actual appearance at one location. Its presence defines its path, and that can, in a very strange way, negate the need for the search algorithm to run.

"In a sense, it is the possibility that the algorithm could run which prevents the algorithm from running," Kwiat said. "That is at the heart of quantum interrogation schemes, and to my mind, quantum mechanics doesn't get any more mysterious than this."

While the researchers' optical quantum computer cannot be scaled up, using these kinds of interrogation techniques may make it possible to reduce errors in quantum computing, Kwiat said. "Anything you can do to reduce the errors will make it more likely that eventually you'll get a large-scale quantum computer."

Source: University of Illinois at Urbana-Champaign

Explore further: Finding faster-than-light particles by weighing them

add to favorites email to friend print save as pdf

Related Stories

An Interview with Thomas Vidick on quantum code cracking

Dec 15, 2014

Quantum computers, looked to as the next generation of computing technology, are expected to one day vastly outperform conventional computers. Using the laws of quantum mechanics—the physics that governs ...

New largest number factored on a quantum device is 56,153

Nov 28, 2014

(Phys.org)—Researchers have set a new record for the quantum factorization of the largest number to date, 56,153, smashing the previous record of 143 that was set in 2012. They have shown that the exact same room-t ...

Recommended for you

Finding faster-than-light particles by weighing them

Dec 26, 2014

In a new paper accepted by the journal Astroparticle Physics, Robert Ehrlich, a recently retired physicist from George Mason University, claims that the neutrino is very likely a tachyon or faster-than-light par ...

Controlling core switching in Pac-man disks

Dec 24, 2014

Magnetic vortices in thin films can encode information in the perpendicular magnetization pointing up or down relative to the vortex core. These binary states could be useful for non-volatile data storage ...

World's most complex crystal simulated

Dec 24, 2014

The most complicated crystal structure ever produced in a computer simulation has been achieved by researchers at the University of Michigan. They say the findings help demonstrate how complexity can emerge ...

Atoms queue up for quantum computer networks

Dec 24, 2014

In order to develop future quantum computer networks, it is necessary to hold a known number of atoms and read them without them disappearing. To do this, researchers from the Niels Bohr Institute have developed ...

New video supports radiation dosimetry audits

Dec 23, 2014

The National Physical Laboratory (NPL), working with the National Radiotherapy Trials Quality Assurance Group, has produced a video guide to support physicists participating in radiation dosimetry audits.

User comments : 0

Please sign in to add a comment. Registration is free, and takes less than a minute. Read more

Click here to reset your password.
Sign in to get notified via email when new comments are made.