# Non-interactive classical verification of quantum computation

@inproceedings{Alagic2020NoninteractiveCV, title={Non-interactive classical verification of quantum computation}, author={G. Alagic and Andrew M. Childs and A. B. Grilo and S. Hung}, booktitle={IACR Cryptol. ePrint Arch.}, year={2020} }

In a recent breakthrough, Mahadev constructed an interactive protocol that enables a purely classical party to delegate any quantum computation to an untrusted quantum prover. In this work, we show that this same task can in fact be performed non-interactively and in zero-knowledge.
Our protocols result from a sequence of significant improvements to the original four-message protocol of Mahadev. We begin by making the first message instance-independent and moving it to an offline setup phase… Expand

#### Topics from this paper

#### 21 Citations

Secure Quantum Computation with Classical Communication

- Computer Science
- IACR Cryptol. ePrint Arch.
- 2021

A constant-round composable protocol for blind and verifiable classical delegation of quantum computation is constructed, and applications to secure quantum computation with classical communication are shown. Expand

Simpler Proofs of Quantumness

- Computer Science, Physics
- TQC
- 2020

A two-message (challenge-response) proof of quantumness based on any trapdoor claw-free function is given, which allows the use of smaller security parameters and more diverse computational assumptions, significantly reducing the quantum computational effort required for a successful demonstration. Expand

Classical Verification of Quantum Computations with Efficient Verifier

- Computer Science, Physics
- IACR Cryptol. ePrint Arch.
- 2020

The protocol of classical verification of quantum computations (CVQC) recently proposed by Mahadev is extended to make the verification efficient and the first constant round CVQC protocol with negligible soundness error is shown. Expand

Classically Verifiable (Dual-Mode) NIZK for QMA with Preprocessing

- Computer Science
- ArXiv
- 2021

This construction has the so-called dual-mode property, which means that there are two computationally indistinguishable modes of generating CRS, and it has information theoretical soundness in one mode and information theoretical zero-knowledge property in the other. Expand

Information-theoretically-sound non-interactive classical verification of quantum computing with trusted center

- Computer Science, Physics
- ArXiv
- 2020

This paper constructs an information-theoretically-sound non-interactive classical verification protocol for quantum computing with a trusted center, and builds a non-Interactive statistical zero-knowledge proof system for QMA with the trusted center. Expand

Depth-efficient proofs of quantumness

- Physics
- 2021

A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify the quantum advantage of an untrusted prover. That is, a quantum prover can… Expand

The Round Complexity of Quantum Zero-Knowledge

- Computer Science
- IACR Cryptol. ePrint Arch.
- 2021

This is the first protocol for constant-round statistical zero-knowledge arguments for QMA, and matches the best round complexity known for the corresponding protocols for NP with security against classical adversaries. Expand

Semi-Quantum Money

- Physics, Computer Science
- AFT
- 2019

This work considers memoryless interactive protocols in which the minting is likewise classical, and construct a private money scheme that achieves these two notions simultaneously (i.e., classical verification and classical minting). Expand

Indistinguishability Obfuscation of Null Quantum Circuits and Applications

- Physics, Computer Science
- ArXiv
- 2021

It is shown how quantum null-iO enables a series of new cryptographic primitives that, prior to this work, were unknown to exist even making heuristic assumptions. Expand

Candidate Obfuscation of Null Quantum Circuits and Witness Encryption for QMA

- Computer Science
- IACR Cryptol. ePrint Arch.
- 2021

Heuristically instantiating the classical oracle with quantum-secure indistinguishability obfuscation for classical circuits gives the first candidate construction of null-iO for quantum circuits. Expand

#### References

SHOWING 1-10 OF 65 REFERENCES

How to Verify a Quantum Computation

- Mathematics, Physics
- Theory Comput.
- 2018

This work gives a new theoretical solution to a leading-edge experimental challenge, namely to the verification of quantum computations in the regime of high computational complexity, using a reduction to an entanglement-based protocol and showing that verification could be achieved at minimal cost compared to performing the computation. Expand

Classical Verification of Quantum Computations with Efficient Verifier

- Computer Science, Physics
- IACR Cryptol. ePrint Arch.
- 2020

The protocol of classical verification of quantum computations (CVQC) recently proposed by Mahadev is extended to make the verification efficient and the first constant round CVQC protocol with negligible soundness error is shown. Expand

Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources

- Mathematics, Computer Science
- IACR Cryptol. ePrint Arch.
- 2019

This work presents two protocols for a classical verifier to verifiably delegate a quantum computation to two non-communicating but entangled quantum provers, and achieves near-optimal complexity in terms of the total resources employed by the verifier and the honest provers. Expand

Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding

- Mathematics, Physics
- 2014 IEEE 55th Annual Symposium on Foundations of Computer Science
- 2014

It is shown that classically secure proofs and proofs of knowledge are insecure in the quantum setting, and the "pick-one trick" is developed, a general technique that allows an adversary to find one value satisfying a given predicate, but not two. Expand

Non-interactive zero-knowledge arguments for QMA, with preprocessing

- Mathematics, Physics
- CRYPTO
- 2020

If Learning With Errors (LWE) is hard for quantum computers, then any language in QMA has an NIZK argument with preprocessing, and it is shown that any language that has an (interactive) proof of quantum knowledge has an AoQK. Expand

Computationally-Secure and Composable Remote State Preparation

- Computer Science, Physics
- 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
- 2019

The implementation of "random remote state preparation with verification", a functionality first defined in (Dunjko and Kashefi 2014), is expected to be useful for removing the need for quantum communication in such protocols while keeping functionality. Expand

Quantum Proofs

- Computer Science, Physics
- Found. Trends Theor. Comput. Sci.
- 2016

An overview of many of the known results concerning quantum proofs, computational models based on this concept, and properties of the complexity classes they define is provided. Expand

Perfect Zero Knowledge for Quantum Multiprover Interactive Proofs

- Mathematics, Physics
- 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
- 2019

The main result is that the two classes are equal, i.e., MIP* = PZK-MIP*. Expand

Zero-Knowledge for QMA from Locally Simulatable Proofs

- Physics, Computer Science
- ArXiv
- 2019

The main technique consists in developing locally simulatable proofs for all of QMA, an encoding of a QMA witness such that it can be efficiently verified by probing only five qubits and the reduced density matrix can be computed in polynomial time and is independent of the witness. Expand

Semi-Quantum Money

- Physics, Computer Science
- AFT
- 2019

This work considers memoryless interactive protocols in which the minting is likewise classical, and construct a private money scheme that achieves these two notions simultaneously (i.e., classical verification and classical minting). Expand