arXiv:1208.0442 · Physical Review Letters

Continuous-Variable Blind Quantum Computation

Tomoyuki Morimae

Published Dec 5, 2012• 72 citations

Abstract

Blind quantum computation is a secure delegated quantum computing protocol where Alice, who does not have sufficient quantum technology at her disposal, delegates her computation to Bob, who has a fully fledged quantum computer, in such a way that Bob cannot learn anything about Alice's input, output, and algorithm. Protocols of blind quantum computation have been proposed for several qudit measurement-based computation models, such as the graph state model, the Affleck-Kennedy-Lieb-Tasaki model, and the Raussendorf-Harrington-Goyal topological model. Here, we consider blind quantum computation for the continuous-variable measurement-based model. We show that blind quantum computation is possible for the infinite squeezing case. We also show that the finite squeezing causes no additional problem in the blind setup apart from the one inherent to the continuous-variable measurement-based quantum computation.

DOI: 10.1103/physrevlett.109.230502

Related papers

Blind topological measurement-based quantum computation

Tomoyuki Morimae, Keisuke Fujii

Blind quantum computation is a novel secure quantum-computing protocol that enables Alice, who does not have sufficient quantum technology at her disposal, to delegate her quantum computation to Bob, who has a fully fledged quantum computer, in such a way that Bob cannot learn anything about Alice's input, output and algorithm. A recent proof-of-principle experiment demonstrating blind quantum computation in an optical system has raised new challenges regarding the scalability of blind quantum computation in realistic noisy conditions. Here we show that fault-tolerant blind quantum computation is possible in a topologically protected manner using the Raussendorf–Harrington–Goyal scheme. The error threshold of our scheme is 4.3×10−3, which is comparable to that (7.5×10−3) of non-blind topological quantum computation. As the error per gate of the order 10−3 was already achieved in some experimental systems, our result implies that secure cloud quantum computation is within reach. Blind quantum computation is a protocol that permits an algorithm, its input and output to be kept secret from the owner of the computational resource doing the calculation. Morimae and Fujii propose a strategy for topologically protected fault-tolerant blind quantum computation that is robust to environmental noise.

arXiv:1110.5460Nature CommunicationsSep 4, 2012127 citations

Blind quantum computation protocol in which Alice only makes measurements

Tomoyuki Morimae, Keisuke Fujii

Blind quantum computation is a new secure quantum computing protocol which enables Alice (who does not have sufficient quantum technology) to delegate her quantum computation to Bob (who has a full-fledged quantum computer) in such a way that Bob cannot learn anything about Alice's input, output, and algorithm. In previous protocols, Alice needs to have a device which generates quantum states, such as single-photon states. Here we propose another type of blind computing protocol where Alice does only measurements, such as the polarization measurements with a threshold detector. In several experimental setups, such as optical systems, the measurement of a state is much easier than the generation of a single-qubit state. Therefore our protocols ease Alice's burden. Furthermore, the security of our protocol is based on the no-signaling principle, which is more fundamental than quantum physics. Finally, our protocols are device independent in the sense that Alice does not need to trust her measurement device in order to guarantee the security.

arXiv:1201.3966Physical Review AMay 13, 2013186 citations

Ancilla-driven universal blind quantum computation

Takahiro Sueki, Takeshi Koshiba, Tomoyuki Morimae

Blind quantum computation is a new quantum secure protocol, which enables Alice who does not have enough quantum technology to delegate her computation to Bob who has a fully fledged quantum power without revealing her input, output, and algorithm. So far, blind quantum computation has been considered only for the circuit model and the measurement-based model. Here we consider the possibility and the limitation of blind quantum computation in the ancilla-driven model, which is a hybrid of the circuit and the measurement-based models.

arXiv:1210.7450Physical Review AJun 6, 201376 citations

Secure Entanglement Distillation for Double-Server Blind Quantum Computation

Tomoyuki Morimae, Keisuke Fujii

Blind quantum computation is a new secure quantum computing protocol where a client, who does not have enough quantum technologies at her disposal, can delegate her quantum computation to a server, who has a fully fledged quantum computer, in such a way that the server cannot learn anything about the client's input, output, and program. If the client interacts with only a single server, the client has to have some minimum quantum power, such as the ability of emitting randomly rotated single-qubit states or the ability of measuring states. If the client interacts with two servers who share Bell pairs but cannot communicate with each other, the client can be completely classical. For such a double-server scheme, two servers have to share clean Bell pairs, and therefore the entanglement distillation is necessary in a realistic noisy environment. In this Letter, we show that it is possible to perform entanglement distillation in the double-server scheme without degrading the security of blind quantum computing.

arXiv:1302.3786Physical Review LettersJul 9, 201374 citations

Measurement-only verifiable blind quantum computing with quantum input verification

Tomoyuki Morimae

Verifiable blind quantum computing is a secure delegated quantum computing where a client with a limited quantum technology delegates her quantum computing to a server who has a universal quantum computer. The client's privacy is protected (blindness), and the correctness of the computation is verifiable by the client despite her limited quantum technology (verifiability). There are mainly two types of protocols for verifiable blind quantum computing: the protocol where the client has only to generate single-qubit states and the protocol where the client needs only the ability of single-qubit measurements. The latter is called the measurement-only verifiable blind quantum computing. If the input of the client's quantum computing is a quantum state, whose classical efficient description is not known to the client, there was no way for the measurement-only client to verify the correctness of the input. Here we introduce a protocol of measurement-only verifiable blind quantum computing where the correctness of the quantum input is also verifiable.

arXiv:1606.06467Physical Review AOct 3, 201635 citations

A three-party verifiable blind quantum computing protocol with separated input and function ownership

Yinqi Feng, Ri‐Gui Zhou, Ran Guo +2 more

Abstract Blind quantum computing enables quantum-limited clients to securely access untrusted quantum servers. This paper proposes a three-party verifiable blind quantum computing protocol with separated input and function ownership, where Alice holds the private input, Bob holds the target function, and Charlie performs the delegated quantum computation, with the result released only to Alice. Alice and Bob first establish a shared key using BB84. Under the measurement-based quantum computing framework, a secure two-party computation protocol is then used to jointly generate adaptive blinded measurement instructions, eliminating the need for Bob to transmit quantum states to Charlie. A hidden dummy-trap mechanism is further incorporated to verify malicious server behavior. Under the honest-but-curious client model without client-server collusion, the protocol protects input and function privacy while ensuring computation blindness, shared-key security, and verifiability. Most quantum operations are performed by Charlie, while the clients require only limited quantum capabilities.

Physica ScriptaAug 28, 20260 citations