Constant-round blind classical verification of quantum sampling

DOI10.1007/978-3-031-07082-2_25MaRDI QIDQ2170108zbMATH OpenOpenAlexFDO

Authors Kai-Min Chung, Yi Lee, Han-Hsuan Lin, Xiaodi Wu

Publication date 30 August 2022

Full work available at URL https://arxiv.org/abs/2012.04848

zbMATH Keywords

blind quantum computationclassical delegation of quantum computationquantum sampling problems

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• Classical verification of quantum computations with efficient verifier
• Secure quantum computation with classical communication
• Classical verification of quantum computations
• Non-interactive classical verification of quantum computation
• Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources

Cites work

• Actively secure two-party evaluation of any quantum operation
• Classical homomorphic encryption for quantum circuits
• Classical verification of quantum computations with efficient verifier
• scientific article; zbMATH DE number 1776257 (Why is no real title available?)
• Non-interactive classical verification of quantum computation
• On lattices, learning with errors, random linear codes, and cryptography
• Parallel repetition of computationally sound protocols revisited
• Quantum Arthur-Merlin games
• Quantum FHE (almost) as secure as classical
• Quantum fully homomorphic encryption with verification
• Rate-1 quantum fully homomorphic encryption
• Realizable Hamiltonians for universal adiabatic quantum computers
• Robustness and device independence of verifiable blind quantum computing
• Secure multi-party quantum computation
• Secure quantum computation with classical communication
• Temporally unstructured quantum computation
• The Complexity of the Local Hamiltonian Problem
• The computational complexity of linear optics
• The equivalence of sampling and searching
• Universal Blind Quantum Computation
• Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources

Cited in

(7)

• Classical verification of quantum computations with efficient verifier
• Secure quantum computation with classical communication
• Succinct classical verification of quantum computation
• Obfuscation of pseudo-deterministic quantum circuits
• Best-of-both-worlds multiparty quantum computation with publicly verifiable identifiable abort
• On the power of oblivious state preparation
• A modular approach to succinct arguments for QMA

This page was built for publication: Constant-round blind classical verification of quantum sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170108)