Experimental Blind Quantum Computing for a Classical Client

2017/07/03 by He-Liang Huang, Qi Zhao, Xiongfeng Ma +8 · 1 citation
Physics and Astronomy · #quant-ph

paper · pdf · doi:10.1103/physrevlett.119.050503

published as Phys. Rev. Lett. 119, 050503 (2017) · Accepted for publication in Phys. Rev. Lett

arxiv created 2017/07/03 · arxiv updated 2017/08/09

Abstract

To date, blind quantum computing demonstrations require clients to have weak quantum devices. Here we implement a proof-of-principle experiment for completely classical clients. Via classically interacting with two quantum servers that share entanglement, the client accomplishes the task of having the number 15 factorized by servers who are denied information about the computation itself. This concealment is accompanied by a verification protocol that tests servers' honesty and correctness. Our demonstration shows the feasibility of completely classical clients and thus is a key milestone towards secure cloud quantum computing.

Cited by

• Blind Quantum Computation on a Modular Superconducting Processor

Related

• Experimental Demonstration of Blind Quantum Computing
• Universal Blind Quantum Computation
• Blind quantum computing with two almost identical states
• Universal Blind and Verifiable Delegated Quantum Computation with Classical Clients
• Implementation of classical client universal blind quantum computation with 8-state RSP in current architecture