scientific article; zbMATH DE number 7561521

DOI10.4230/LIPIcs.ICALP.2019.28MaRDI QIDQ5091177

Alex Bredariol Grilo

Publication date: 21 July 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

quantum computationquantum cryptographydelegation of quantum computation

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (3)

Unnamed Item ⋮ Sumcheck-based delegation of quantum computing to rational server ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources
• Measurement-based quantum computation cannot avoid byproducts
• Proof verification and the hardness of approximation problems
• Probabilistic checking of proofs
• A Parallel Repetition Theorem
• Simple unified form for the major no-hidden-variables theorems
• How to Verify a Quantum Computation
• A quantum linearity test for robustly verifying entanglement
• Robustness and device independence of verifiable blind quantum computing
• Classical verification of quantum proofs
• The PCP theorem by gap amplification

This page was built for publication: