Optimised resource construction for verifiable quantum computation
arXiv:1510.07408 · doi:10.1088/1751-8121/aa5dac
Abstract
Recent developments make the possibility of achieving scalable quantum networks and quantum devices closer. From the computational point of view these emerging technologies become relevant when they are no longer classically simulatable. Hence a pressing challenge is the construction of practical methods to verify the correctness of the outcome produced by universal or non-universal quantum devices. A promising approach that has been extensively explored is the scheme of verification via encryption through blind quantum computing initiated by Fitzsimons and Kashefi. We present here a new construction that simplifies the required resources for any such verifiable blind quantum computating protocol. We obtain an overhead that is linear in the size of the input, while the security parameter remains independent of the size of the computation and can be made exponentially small. Furthermore our construction is generic and could be applied to any non-universal scheme with a given underlying graph.
26 pages, 2 figures
References in corpus (7)
- Multi-party entanglement in graph states
- Topological fault-tolerance in cluster state quantum computation
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Experimental demonstration of graph-state quantum secret sharing
- Robustness and device independence of verifiable blind quantum computing
- Computation by measurements: a unifying picture
Cited by in corpus (18)
- Photonic quantum information processing: a review
- Verification of quantum computation: An overview of existing approaches
- Rigidity of quantum steering and one-sided device-independent verifiable quantum computation
- How to Verify a Quantum Computation
- Accrediting outputs of noisy intermediate-scale quantum computing devices
- Reducing resources for verification of quantum computations
- Garbled Quantum Computation
- Quantum cryptography beyond key distribution: theory and experiment
- Nonadaptive fault-tolerant verification of quantum supremacy with noise
- Unifying Quantum Verification and Error-Detection: Theory and Tools for Optimisations
- Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation (Extended Abstract)
- Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation
- Minimal physical resources for the realisation of measurement-based quantum computation
- Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority
- Parallel remote state preparation for fully device-independent verifiable blind quantum computation
- Towards practical secure delegated quantum computing with semi-classical light
- Unifying communication paradigms in measurement-based delegated quantum computing
- Accreditation Against Limited Adversarial Noise