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:1809.00185

Gate Teleportation-based Universal Blind Quantum Computation

Xiaoqian Zhang

Published Sep 1, 2018• 0 citations
arXivHTMLPDF

Abstract

Blind quantum computation (BQC) allows that a client who has limited quantum abilities can delegate quantum computation to a server who has advanced quantum technologies but learns nothing about the client's private information. However, it still remains a challenge to directly encrypt quantum algorithms in circuits model. To solve the problem, we propose GTUBQC, the first gate teleportation-based universal BQC protocol. In this paper, we consider a scenario where a trusted center is responsible for preparing initial states, a client with the ability to perform X, Z does not require any quantum memory, and two servers conducting UBQC (universal BQC) and Bell measurements. GTUBQC can hide the universal quantum gates by encrypting the rotation angles, because arbitrary unitary operation can be decomposed into a combination of arbitrary rotation operators. We prove the blindness and correctness of GTUBQC, and apply our approach to other types of computational tasks, such as quantum Fourier transform.

DOI
10.48550/arxiv.1809.00185

Related papers

Blind quantum computation with hybrid model

Xiaodan Zeng, Xiaoqing Tan, Qingshan Xu +1 more

Blind quantum computation (BQC) allows a client who has a few quantum abilities to interact and delegate her quantum computation to a server that has strong quantum computabilities, while the server learns nothing about client’s quantum inputs, algorithms, and outputs. In this article, a new BQC protocol with hybrid model is proposed, using the combination of rotation operators to construct arbitrary quantum gate. Our BQC protocol is divided into two phases. In the first phase, a new kind of function operation is designed and defined, that is, the client sends the classical message [Formula: see text] to the server and then the sever performs a corresponding function operation [Formula: see text], which has been defined. In the second phase, a rotation operator or identity operator is implemented by quantum gate teleportation where the server can’t know which quantum gate has been teleported. Combining these two phases, the server has no idea about client’s quantum algorithms. When the server performs the corresponding operation honestly, the client only needs to perform [Formula: see text] and [Formula: see text] operators.

International Journal of Modern Physics B•Oct 27, 2020•3 citations

A Scheme for universal blind quantum computation

Mear M. R. Koochakie

Blind quantum computation (BQC) is a recent proposition in which a computation is performed on a server by a client in a manner that the server is kept blind about the input, the algorithm and the output of the computation. This model possesses a natural security, which makes it suitable for applications where privacy matters. In this paper we propose a framework for BQC which can be implemented by circuit models as well as measurement-based models of quantum computation. It is based on gate teleportation, a process in which by storing one-qubit gates in entangled pairs one can apply it later via teleportation. We elaborate on examples of such universal BQC (UBQC) protocols. Specially, we elaborate on UBQC for correlation-space measurement-based quantum computation.

•Nov 23, 2014•0 citations

Blind quantum computation for quantum Fourier transform on Bell states

Xiaoqian Zhang

It is called blind quantum computation(BQC) that a client who has limited quantum technologies can delegate her quantum computing to a server who has fully-advanced quantum computers. But the privacy of the client's quantum inputs, algorithms and outputs is still a challenge. To realize a secure BQC, we mainly study how to hide quantum fourier transform (QFT) performed on Bell states. In this paper, three cases are considered as follows. For the first case, we design primary BQC protocols of QFT performed on qubits 12 of belonging to $\{|ϕ^\pm\rangle_{12},$ $|ψ^\pm\rangle_{12}\}$ with relevant circuits. To strengthen security, we construct enhanced BQC protocols of QFT performed on qubits 13 of any two Bell states $|ξ\rangle_{12}\otimes|θ\rangle_{34}$ with relevant quantum circuits. Featured the property of stronger security, we give generalized BQC protocols of QFT performed on qubits 13 and 24 of any two Bell states with relevant quantum circuits respectively. At last, we analyze and prove the blindness and correctness.

arXiv:1712.08021•Dec 21, 2017•0 citations

Half-blind quantum computation with operation teleportation

Zhen Yang, Guang-Yang Wu, Ming-Qiang Bai

