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

De Gruyter eBooks

Sustainable Blind Quantum Computing

Published Apr 23, 2025• 0 citations
Publisher

Abstract

Quantum computing systems are powerful for allowing a client to perform any quantum computations from a remote quantum server while concealing the structure and content of the computation fall under the category of blind quantum computing (BQC). In BQC, the client delegates the quantum processing to one or more powerful quantum servers while retaining privacy over the input, computation and output. This makes it suitable for secure quantum cloud computing. This feature is powerful to ensure that even untrusted servers cannot learn the details of the user's computation. With quantum computing, there is a fast-growing need to transition from general-purpose quantum systems to customized architectures tailored to specific application requirements. This transition is critical while considering sustainability goals and financial limitations. With this advanced computing architecture, a custom system can optimize energy use, hardware complexity, and resource allocation to better serve individual user needs while staying within budgetary boundaries.

DOI
10.1515/9783111264349

Related papers

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

Verifiable blind quantum computing: Comparative analysis and design considerations for client architectures

Janice van Dam, Jeroen Grimbergen, Stephanie D. C. Wehner

Blind quantum computing (BQC) allows a client to delegate quantum computations to a remote server without revealing the input, computation, or output. In addition to being blind, the client can sometimes also verify that the server has performed their instructions correctly, a property known as verifiability. A key part of realizing such verifiable BQC (VBQC) is choosing the design of the client device: many architectures have been proposed, each with different hardware requirements, security properties, and performance characteristics, making it difficult to identify which is most suitable for a given implementation. In this work, we present a comparative analysis of client architectures for VBQC with a matter-qubit server. We restrict our analysis to single-server, single-client protocols with information-theoretic security based on measurement-based quantum computation. We identify three main categories of client: emission-based, measurement-based, and rotation-based, each with multiple variants depending on how the client interacts with the server. We evaluate each across different dimensions: we compare guarantees of existing corresponding security proofs, we derive equations for the rate at which each client can execute a protocol, we provide an overview of each architecture's error behaviour, and discuss hardware cost and design considerations. Client architectures implementing measurement-based remote state preparation and reflection-based teleportation emerge as strong default candidates, but as the right choice remains context-dependent, we provide a framework for navigating considerations to guide the selection of the most suitable architecture for a given setting.

quant-pharXiv:2607.05650•Jul 8, 2026•0 citations

Practical blind quantum computation with parity quantum computing framework

Yuxun Wang, Qin Li, Shao‐Ming Fei +1 more

Abstract Blind quantum computation (BQC) allows clients with limited quantum capabilities to delegate computational tasks to remote quantum servers while keeping the privacy of their data. However, existing BQC protocols often fail to balance resource consumption and practical feasibility, which is particularly significant in the noisy intermediate-scale quantum era. In this paper, we propose a practical BQC model based on the parity quantum computing framework. It requires the server to perform operations only on adjacent qubits and eliminates the need for additional SWAP gates when two-qubit gates should be applied to non-adjacent qubits, greatly facilitating the physical implementation on real quantum devices. Furthermore, we prove that the proposed BQC model ensures the privacy of client’s information and satisfies the property of verifiability which enables clients to identify dishonest servers. Finally, a detailed example is given and simulated on the IBM’s quantum platform to demonstrate its feasibility.

Quantum Science and Technology•Mar 19, 2026•0 citations

Demonstration of Blind Quantum Computing

Stefanie Barz, Elham Kashefi, Anne Broadbent +3 more

Quantum computers, besides offering substantial computational speedups, are also expected to preserve the privacy of a computation. We present an experimental demonstration of blind quantum computing in which the input, computation, and output all remain unknown to the computer. We exploit the conceptual framework of measurement-based quantum computation that enables a client to delegate a computation to a quantum server. Various blind delegated computations, including one- and two-qubit gates and the Deutsch and Grover quantum algorithms, are demonstrated. The client only needs to be able to prepare and transmit individual photonic qubits. Our demonstration is crucial for unconditionally secure quantum cloud computing and might become a key ingredient for real-life applications, especially when considering the challenges of making powerful quantum computers widely available.

arXiv:1110.1381•Science•Jan 19, 2012•473 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

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
Quantum computing systems are powerful for allowing a client to perform any quantum computations from a remote quantum server while concealing the structure and content of the computation fall under the category of blind quantum computing (BQC). In BQC, the client delegates the quantum processing to one or more powerful quantum servers while retaining privacy over the input, computation and output. This makes it suitable for secure quantum cloud computing. This feature is powerful to ensure that even untrusted servers cannot learn the details of the user's computation. With quantum computing, there is a fast-growing need to transition from general-purpose quantum systems to customized architectures tailored to specific application requirements. This transition is critical while considering sustainability goals and financial limitations. With this advanced computing architecture, a custom system can optimize energy use, hardware complexity, and resource allocation to better serve individual user needs while staying within budgetary boundaries.
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.
Blind quantum computing (BQC) allows a client to delegate quantum computations to a remote server without revealing the input, computation, or output. In addition to being blind, the client can sometimes also verify that the server has performed their instructions correctly, a property known as verifiability. A key part of realizing such verifiable BQC (VBQC) is choosing the design of the client device: many architectures have been proposed, each with different hardware requirements, security properties, and performance characteristics, making it difficult to identify which is most suitable for a given implementation. In this work, we present a comparative analysis of client architectures for VBQC with a matter-qubit server. We restrict our analysis to single-server, single-client protocols with information-theoretic security based on measurement-based quantum computation. We identify three main categories of client: emission-based, measurement-based, and rotation-based, each with multiple variants depending on how the client interacts with the server. We evaluate each across different dimensions: we compare guarantees of existing corresponding security proofs, we derive equations for the rate at which each client can execute a protocol, we provide an overview of each architecture's error behaviour, and discuss hardware cost and design considerations. Client architectures implementing measurement-based remote state preparation and reflection-based teleportation emerge as strong default candidates, but as the right choice remains context-dependent, we provide a framework for navigating considerations to guide the selection of the most suitable architecture for a given setting.
Abstract Blind quantum computation (BQC) allows clients with limited quantum capabilities to delegate computational tasks to remote quantum servers while keeping the privacy of their data. However, existing BQC protocols often fail to balance resource consumption and practical feasibility, which is particularly significant in the noisy intermediate-scale quantum era. In this paper, we propose a practical BQC model based on the parity quantum computing framework. It requires the server to perform operations only on adjacent qubits and eliminates the need for additional SWAP gates when two-qubit gates should be applied to non-adjacent qubits, greatly facilitating the physical implementation on real quantum devices. Furthermore, we prove that the proposed BQC model ensures the privacy of client’s information and satisfies the property of verifiability which enables clients to identify dishonest servers. Finally, a detailed example is given and simulated on the IBM’s quantum platform to demonstrate its feasibility.
Quantum computers, besides offering substantial computational speedups, are also expected to preserve the privacy of a computation. We present an experimental demonstration of blind quantum computing in which the input, computation, and output all remain unknown to the computer. We exploit the conceptual framework of measurement-based quantum computation that enables a client to delegate a computation to a quantum server. Various blind delegated computations, including one- and two-qubit gates and the Deutsch and Grover quantum algorithms, are demonstrated. The client only needs to be able to prepare and transmit individual photonic qubits. Our demonstration is crucial for unconditionally secure quantum cloud computing and might become a key ingredient for real-life applications, especially when considering the challenges of making powerful quantum computers widely available.
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.
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.