Reducing resources for verification of quantum computations
arXiv:1709.10050 · doi:10.1103/PhysRevA.98.022323
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.
arXiv commentAccepted version
References in corpus (16)
- Characterizing Quantum Supremacy in Near-Term Devices
- Quantum information processing with superconducting circuits: a review
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Unconditionally verifiable blind computation
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Verification of quantum computation: An overview of existing approaches
- Determinism in the one-way model
- Robustness and device independence of verifiable blind quantum computing
- Post hoc verification of quantum computation
- Post hoc verification with a single prover
- Interactive proofs for BQP via self-tested graph states
- Multiparty Delegated Quantum Computing
- Direct certification of a class of quantum simulations
- How to Verify a Quantum Computation
- Self-guaranteed measurement-based quantum computation
- Optimised resource construction for verifiable quantum computation
Cited by in corpus (10)
- 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
- Experimental accreditation of outputs of noisy quantum computers
- On the possibility of classical client blind quantum computing
- Nonadaptive fault-tolerant verification of quantum supremacy with noise
- 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