Abstract Blind quantum computation enables a client with limited quantum capabilities to delegate a powerful quantum computer for performing confidential quantum computation. This paper identifies a security loophole in the initial universal half-blind quantum computation protocol and resolves it using operation teleportation. Simultaneously, to minimize quantum resource consumption for both the client and the server, the proposed protocol relies on the universal gate set H, T, and CX, and only necessitates the client’s ability to prepare qubits in the eigenstates of Pauli gates X and Y or measure qubits based on these gates. Finally, a sample example is provided to illustrate the proposed protocol effectively.

Journal of Physics A Mathematical and Theoretical•Apr 12, 2024•1 citation

Verifiable blind quantum computation for two types of clients via iterated gate teleportation

Yuxun Wang, Qunfeng Dai, Qin Li

Blind quantum computation (BQC) provides a secure framework for clients to delegate quantum computations to servers without revealing their private information. Among BQC protocols, those built on iterated gate teleportation (IGTBQC) have demonstrated promising potential in overcoming the constraints imposed by the no-programming theorem and significantly reducing communication overhead. However, existing IGTBQC protocols lack mechanisms for clients to verify the correctness of computation results and deal with only one type of clients capable of preparing qubits. To address these limitations, we first extend the current IGTBQC protocol to be a verifiable one and then propose another verifiable IGTBQC protocol tailored for a different type of clients with the capability of measuring single-qubit states. Furthermore, both protocols are shown to satisfy blindness and verification simultaneously in a relatively formal way. Our results not only broaden the applicability to a wider range of clients but also enhance the practicality of delegated quantum computation.

Physical Review A•Aug 5, 2025•1 citation

Blind quantum computation for QFT on multi-qubit states

Xiaoqian Zhang

After quantum computers come out, governments and rich companies will have the abilities to buy these useful quantum computers, meanwhile they are familiar with these technologies proficiently. If a client wants to perform quantum computing but she does not have quantum computers with relevant quantum technologies. She can seek help from the server and pay his salary, but she does not want to leak anything to the server. Blind quantum computing (BQC) give a good method for the client to realized her quantum computing. In this article, we propose a new BQC protocol of quantum fourier transform (QFT) performed on multi-qubit states with a trusted, a client and a server, where the trusted center can generate resource states, the client can delegate her quantum computing to a server who can perform universal quantum computing without knowing anything about the client's inputs, algorithms and outputs. We first give the BQC protocols of three-qubit QFT with the equivalently quantum circuits, Greenberg-Horne-Zeilinger(GHZ) entangled states and W entangled states as examples. Further, we extend them to multi-qubit QFT on multi-qubit with the equivalently quantum circuits. At last, we give the analyses and proofs of the blindness and correctness.

