On optimising quantum communications in verifiable quantum computing

Theodoros Kapourniotis, Vedran Dunjko, Elham Kashefi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

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.
Original languageEnglish
Title of host publication15th Asian Quantum Information Science Conference
Number of pages3
Publication statusPublished - 28 Aug 2015


Dive into the research topics of 'On optimising quantum communications in verifiable quantum computing'. Together they form a unique fingerprint.

Cite this