New! Sign up for our free email newsletter.
Science News
from research organizations

Quantum computers: Trust is good, proof is better

Date:
September 30, 2013
Source:
University of Vienna
Summary:
A quantum computer can solve tasks where a classical computer fails. The question how one can, nevertheless, verify the reliability of a quantum computer was recently answered in a new experiment.
Share:
FULL STORY

A quantum computer can solve tasks where a classical computer fails. The question how one can, nevertheless, verify the reliability of a quantum computer was recently answered in an experiment at the University of Vienna. The conclusions are published in the scientific journal Nature Physics.

The harnessing of quantum phenomena, such as superposition and entanglement, holds great promise for constructing future supercomputers using quantum technology. One huge advantage of such quantum computers is that they are capable of performing a variety of tasks much quicker than their conventional counterparts. The use of quantum computers for these purposes raises a significant challenge: how can one verify the results provided by a quantum computer?

It is only recently that theoretical developments have provided methods to test a quantum computer without having an additional quantum computer at hand. The international research team around Philip Walther at the University of Vienna has now demonstrated a new protocol, where the quantum computational results can be verified without using additional quantum computer resources.

Laying traps for a quantum computer

In order to test the quantum computer the scientists inserted "traps" into the tasks. The traps are short intermediate calculations to which the user knows the result in advance. In case the quantum computer does not do its job properly the trap delivers a result that differs from the expected one. "In this way, the user can verify how reliable the quantum computer really is," explain Elham Kashefi (Edinburgh) and Joseph Fitzsimons (Singapore), theoreticians and co-authors of the paper. The more traps the user builds into the tasks the better the user can be sure that the quantum computer indeed computes accurately.

"We designed the test in such a way that the quantum computer cannot distinguish the trap from its normal tasks" says Stefanie Barz (Vienna), first author of the study. This is an important requirement to guarantee that the quantum computer is not able to tweak the test result. The researchers have also tested whether the quantum computer really resorts to quantum resources. Thereby, they can sure that even a maliciously constructed quantum computer cannot fool them into accepting incorrect results.

Implementing the idea with photons

For this first demonstration the researchers used an optical quantum computer, where single light particles, so-called photons, carried the information. The demonstrated protocol is generic, but optical quantum computers seem to be ideally suited for this task. The mobility of photons allows for easy interactions with the quantum computer. Philip Walther is optimistic about the prospects raised by this experiment which shows promising control mechanisms for future quantum computers. And, moreover, that it might lead to new tools for probing even complex quantum resources.


Story Source:

Materials provided by University of Vienna. Note: Content may be edited for style and length.


Journal Reference:

  1. Stefanie Barz, Joseph F. Fitzsimons, Elham Kashefi, Philip Walther. Experimental verification of quantum computation. Nature Physics, 2013; DOI: 10.1038/nphys2763

Cite This Page:

University of Vienna. "Quantum computers: Trust is good, proof is better." ScienceDaily. ScienceDaily, 30 September 2013. <www.sciencedaily.com/releases/2013/09/130930113951.htm>.
University of Vienna. (2013, September 30). Quantum computers: Trust is good, proof is better. ScienceDaily. Retrieved April 19, 2024 from www.sciencedaily.com/releases/2013/09/130930113951.htm
University of Vienna. "Quantum computers: Trust is good, proof is better." ScienceDaily. www.sciencedaily.com/releases/2013/09/130930113951.htm (accessed April 19, 2024).

Explore More

from ScienceDaily

RELATED STORIES