arXiv:1801.00080•Dec 30, 2017•0 citations
Blind quantum computation (BQC) allows that a client who has limited quantum abilities can delegate quantum computation to a server who has advanced quantum technologies but learns nothing about the client's private information. However, it still remains a challenge to directly encrypt quantum algorithms in circuits model. To solve the problem, we propose GTUBQC, the first gate teleportation-based universal BQC protocol. In this paper, we consider a scenario where a trusted center is responsible for preparing initial states, a client with the ability to perform X, Z does not require any quantum memory, and two servers conducting UBQC (universal BQC) and Bell measurements. GTUBQC can hide the universal quantum gates by encrypting the rotation angles, because arbitrary unitary operation can be decomposed into a combination of arbitrary rotation operators. We prove the blindness and correctness of GTUBQC, and apply our approach to other types of computational tasks, such as quantum Fourier transform.
Blind quantum computation (BQC) allows a client who has a few quantum abilities to interact and delegate her quantum computation to a server that has strong quantum computabilities, while the server learns nothing about client’s quantum inputs, algorithms, and outputs. In this article, a new BQC protocol with hybrid model is proposed, using the combination of rotation operators to construct arbitrary quantum gate. Our BQC protocol is divided into two phases. In the first phase, a new kind of function operation is designed and defined, that is, the client sends the classical message [Formula: see text] to the server and then the sever performs a corresponding function operation [Formula: see text], which has been defined. In the second phase, a rotation operator or identity operator is implemented by quantum gate teleportation where the server can’t know which quantum gate has been teleported. Combining these two phases, the server has no idea about client’s quantum algorithms. When the server performs the corresponding operation honestly, the client only needs to perform [Formula: see text] and [Formula: see text] operators.
Blind quantum computation (BQC) is a recent proposition in which a computation is performed on a server by a client in a manner that the server is kept blind about the input, the algorithm and the output of the computation. This model possesses a natural security, which makes it suitable for applications where privacy matters. In this paper we propose a framework for BQC which can be implemented by circuit models as well as measurement-based models of quantum computation. It is based on gate teleportation, a process in which by storing one-qubit gates in entangled pairs one can apply it later via teleportation. We elaborate on examples of such universal BQC (UBQC) protocols. Specially, we elaborate on UBQC for correlation-space measurement-based quantum computation.
It is called blind quantum computation(BQC) that a client who has limited quantum technologies can delegate her quantum computing to a server who has fully-advanced quantum computers. But the privacy of the client's quantum inputs, algorithms and outputs is still a challenge. To realize a secure BQC, we mainly study how to hide quantum fourier transform (QFT) performed on Bell states. In this paper, three cases are considered as follows. For the first case, we design primary BQC protocols of QFT performed on qubits 12 of belonging to {∣ϕ±⟩12,\{|ϕ^\pm\rangle_{12},{∣ϕ±⟩12​, ∣ψ±⟩12}|ψ^\pm\rangle_{12}\}∣ψ±⟩12​} with relevant circuits. To strengthen security, we construct enhanced BQC protocols of QFT performed on qubits 13 of any two Bell states ∣ξ⟩12⊗∣θ⟩34|ξ\rangle_{12}\otimes|θ\rangle_{34}∣ξ⟩12​⊗∣θ⟩34​ with relevant quantum circuits. Featured the property of stronger security, we give generalized BQC protocols of QFT performed on qubits 13 and 24 of any two Bell states with relevant quantum circuits respectively. At last, we analyze and prove the blindness and correctness.
Abstract Blind quantum computation enables a client with limited quantum capabilities to delegate a powerful quantum computer for performing confidential quantum computation. This paper identifies a security loophole in the initial universal half-blind quantum computation protocol and resolves it using operation teleportation. Simultaneously, to minimize quantum resource consumption for both the client and the server, the proposed protocol relies on the universal gate set H, T, and CX, and only necessitates the client’s ability to prepare qubits in the eigenstates of Pauli gates X and Y or measure qubits based on these gates. Finally, a sample example is provided to illustrate the proposed protocol effectively.
Blind quantum computation (BQC) provides a secure framework for clients to delegate quantum computations to servers without revealing their private information. Among BQC protocols, those built on iterated gate teleportation (IGTBQC) have demonstrated promising potential in overcoming the constraints imposed by the no-programming theorem and significantly reducing communication overhead. However, existing IGTBQC protocols lack mechanisms for clients to verify the correctness of computation results and deal with only one type of clients capable of preparing qubits. To address these limitations, we first extend the current IGTBQC protocol to be a verifiable one and then propose another verifiable IGTBQC protocol tailored for a different type of clients with the capability of measuring single-qubit states. Furthermore, both protocols are shown to satisfy blindness and verification simultaneously in a relatively formal way. Our results not only broaden the applicability to a wider range of clients but also enhance the practicality of delegated quantum computation.
After quantum computers come out, governments and rich companies will have the abilities to buy these useful quantum computers, meanwhile they are familiar with these technologies proficiently. If a client wants to perform quantum computing but she does not have quantum computers with relevant quantum technologies. She can seek help from the server and pay his salary, but she does not want to leak anything to the server. Blind quantum computing (BQC) give a good method for the client to realized her quantum computing. In this article, we propose a new BQC protocol of quantum fourier transform (QFT) performed on multi-qubit states with a trusted, a client and a server, where the trusted center can generate resource states, the client can delegate her quantum computing to a server who can perform universal quantum computing without knowing anything about the client's inputs, algorithms and outputs. We first give the BQC protocols of three-qubit QFT with the equivalently quantum circuits, Greenberg-Horne-Zeilinger(GHZ) entangled states and W entangled states as examples. Further, we extend them to multi-qubit QFT on multi-qubit with the equivalently quantum circuits. At last, we give the analyses and proofs of the blindness and correctness.