HackerPapers

arXiv:1804.01082quant-ph

Classical Verification of Quantum Computations

Urmila Mahadev

Abstract

We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation. We achieve this by constructing a measurement protocol, which enables a classical verifier to use a quantum prover as a trusted measurement device. The protocol forces the prover to behave as follows: the prover must construct an n qubit state of his choice, measure each qubit in the Hadamard or standard basis as directed by the verifier, and report the measurement results to the verifier. The soundness of this protocol is enforced based on the assumption that the learning with errors problem is computationally intractable for efficient quantum machines.

arXiv comments
Journal reference
DOI
Subjects
quant-phQuantum Physics

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 2 threads, from Oct 2018 to Oct 2025. Found in 1 HN submission from Oct 2018 to Oct 2018. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments2 threads

  1. Willow quantum chip demonstrates verifiable quantum advantage on hardware 1 comment

    • Normally, where I come from anyway, verifiability would refer to the ability to prove to a classical skeptic that the quantum device did what it's supposed to, cf. e.g. Mahadev (https://arxiv.org/abs/1804.01082), Aaronson (https://arxiv.org/abs/2209.06930), in a strong…

      pred_View on HNParent context

  2. Graduate Student Solves Quantum Verification Problem 1 comment

    • "Classical Verification of Quantum Computations" Mahadev. (2018) https://arxiv.org/abs/1804.01082 https://www.arxiv-vanity.com/papers/1804.01082/ https://scholar.google.com/scholar?cluster=10138991277567750...

      westurnerView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.