scientific article; zbMATH DE number 6607547
From MaRDI portal
Publication:5741632
DOI10.4086/toc.2016.v012a003zbMath1362.68087arXiv1309.5675OpenAlexW1494680701MaRDI QIDQ5741632
Publication date: 29 July 2016
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.5675
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (12)
Verification of quantum computation and the price of trust ⋮ Rigidity of quantum steering and one-sided device-independent verifiable quantum computation ⋮ Equivalence of single-server and multiple-server blind quantum computation protocols ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimised resource construction for verifiable quantum computation ⋮ Unnamed Item ⋮ Contextuality in multipartite pseudo-telepathy graph games ⋮ Sumcheck-based delegation of quantum computing to rational server ⋮ Verification of quantum computation: an overview of existing approaches ⋮ Measurement-based universal blind quantum computation with minor resources ⋮ Multi-server blind quantum computation protocol with limited classical communication among servers
Cites Work
This page was built for publication: