Apr 3, 2018 · Abstract:We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation.
scholar.google.com › citations
We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation.
People also ask
What is classical quantum computing?
How is classical computation different from quantum computation?
What is the difference between classical and quantum information?
What are the advantages of quantum computing over classical computing?
Duration: 1:02:26
Posted: Jun 15, 2018
Posted: Jun 15, 2018
Jun 29, 2022 · We construct a classically verifiable succinct interactive argument for quantum computation (BQP) with communication complexity and verifier runtime.
Jun 28, 2022 · Abstract. We construct a classically verifiable succinct interactive argument for quantum computation. (BQP) with communication complexity ...
Sep 12, 2018 · Can a classical computer verify the result of a quantum computation through interaction (Gottesman, 2004)?. Urmila Mahadev (UC Berkeley).
This paper presents a simple protocol for verifying quantum computations, in the presence of noisy devices, with no extra assumptions.
In this paper, we extend the protocol of classical verification of quantum computations (CVQC) recently proposed by Mahadev to make the verification ...
Dec 9, 2020 · In this paper, we extend the protocol of classical verification of quantum computations (CVQC) recently proposed by Mahadev to make the ...
Apr 6, 2022 · In the quantum computation verification problem, a quantum server wants to convince a client that the output of evaluating a quantum circuit C ...