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

International Journal of Theoretical Physics

Application of Blind Quantum Computation to Two-Party Quantum Computation

Zhiyuan Sun, Qin Li, Fang Yu, Wai Hong Chan

Published Mar 13, 2018• 8 citations
Publisher
DOI
10.1007/s10773-018-3711-9

Related papers

Secure Two-Party Computation Based on Blind Quantum Computation

Yaqing Zhu, Qin Li, Chengdong Liu +3 more

International Journal of Theoretical Physics•May 6, 2020•2 citations

Secure Multi-Party Quantum Computation Based on Blind Quantum Computation

Gui-Ju Qu, Ming‐Ming Wang

International Journal of Theoretical Physics•Jul 12, 2021•9 citations

Secure Multi-Party Computation Based on Blind Quantum Computing

Yongli Wang, Tianci Cao, Yixin Wang +3 more

Abstract Blind Quantum Computing (BQC) is a protocol proposed in recent years to tackle the practical need where users want to perform quantum computing tasks but lack the necessary capabilities, and thus delegate the work to quantum computing platforms while keeping their data secure throughout the process. Besides, its characteristics provide new ways for secure multi-party computation, helping multiple untrusted users to compute together securely. Most existing secure multi-party computation protocol based on blind quantum computing rely on DT(G) states to perform joint computation. However, this can lead to security risks because one client has too much authority, and these schemes also lack generality. In this paper, a secure multi-party computation protocol is proposed based on brickwork states. By exploiting and optimizing the properties of these states, the security issues in joint client computation are solved and centralized authority is avoided. Meanwhile, it reflects the interactive mode in multi-party computation. The proposed protocol effectively improves the generality of computation.

•May 13, 2026•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.

IEEE Transactions on Information Forensics and Security•Dec 7, 2023•18 citations

Blind Grover Search for Gate-based Quantum Computers

Alexander Sauer, Alexander von Consbruch, Matthias Zimmermann

hile quantum computers might offer several computational benefits, their application within a quantum network is also of interest in regard to privacy, data protection and computational security. One promising application is blind quantum computing, where a client with limited quantum capacities utilizes the computational power of a quantum computer located at a quantum computing center without revealing any information about the computation or data involved. Several schemes for blind quantum computation have emerged, with the most advanced relying on measurement-based quantum computing [1]. However, many current quantum computer designs are based on gate-based state manipulation. While blind quantum computing is also possible in this scenario, it requires a permanent exchange of quantum information between client and server [2]. To reduce the communication overhead for the involved parties, we study a relaxed scenario of blind quantum computing, where the server gets some information about the algorithm. In particular, we propose a protocol to hide an n-qubit Grover search algorithm by utilizing additional qubits on a quantum server which are initialized by the clients. [1] Fitzsimons, J. F. (2017), npj Quantum Information, 3(1), 23. [2] A. Childs, A. (2005), Quantum Inform. Comput., 5, 456-466.

•Mar 13, 2025•0 citations

Blind Transpiler: An open-source library for universally blind and homomorphic quantum computations

Mohit Joshi, Manoj Kumar Mishra, S. Karthikeyan

Blind quantum computation is a cryptographic primitive that allows a limited-capability client to delegate its complex computation to a remote server without revealing its data and/or computation. This branch of quantum cryptography has been bifurcated into two distinct primitives, quantum homomorphic encryption (concerning the security of only data) and universal blind quantum computation (concerning the security of data and the computing algorithm). These primitives have immense applicability in problems like secure cloud computing, secure quantum variational algorithms, quantum federated learning, and secure multiparty computation. However, no software tools exist for the rapid prototyping of such protocols, hindering the academic interrogation for potential applications. In this paper, we describe the development of the first such library for transpiling circuits written in Qiskit to its blind counterpart, which can then be delegated in a client-server architecture without revealing the client's data and/or computation. The proposed library is designed in modular and reusable component layers, enabling easier scalability to newer BQC primitives and robustness against changes in underlying primitives. We show the implementation of these primitives to a blind variational quantum classifier for the IRIS dataset.

quant-pharXiv:2607.17131•Jul 21, 2026•0 citations
Abstract Blind Quantum Computing (BQC) is a protocol proposed in recent years to tackle the practical need where users want to perform quantum computing tasks but lack the necessary capabilities, and thus delegate the work to quantum computing platforms while keeping their data secure throughout the process. Besides, its characteristics provide new ways for secure multi-party computation, helping multiple untrusted users to compute together securely. Most existing secure multi-party computation protocol based on blind quantum computing rely on DT(G) states to perform joint computation. However, this can lead to security risks because one client has too much authority, and these schemes also lack generality. In this paper, a secure multi-party computation protocol is proposed based on brickwork states. By exploiting and optimizing the properties of these states, the security issues in joint client computation are solved and centralized authority is avoided. Meanwhile, it reflects the interactive mode in multi-party computation. The proposed protocol effectively improves the generality of computation.
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.
hile quantum computers might offer several computational benefits, their application within a quantum network is also of interest in regard to privacy, data protection and computational security. One promising application is blind quantum computing, where a client with limited quantum capacities utilizes the computational power of a quantum computer located at a quantum computing center without revealing any information about the computation or data involved. Several schemes for blind quantum computation have emerged, with the most advanced relying on measurement-based quantum computing [1]. However, many current quantum computer designs are based on gate-based state manipulation. While blind quantum computing is also possible in this scenario, it requires a permanent exchange of quantum information between client and server [2]. To reduce the communication overhead for the involved parties, we study a relaxed scenario of blind quantum computing, where the server gets some information about the algorithm. In particular, we propose a protocol to hide an n-qubit Grover search algorithm by utilizing additional qubits on a quantum server which are initialized by the clients. [1] Fitzsimons, J. F. (2017), npj Quantum Information, 3(1), 23. [2] A. Childs, A. (2005), Quantum Inform. Comput., 5, 456-466.
Blind quantum computation is a cryptographic primitive that allows a limited-capability client to delegate its complex computation to a remote server without revealing its data and/or computation. This branch of quantum cryptography has been bifurcated into two distinct primitives, quantum homomorphic encryption (concerning the security of only data) and universal blind quantum computation (concerning the security of data and the computing algorithm). These primitives have immense applicability in problems like secure cloud computing, secure quantum variational algorithms, quantum federated learning, and secure multiparty computation. However, no software tools exist for the rapid prototyping of such protocols, hindering the academic interrogation for potential applications. In this paper, we describe the development of the first such library for transpiling circuits written in Qiskit to its blind counterpart, which can then be delegated in a client-server architecture without revealing the client's data and/or computation. The proposed library is designed in modular and reusable component layers, enabling easier scalability to newer BQC primitives and robustness against changes in underlying primitives. We show the implementation of these primitives to a blind variational quantum classifier for the IRIS dataset.