>>> context weblog
sampling new cultural context
| home | site map | about context | donate | lang >>> español - català |
friday :: march 3, 2006
   
 
first demonstration of counterfactual computation

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.

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 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.”

In addition to Kwiat and Hosten, co-authors of the Nature paper are graduate students Julio Barreiro, Nicholas Peters and Matthew Rakher (now at the University of California at Santa Barbara). The work was funded by the Disruptive Technologies Office and the National Science Foundation. >from *Quantum computer solves problem, without running*. February 22, 2006

related context
>
quantum interrogation by sean carroll. the recent quantum computing advance, brilliantly explained. february 27, 2006
> qubit link could pave the way for world's most powerful computers. 'first demonstration how qubit rings, pieces of quantum information, can be linked together.' october 17, 2005
> quantum computing in silicon transistors. august 13, 2004
> teleportation milestone: single mechanism for entanglement. february 13, 2002
> 7-qubit quantum computer: first demonstration of shor's factoring algorithm. january 3, 2002
> magnetic semiconductor: spintronics advance. 'in the long term, advances in spintronics may usher in vastly more powerful quantum computing.' november 13, 2001
> 5-qubit quantum computer. august 15, 2000

imago
>
...

sonic flow
>
exotic algorithm solution [stream]
exotic algorithm solution [download]

| permaLink






> context weblog archive
december 2006
november 2006
october 2006
september 2006
august 2006
july 2006
june 2006
may 2006
april 2006
march 2006
february 2006
january 2006
december 2005
november 2005
october 2005
september 2005
august 2005
july 2005
june 2005
may 2005
april 2005
march 2005
february 2005
january 2005
december 2004
november 2004
october 2004
september 2004
august 2004
july 2004
june 2004
may 2004
april 2004
march 2004
february 2004
january 2004
december 2003
november 2003
october 2003
june 2003
may 2003
april 2003
march 2003
february 2003
january 2003
december 2002
november 2002
october 2002
july 2002
june 2002
may 2002
april 2002
march 2002
february 2002
january 2002
countdown 2002
december 2001
november 2001
october 2001
september 2001
august 2001

more news in
> sitemap

Google


context archives all www
   "active, informed citizen participation is the key to shaping the network society. a new 'public sphere' is required." seattle statement
| home | site map | about context | donate | lang >>> español - català |
03 http://straddle3.net/context/03/en/2006_03_03.html