Indian Institute of Science Education and Research (IISER) Mohali, Knowledge City, SAS Nagar, Sector 81, Manauli PO 140 306, Punjab, India and Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543.
Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 and Singapore University of Technology and Design, 20 Dover Drive, Singapore 138682.
Phys Rev Lett. 2013 Dec 6;111(23):230502. doi: 10.1103/PhysRevLett.111.230502. Epub 2013 Dec 3.
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 8/3 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.
盲量子计算允许具有有限量子能力的客户端与远程量子计算机进行交互，以执行任意量子计算，同时保持计算的描述对远程量子计算机隐藏。虽然近年来已经提出了许多协议，但对于完成任务所需的资源目前了解甚少。在这里，我们提出了用于上界和下界的一般技术盲量子计算所需的量子通信，并使用这些技术为客户端的量子能力的常见选择建立具体的界限。我们的结果表明，当客户端仅限于准备单量子位时，Broadbent、Fitzsimons 和 Kashefi 的通用盲量子计算协议的接近最优的 8/3 倍。然而，当客户端具有更复杂的设备时，我们描述了该协议的一个推广，该协议需要的量子通信要少得多。
