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.
At a glance
- Quantum theory, the Church–Turing principle and the universal quantum computer. Proc. R. Soc. A 400, 97–117 (1985).
- Rapid solution of problems by quantum computation. Proc. R. Soc. A 439, 553–558 (1992). &
- 212–219 (ACM, 1996). in Proc. 28th Annual ACM Symp. on the Theory of Computing (ed. Miller, G. L.)
- Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484–1509 (1997).
- Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103, 150502 (2009). , &
- Simulating physics with computers. Int. J. Theor. Phys. 21, 467–488 (1982).
- 2361–2387 (Springer, 2012). in Computational Complexity (ed. Meyers, R. A.)
- Multipartite entanglement verification resistant against dishonest parties. Phys. Rev. Lett. 108, 260502 (2012). , , , &
- 453 (ICS, 2010). , & Proc. Innovations in Computer Science
- 517–526 (IEEE Computer Society, 2009). , & Proc. 50th Ann. Symp. Found. Comp. Sci.
- 329 (MIT Press, 2013). & Computability: Turing, Gödel, Church, and Beyond
- http://arxiv.org/abs/1203.5217 (2012). & Unconditionally verifiable blind computation. Preprint at
- http://arxiv.org/abs/1208.1495 (2012). No-signaling topological quantum computation in intelligent environment. Preprint at
- Classical command of quantum systems. Nature 496, 456–460 (2013). , &
- 421–429 (ACM, 1985). Proc. 17th Ann. ACM Symp. Theory Comput.
- The knowledge complexity of interactive proof systems. SIAM J. Comput. 18, 186–208 (1989). , &
- Blind topological measurement-based quantum computation. Nature Commun. 3, 1036 (2012). &
- Demonstration of blind quantum computing. Science 335, 303–308 (2012). et al.
- A one-way quantum computer. Phys. Rev. Lett. 86, 5188–5191 (2001). &
- Measurement-based quantum computation with cluster states. Phys. Rev. A 68, 022312 (2003). , &
- On the Einstein–Podolsky–Rosen paradox. Physics 1, 195–200 (1964).
- Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett. 23, 880–884 (1969). , , &
- A scheme for efficient quantum computation with linear optics. Nature 409, 46–52 (2001). , &
- New high-intensity source of polarization-entangled photon pairs. Phys. Rev. Lett. 75, 4337–4341 (1995). et al.
- Blind quantum computing with weak coherent pulses. Phys. Rev. Lett. 108, 200502 (2012). , &
- Blind quantum computation protocol in which Alice only makes measurements. Phys. Rev. A 87, 050301 (2013). &
- Single-spin addressing in an atomic Mott insulator. Nature 471, 319–324 (2011). et al.
- Onset of a quantum phase transition with a trapped ion quantum simulator. Nature Commun. 2, 377 (2011). et al.
- 14-qubit entanglement: Creation and coherence. Phys. Rev. Lett. 106, 130506 (2011). et al.
- Engineered two-dimensional Ising interactions in a trapped-ion quantum simulator with hundreds of spins. Nature 484, 489–492 (2012). et al.
- Could a boom in technologies trap Feynman’s simulator? Nature 463, 608–608 (2010).
- 118–127 (ACM, 2004). Proc. 36th Ann. ACM Symp. Theory Comput.
- Supplementary Information (320KB)