Unconditional verification of quantum computation with classical light
Preprint
Abstract
Verification of quantum computation is a task to efficiently check whether an output given from a quantum computer is correct. Existing verification protocols conducted between a quantum computer to be verified and a verifier necessitate quantum communication to unconditionally detect any malicious behavior of the quantum computer solving any promise problem in ${\sf BQP}$. In this paper, we remove the necessity of the communication of qubits by proposing a "physically classical" verification protocol in which the verifier just sends coherent light to the quantum computer.
Keywords
All Related Versions
This publication has 55 references indexed in Scilit:
- Implementation Security in Quantum Key DistributionAdvanced Quantum Technologies, 2024
- Experimental demonstration of quantum advantage for NP verification with limited informationNature Communications, 2021
- Quantum algorithm for the multicollision problemTheoretical Computer Science, 2020
- Resource-efficient verification of quantum computing using Serfling’s boundnpj Quantum Information, 2019
- Verification of Quantum Computation: An Overview of Existing ApproachesTheory of Computing Systems, 2018
- Finite-data-size study on practical universal blind quantum computationQuantum Information Processing, 2018
- Quantum cryptography: Public key distribution and coin tossingTheoretical Computer Science, 2014
- Experimental verification of quantum computationNature Physics, 2013
- Classical command of quantum systemsNature, 2013
- Fidelity of states in infinite-dimensional quantum systemsScience China Physics, Mechanics & Astronomy, 2012