2011/08/31 by Vedran Dunjko, Elham Kashefi, Anthony Leverrier · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Computer science #Mathematics #Physics #Protocol (science) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum computer #Quantum cryptography #Quantum information #Quantum mechanics #Quantum optics and atomic interactions #Qubit #Theoretical computer science #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.1103/physrevlett.108.200502
published as Phys. Rev. Lett. 108, 200502 (2012) · 16 pages, 1 figure
arxiv created 2012/05/16 · openalex publication_date 2012/05/18 · arxiv updated 2012/06/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
The universal blind quantum computation (UBQC) protocol [A. Broadbent, J. Fitzsimons, and E. Kashefi, in Proceedings of the 50th Annual IEEE Symposiumon Foundations of Computer Science (IEEE Computer Society, Los Alamitos, CA, USA, 2009), pp. 517-526.] allows a client to perform quantum computation on a remote server. In an ideal setting, perfect privacy is guaranteed if the client is capable of producing specific, randomly chosen single qubit states. While from a theoretical point of view, this may constitute the lowest possible quantum requirement, from a pragmatic point of view, generation of such states to be sent along long distances can never be achieved perfectly. We introduce the concept of ϵ blindness for UBQC, in analogy to the concept of ϵ security developed for other cryptographic protocols, allowing us to characterize the robustness and security properties of the protocol under possible imperfections. We also present a remote blind single qubit preparation protocol with weak coherent pulses for the client to prepare, in a delegated fashion, quantum states arbitrarily close to perfect random single qubit states. This allows us to efficiently achieve ϵ-blind UBQC for any ϵ>0, even if the channel between the client and the server is arbitrarily lossy.