Efficient Universal Blind Quantum Computation
- 3 December 2013
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 111 (23) , 230501
Abstract
We give a cheat sensitive protocol for blind universal quantum computation that is efficient in terms of computational and communication resources: it allows one party to perform an arbitrary computation on a second party’s quantum computer without revealing either which computation is performed, or its input and output. The first party’s computational capabilities can be extremely limited: she must only be able to create and measure single-qubit superposition states. The second party is not required to use measurement-based quantum computation. The protocol requires the (optimal) exchange of single-qubit states, where is the computational depth and is the number of qubits needed for the computation.
Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Ancilla-driven universal blind quantum computationPhysical Review A, 2013
- Blind topological measurement-based quantum computationNature Communications, 2012
- Quantum Random Access MemoryPhysical Review Letters, 2008
- Information-disturbance tradeoff in quantum measurementsPhysical Review A, 2006
- Decoy State Quantum Key DistributionPhysical Review Letters, 2005
- Beating the Photon-Number-Splitting Attack in Practical Quantum CryptographyPhysical Review Letters, 2005
- Quantum Key Distribution with High Loss: Toward Global Secure CommunicationPhysical Review Letters, 2003
- Unconditional Security of Quantum Key Distribution over Arbitrarily Long DistancesScience, 1999
- Quantum-state disturbance versus information gain: Uncertainty relations for quantum informationPhysical Review A, 1996
- On hiding information from an oracleJournal of Computer and System Sciences, 1989