Experimental verification of quantum computation

• Published in: Nature physics 2013-11, Vol.9 (11), p.727-731
• Main Authors: Barz, Stefanie, Fitzsimons, Joseph F., Kashefi, Elham, Walther, Philip
• Format: Article
• Language: English
• Subjects: 639/766/483/2802; 639/766/483/481; Atomic; Blinds; Classical and Continuum Physics; Complex Systems; Computer science; Condensed Matter Physics; Mathematical and Computational Physics; Molecular; Optical and Plasma Physics; Physics; Quantum physics; Theoretical
• ISSN: 1745-2473; 1745-2481
• DOI: 10.1038/nphys2763

Quantum computers are expected to offer substantial speed-ups over their classical counterparts and to solve problems intractable for classical computers. Beyond such practical significance, the concept of quantum computation opens up fundamental questions, among them the issue of whether quantum computations can be certified by entities that are inherently unable to compute the results themselves. Here we present the first experimental verification of quantum computation. We show, in theory and experiment, how a verifier with minimal quantum resources can test a significantly more powerful quantum computer. The new verification protocol introduced here uses the framework of blind quantum computing and is independent of the experimental quantum-computation platform used. In our scheme, the verifier is required only to generate single qubits and transmit them to the quantum computer. We experimentally demonstrate this protocol using four photonic qubits and show how the verifier can test the computer’s ability to perform quantum computation. Can Alice verify the result of a quantum computation that she has delegated to Bob without using a quantum computer? Now she can. A protocol for testing a quantum computer using minimum quantum resources has been proposed and demonstrated.