Constant-round blind classical verification of quantum sampling

DOI10.1007/978-3-031-07082-2_25OpenAlexW3111400853MaRDI QIDQ2170108FDOQ2170108

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

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

zbMATH Keywords

blind quantum computationclassical delegation of quantum computationquantum sampling problems

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Succinct classical verification of quantum computation
• Classical verification of quantum computations with efficient verifier
• Secure quantum computation with classical communication
• Best-of-both-worlds multiparty quantum computation with publicly verifiable identifiable abort
• Obfuscation of pseudo-deterministic quantum circuits

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)