Reducing resources for verification of quantum computations

Abstract

We present two verification protocols where the correctness of a "target" computation is checked by means of "trap" computations that can be efficiently simulated on a classical computer. Our protocols rely on a minimal set of noise-free operations (preparation of eight single-qubit states or measurement of four observables, both on a single plane of the Bloch sphere) and achieve linear overhead. To the best of our knowledge, our protocols are the least demanding techniques able to achieve linear overhead. They represent a step towards further reducing the quantum requirements for verification.

Accepted version

References in corpus (1)

• Verification of quantum computation: An overview of existing approaches

Cited by in corpus (9)

• Accrediting outputs of noisy intermediate-scale quantum computing devices
• QFactory: classically-instructed remote secret qubits preparation
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• On the possibility of classical client blind quantum computing
• Experimental accreditation of outputs of noisy quantum computers
• Unifying Quantum Verification and Error-Detection: Theory and Tools for Optimisations
• In situ characterization of linear-optical networks in randomized boson sampling
• Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority
• Accreditation Against Limited Adversarial Noise