Optimised resource construction for verifiable quantum computation

DOI10.1088/1751-8121/aa5daczbMath1364.81080arXiv1510.07408OpenAlexW3098496901WikidataQ62099846 ScholiaQ62099846MaRDI QIDQ2988006

Petros Wallden, Elham Kashefi

Publication date: 18 May 2017

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

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

zbMATH Keywords

quantum devicesblind quantum computationscalable quantum network

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15)

Related Items (6)

Verification of quantum computation and the price of trust ⋮ Rigidity of quantum steering and one-sided device-independent verifiable quantum computation ⋮ Unnamed Item ⋮ How to Verify a Quantum Computation ⋮ Unnamed Item ⋮ Verification of quantum computation: an overview of existing approaches

Cites Work

• Unnamed Item
• Unnamed Item
• Quantum One-Time Programs
• Composable Security of Delegated Quantum Computation
• Practical Sharing of Quantum Secrets over Untrusted Channels
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Multiparty entanglement in graph states
• The measurement calculus
• Robustness and device independence of verifiable blind quantum computing
• Universal Blind Quantum Computation
• The computational complexity of linear optics
• A polynomial quantum algorithm for approximating the Jones polynomial

This page was built for publication: Optimised resource construction for verifiable quantum computation