Please use this identifier to cite or link to this item:
|Title:||Optimal blind quantum computation|
|Citation:||Mantri, A., Pérez-Delgado, C.A., Fitzsimons, J.F. (2013-12-03). Optimal blind quantum computation. Physical Review Letters 111 (23) : -. ScholarBank@NUS Repository. https://doi.org/10.1103/PhysRevLett.111.230502|
|Abstract:||Blind quantum computation allows a client with limited quantum capabilities to interact with a remote quantum computer to perform an arbitrary quantum computation, while keeping the description of that computation hidden from the remote quantum computer. While a number of protocols have been proposed in recent years, little is currently understood about the resources necessary to accomplish the task. Here, we present general techniques for upper and lower bounding the quantum communication necessary to perform blind quantum computation, and use these techniques to establish concrete bounds for common choices of the client's quantum capabilities. Our results show that the universal blind quantum computation protocol of Broadbent, Fitzsimons, and Kashefi, comes within a factor of 83 of optimal when the client is restricted to preparing single qubits. However, we describe a generalization of this protocol which requires exponentially less quantum communication when the client has a more sophisticated device. © 2013 American Physical Society.|
|Source Title:||Physical Review Letters|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 21, 2018
WEB OF SCIENCETM
checked on May 1, 2018
checked on May 18, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.