Experimental verification of quantum computations
Stefanie Barz, Joseph F. Fitzsimons, Elham Kashefi, Philip Walther

TL;DR
This paper presents the first experimental method for verifying quantum computations using minimal quantum resources, demonstrating its feasibility with photonic qubits and a protocol based on blind quantum computing.
Contribution
Introduces a new experimental verification protocol for quantum computers that requires only minimal quantum resources from the verifier, independent of the platform.
Findings
Successful experimental demonstration with four photonic qubits
Verifier can test measurement-based quantum computations
Protocol is platform-independent
Abstract
Quantum computers are expected to offer substantial speedups over their classical counterparts and to solve problems that are intractable for classical computers. Beyond such practical significance, the concept of quantum computation opens up new fundamental questions, among them the issue whether or not 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 computations. We show, in theory and in experiment, how a verifier with minimal quantum resources can test a significantly more powerful quantum computer. The new verification protocol introduced in this work utilizes the framework of blind quantum computing and is independent of the experimental quantum-computation platform used. In our scheme, the verifier is only required to generate single qubits and transmit…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
