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

IEEE International Conference on Information, Communication and Networks (ICICN)

Blind Quantum Computation Using Single Qubit Gates

Zheng Xing, Penousal Machado, Chan–Tong Lam

Published Aug 23, 2022• 1 citation
Publisher

Abstract

Blind Quantum Computation (BQC) allows a user with limited quantum capabilities to collaborate with a powerful quantum server to complete the users' computational duties while keeping private data hidden. Two sorts of BQC protocols that deserve to be recognized from the user's perspective exist. In the single server mode, from the perspective of users' quantum ability, one type is the quantum state preparation based models only rquire the user to prepare single quantum state. Another type is quantum measurement based model, such as Morimae's BQC model where the user just requires single quantum state measurement capability. In this paper, we provide a novel BQC model, and based on this model, we create a BQC protocol which only requires the user to construct two single quantum bit gates to get desired result. The results indicate that the model we propose is valid.

DOI
10.1109/icicn56848.2022.10006445

Related papers

Blind quantum computation with a client performing different single-qubit gates

Guang-Yang Wu, Zhen 振 Yang 杨, Yu-Zhan Yan +3 more

In the field of single-server blind quantum computation (BQC), a major focus is to make the client as classical as possible. To achieve this goal, we propose two single-server BQC protocols to achieve verifiable universal quantum computation. In these two protocols, the client only needs to perform either the gate T (in the first protocol) or the gates H and X (in the second protocol). With assistance from a single server, the client can utilize his quantum capabilities to generate some single-qubit states while keeping the actual state of these qubits confidential from others. By using these single-qubit states, the verifiable universal quantum computation can be achieved.

Chinese Physics B•Jun 25, 2023•1 citation

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.07778•Aug 31, 2015•1 citation

Ancilla-driven blind quantum computation for clients with different quantum capabilities

Qunfeng Dai, Junyu Quan, Xiaoping Lou +1 more

Abstract Blind quantum computation (BQC) allows a client with limited quantum power to delegate his quantum computational task to a powerful server and still keep his input, output, and algorithm private. There are mainly two kinds of models about BQC, namely circuit-based and measurement-based models. In addition, a hybrid model called ancilla-driven universal blind quantum computation (ADBQC) was proposed by combining the properties of both circuit-based and measurement-based models, where all unitary operations on the register qubits can be realized with the aid of single ancilla coupled to the register qubits. However, in the ADBQC model, the quantum capability of the client is strictly limited to preparing single qubits. If a client can only perform single-qubit measurements or a few simple quantum gates, he will not be able to perform ADBQC. This paper solves the problem and extends the existing model by proposing two types of ADBQC protocols for clients with different quantum capabilities, such as performing single-qubit measurements or single-qubit gates. Furthermore, in the two proposed ADBQC protocols, clients can detect whether servers are honest or not with a high probability by using corresponding verifiable techniques.

arXiv:2210.09878•EPJ Quantum Technology•May 23, 2023•5 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•4 citations

Verifiable single client-server Blind Quantum Computation based on measurement

Xiaoqian Zhang, Jian Weng, Weiqi Luo +1 more

The characteristics of BQC is that it enables a client with less quantum abilities to delegate her quantum computation to a server with strong quantum computablities while keeping the client's privacy. In this article, we study single client-server BQC based on measurement which is verifiable. In detail, the verifiability is that the client Alice can obtain the correct measurement results if the server Bob is honest, while Bob does not get nothing of Alice's secret information if he is malicious. We construct a latticed state, composed of six-qubit cluster states and eight-qubit entangled states, to realize Alice's quantum computing. In this proposed protocol, the cilent Alice prepares and sends initial single-qubit states to Bob, where the initial states include useful qubits and trap qubits. And then Bob performs controlled-Z gate to produce the entanglement and returns them to Alice. Alice will send trap qubits and useful qubits to Bob randomly and Bob returns all measurement results to her. Alice makes a comparison for trap qubits between true results and Bob's results to check the honesty of Bob. In a word, the trap qubtis have two purposes: 1) confusing Bob to keep the blindness; 2)verifying the honesty of Bob and correctness of Bob's quantum computing. There has an important feature that Alice does not need to encrypt the computing angles by $r\pi$ (r$\in\{0,1\}$), meanwhile the blindness and correctness can also be ensured. That is, Alice's computing results don't need to flipped since Bob is not impossible know anything about the quantum computation. Our work gives a better understanding for verifiable BQC based on measurement.

•Jan 10, 2018•0 citations

Verifiable Blind Quantum Computation With Identity Authentication for Multi-Type Clients

Junyu Quan, Qin Li, Lvzhou Li

