Blind quantum computation (BQC) is a model in which a computation is performed on a server by a client such that the server is kept blind about the input, the algorithm, and the output of the computation. Here we layout a general framework for BQC which, unlike the previous BQC models, does not constructed on specific computational model. A main ingredient of our construction is gate teleportation. We demonstrate that our framework can be straightforwardly implemented on circuit-based models as well as measurement-based models of quantum computation. We illustrate our construction by showing that universal BQC is possible on correlation-space measurement-based quantum computation models.
Blind quantum computation (BQC) is a model in which a computation is performed on a server by a client such that the server is kept blind about the input, the algorithm, and the output of the computation. Here we layout a general framework for BQC which, unlike the previous BQC models, does not constructed on specific computational model. A main ingredient of our construction is gate teleportation. We demonstrate that our framework can be straightforwardly implemented on circuit-based models as well as measurement-based models of quantum computation. We illustrate our construction by showing that universal BQC is possible on correlation-space measurement-based quantum computation models.
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.
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) 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.
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 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.