Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2106.05547 · Quantum Information Processing

Equivalence of single-server and multiple-server blind quantum computation protocols

Yuichi Sano

Published Jan 18, 2023• 0 citations
arXivHTMLPDF
DOI
10.1007/s11128-022-03812-2

Related papers

Multi-server blind quantum computation protocol with limited classical communication among servers

Yuichi Sano

arXiv:2106.05537•Quantum Information Processing•Feb 18, 2022•4 citations

Multiple-server Flexible Blind Quantum Computation in Networks

Xiaoqin Kong, Qin Li, Chunhui Wu +3 more

International Journal of Theoretical Physics•Feb 11, 2016•15 citations

Single-server blind quantum computation with quantum circuit model

Xiaoqian Zhang, Jian Weng, Xiaochun Li +3 more

Quantum Information Processing•Apr 25, 2018•27 citations

Comparison on security of single server and multiple servers blind quantum protocols

Yuichi Sano

A user who delegates quantum computation to others hopes to keep information on the computation secret. Several different blind quantum computation protocols which attain this goal have been proposed thus far. While in single server protocols a user needs to manipulate quantum states, multiple server protocols do not require a user to have any quantum equipment although they prohibit any communication among servers even after the computation. It is not a straightforward task for a user to decide the most proper protocol among them as each protocol has its own merits and defects. In this paper we introduce a notion called usability which enables us to compare the different protocols. In particular we consider a blind protocol with multiple servers which allows classical communication during and after the computation, and compare it with a single server protocol. As a result we find that their usability are partially equal to each other.

•Jun 10, 2021•0 citations

On the Security of Two Blind Quantum Computations

Shih-Min Hung, Tzonelih Hwang

Blind quantum computation (BQC) protocol allows a client having partial quantum ability to delegate his quantum computation to a remote quantum server without leaking any information about the input, the output and the intended computation to the server. Several BQC protocols have been proposed, e.g., Li et al. in [1] proposed a triple-server BQC protocol and Xu et al. in [2] proposed a single-server BQC protocol. Though both papers claimed that their protocols can satisfy the requirement of privacy, this paper points out a security loophole in their protocols. With that the server can reveal the private information of the client.

arXiv:1508.07478•Aug 29, 2015•2 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.7054•Laser Physics Letters•Nov 25, 2021•9 citations
A user who delegates quantum computation to others hopes to keep information on the computation secret. Several different blind quantum computation protocols which attain this goal have been proposed thus far. While in single server protocols a user needs to manipulate quantum states, multiple server protocols do not require a user to have any quantum equipment although they prohibit any communication among servers even after the computation. It is not a straightforward task for a user to decide the most proper protocol among them as each protocol has its own merits and defects. In this paper we introduce a notion called usability which enables us to compare the different protocols. In particular we consider a blind protocol with multiple servers which allows classical communication during and after the computation, and compare it with a single server protocol. As a result we find that their usability are partially equal to each other.
Blind quantum computation (BQC) protocol allows a client having partial quantum ability to delegate his quantum computation to a remote quantum server without leaking any information about the input, the output and the intended computation to the server. Several BQC protocols have been proposed, e.g., Li et al. in [1] proposed a triple-server BQC protocol and Xu et al. in [2] proposed a single-server BQC protocol. Though both papers claimed that their protocols can satisfy the requirement of privacy, this paper points out a security loophole in their protocols. With that the server can reveal the private information of the client.
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.