2015/06/23 by Theodoros Kapourniotis, Vedran Dunjko, Kapourniotis, Theodoros +3
Computer Science · Engineering · Mathematics · Physics and Astronomy · #Algorithm #Computer science #Cryptographic protocol #Cryptography #Engineering #FOS: Physical sciences #Gas meter prover #Learning with errors #Limiting #Mathematical proof #Mathematics #Physics #Programming language #Protocol (science) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum algorithm #Quantum computer #Quantum cryptography #Quantum information #Quantum mechanics #Quantum-Dot Cellular Automata #Set (abstract data type) #Theoretical computer science #Verifiable secret sharing #quant-ph
paper · pdf · doi:10.48550/arxiv.1506.06943
arxiv created 2015/06/23 · openalex publication_date 2015/06/23 · arxiv updated 2015/06/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
In the absence of any efficient classical schemes for verifying a universal quantum computer, the importance of limiting the required quantum resources for this task has been highlighted recently. Currently, most of efficient quantum verification protocols are based on cryptographic techniques where an almost classical verifier executes her desired encrypted quantum computation remotely on an untrusted quantum prover. In this work we present a new protocol for quantum verification by incorporating existing techniques in a non-standard composition to reduce the required quantum communications between the verifier and the prover.