Blind quantum computation (BQC) provides a solution for clients with limited quantum capabilities to delegate their quantum computational tasks to remote quantum servers while keeping their own data private. In this paper, we first propose three multi-party verifiable blind quantum computation (MPVBQC) protocols, each of which can handle one type of clients with certain simple quantum capabilities such as making single-qubit measurements, preparing single qubits, or performing a few single-qubit gates. Then a flexible and hybrid MPVBQC framework for multi-type clients in quantum networks is given by combining the three proposed MPVBQC protocols. It simultaneously allows at least three types of clients in quantum networks to achieve BQC depending on their own quantum devices. Furthermore, all the proposed protocols can achieve identity authentication, resist both insider and outsider attacks, and be verifiable which means that the clients can verify the correctness of their computational results.

arXiv:2210.09830•IEEE Transactions on Information Forensics and Security•Dec 7, 2023•18 citations
Blind Quantum Computation (BQC) allows a user with limited quantum capabilities to collaborate with a powerful quantum server to complete the users' computational duties while keeping private data hidden. Two sorts of BQC protocols that deserve to be recognized from the user's perspective exist. In the single server mode, from the perspective of users' quantum ability, one type is the quantum state preparation based models only rquire the user to prepare single quantum state. Another type is quantum measurement based model, such as Morimae's BQC model where the user just requires single quantum state measurement capability. In this paper, we provide a novel BQC model, and based on this model, we create a BQC protocol which only requires the user to construct two single quantum bit gates to get desired result. The results indicate that the model we propose is valid.
In the field of single-server blind quantum computation (BQC), a major focus is to make the client as classical as possible. To achieve this goal, we propose two single-server BQC protocols to achieve verifiable universal quantum computation. In these two protocols, the client only needs to perform either the gate T (in the first protocol) or the gates H and X (in the second protocol). With assistance from a single server, the client can utilize his quantum capabilities to generate some single-qubit states while keeping the actual state of these qubits confidential from others. By using these single-qubit states, the verifiable universal quantum computation can be achieved.
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.
Abstract Blind quantum computation (BQC) allows a client with limited quantum power to delegate his quantum computational task to a powerful server and still keep his input, output, and algorithm private. There are mainly two kinds of models about BQC, namely circuit-based and measurement-based models. In addition, a hybrid model called ancilla-driven universal blind quantum computation (ADBQC) was proposed by combining the properties of both circuit-based and measurement-based models, where all unitary operations on the register qubits can be realized with the aid of single ancilla coupled to the register qubits. However, in the ADBQC model, the quantum capability of the client is strictly limited to preparing single qubits. If a client can only perform single-qubit measurements or a few simple quantum gates, he will not be able to perform ADBQC. This paper solves the problem and extends the existing model by proposing two types of ADBQC protocols for clients with different quantum capabilities, such as performing single-qubit measurements or single-qubit gates. Furthermore, in the two proposed ADBQC protocols, clients can detect whether servers are honest or not with a high probability by using corresponding verifiable techniques.
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.
The characteristics of BQC is that it enables a client with less quantum abilities to delegate her quantum computation to a server with strong quantum computablities while keeping the client's privacy. In this article, we study single client-server BQC based on measurement which is verifiable. In detail, the verifiability is that the client Alice can obtain the correct measurement results if the server Bob is honest, while Bob does not get nothing of Alice's secret information if he is malicious. We construct a latticed state, composed of six-qubit cluster states and eight-qubit entangled states, to realize Alice's quantum computing. In this proposed protocol, the cilent Alice prepares and sends initial single-qubit states to Bob, where the initial states include useful qubits and trap qubits. And then Bob performs controlled-Z gate to produce the entanglement and returns them to Alice. Alice will send trap qubits and useful qubits to Bob randomly and Bob returns all measurement results to her. Alice makes a comparison for trap qubits between true results and Bob's results to check the honesty of Bob. In a word, the trap qubtis have two purposes: 1) confusing Bob to keep the blindness; 2)verifying the honesty of Bob and correctness of Bob's quantum computing. There has an important feature that Alice does not need to encrypt the computing angles by rπr\pirπ (r∈{0,1}\in\{0,1\}∈{0,1}), meanwhile the blindness and correctness can also be ensured. That is, Alice's computing results don't need to flipped since Bob is not impossible know anything about the quantum computation. Our work gives a better understanding for verifiable BQC based on measurement.
Blind quantum computation (BQC) provides a solution for clients with limited quantum capabilities to delegate their quantum computational tasks to remote quantum servers while keeping their own data private. In this paper, we first propose three multi-party verifiable blind quantum computation (MPVBQC) protocols, each of which can handle one type of clients with certain simple quantum capabilities such as making single-qubit measurements, preparing single qubits, or performing a few single-qubit gates. Then a flexible and hybrid MPVBQC framework for multi-type clients in quantum networks is given by combining the three proposed MPVBQC protocols. It simultaneously allows at least three types of clients in quantum networks to achieve BQC depending on their own quantum devices. Furthermore, all the proposed protocols can achieve identity authentication, resist both insider and outsider attacks, and be verifiable which means that the clients can verify the correctness of their computational results.