arXiv:1609.08902 · Physical Review A

Blind quantum computation with a noise channel

Yu‐Bo Sheng, Lan Zhou

Published Nov 27, 2018• 69 citations

Abstract

Blind quantum computation (BQC) is a type of quantum computation model. For a client (Alice) who does not have enough sophisticated technology and knowledge to perform universal quantum computation, BQC allows her to resort to a remote quantum computation server (Bob) to delegate universal quantum computation. During the computation, Bob cannot know Alice's inputs, algorithm, and outputs. A single-server BQC protocol requires Alice to prepare and distribute single-photon states to Bob. Unfortunately, the distributed single photons will suffer from noise. The noise not only leads to the decoherence of the single-photon state, but also leads to photon loss. In this protocol, we describe an antinoise single-server BQC protocol. This protocol has three advantages. First, Alice does not require any auxiliary resources, which reduces the client's economic cost. Second, this protocol not only can protect the state from the collective noise, but also can distill the single photon from photon loss. Third, the noise processer in Bob is based on the linear optics so that it is feasible in experiment. This protocol may show that it is possible to perform a single-server BQC protocol in a noise channel.

DOI: 10.1103/physreva.98.052343

Related papers

Blind quantum computation over a collective-noise channel

Yuki Takeuchi, Keisuke Fujii, Rikizo Ikuta +2 more

Blind quantum computation (BQC) allows a client (Alice), who only possesses relatively poor quantum devices, to delegate universal quantum computation to a server (Bob) in such a way that Bob cannot know Alice's inputs, algorithm, and outputs. The quantum channel between Alice and Bob is noisy, and the loss over the long-distance quantum communication should also be taken into account. Here we propose to use decoherence-free subspace (DFS) to overcome the collective noise in the quantum channel for BQC, which we call DFS-BQC. We propose three variations of DFS-BQC protocols. One of them, a coherent-light-assisted DFS-BQC protocol, allows Alice to faithfully send the signal photons with a probability proportional to a transmission rate of the quantum channel. In all cases, we combine the ideas based on DFS and the Broadbent-Fitzsimons-Kashefi protocol, which is one of the BQC protocols, without degrading unconditional security. The proposed DFS-based schemes are generic and hence can be applied to other BQC protocols where Alice sends quantum states to Bob.

arXiv:1505.04248Physical Review AMay 4, 201647 citations

Universal single-server blind quantum computation for classical clients

Hai-Ru Xu, Bang-Hai Wang

Abstract Blind quantum computation (BQC) allows a client without enough quantum technologies to delegate her quantum computation to a remote quantum server, while keeping her input, output and algorithm secure. In this paper, we propose a universal single-server and almost-classical-client BQC protocol. In this protocol, the client interfaces with only one server and the only ability of the client required is to get particles from the trusted center and forward them to the server. We present an analysis of this protocol and modify it to a universal single-server and fully-classical-client BQC protocol by improving the ability of the trusted center. Based on our protocols and recent works, a new ‘Cloud + Certificate Authority (CA)’ style is proposed for the BQC.

arXiv:1410.7054Laser Physics LettersNov 25, 20219 citations

Blind quantum computation with completely classical client and a trusted center

Min Liang

Blind quantum computation (BQC) enables a client without enough quantum power to delegate his quantum computation to a quantum server, while keeping the input data, the algorithm and the result unknown to the server. In the studies of practical BQC protocol, an important problem is how to reduce the quantum requirement of the client. Multi-server BQC protocols have been proposed to solve this problem. We review the double-server and triple-server protocols [Li et al., Phys. Rev. A 89, 040302(R) (2014)], and propose a modified double-server BQC protocol with a trusted center. In our protocol, the servers are allowed to communicate mutually, and the client is completely classical. Furthermore, our double-server protocol can be modified into a single-server protocol by simply combining the two servers. Compared with the triple-server protocol, our double-server and single-server protocols are more simple and the client is not required to have the ability to access quantum channel. So our protocols are more practical when quantum computer is applied in the `cloud' model.

arXiv:1508.07778Aug 31, 20151 citation

Deterministic entanglement distillation for secure double-server blind quantum computation

Yu‐Bo Sheng, Lan Zhou

Blind quantum computation (BQC) provides an efficient method for the client who does not have enough sophisticated technology and knowledge to perform universal quantum computation. The single-server BQC protocol requires the client to have some minimum quantum ability, while the double-server BQC protocol makes the client's device completely classical, resorting to the pure and clean Bell state shared by two servers. Here, we provide a deterministic entanglement distillation protocol in a practical noisy environment for the double-server BQC protocol. This protocol can get the pure maximally entangled Bell state. The success probability can reach 100% in principle. The distilled maximally entangled states can be remaind to perform the BQC protocol subsequently. The parties who perform the distillation protocol do not need to exchange the classical information and they learn nothing from the client. It makes this protocol unconditionally secure and suitable for the future BQC protocol.

Scientific ReportsJan 15, 2015158 citations

Verifiable blind quantum computation over collective-noise

Yuan-Mao Luo, Zhen Yang, Guang-Yang Wu +2 more

Abstract Blind quantum computation(BQC) is a new type of secure quantum computation. In the natural environment, the qubits used in BQC will inevitably be affected by the noise, and the client cannot guarantee the correctness of computational results when the server is dishonest. This paper proposes a verifiable BQC over collective-noise based on quantum error correction to solve these two problems. Furthermore, the proposed protocol needs to expand Alice’s quantum capabilities. The client makes single-qubit measurements on the qubits, encoded and transmitted by the server. As a result, they protect qubits used to compute and utilize single-qubits to verify.

Physica ScriptaApr 16, 20243 citations

Deterministic entanglement distillation for secure double-server blind quantum computation

Zhou, Lan, Yu‐Bo Sheng

Blind quantum computation (BQC) provides an efficient method for the client who does not have enough sophisticated technology and knowledge to perform universal quantum computation. The single-server BQC protocol requires the client to have some minimum quantum ability, while the double-server BQC protocol makes the client's device completely classical, resorting to the pure and clean Bell-state shared by two servers. In this paper, we provide a deterministic entanglement distillation protocol in a practical noisy environment for the double-server BQC protocol. This protocol can obtain the pure maximally entangled Bell state with the success probability of 100% in principle. The distilled maximally entangled states can be remaind to perform the BQC protocol subsequently. The parties who perform the distillation protocol do not need to exchange the classical information and they learn nothing from the client. It makes this protocol unconditionally secure and suitable for current BQC protocol.

arXiv:1311.2263Nov 10, 20130 citations