arXiv:1604.00116

Publicly Verifiable Blind Quantum Computation

Kentaro Honda

Published Apr 1, 2016• 1 citation

Abstract

Blind quantum computation protocols allow a user with limited quantum technology to delegate an intractable computation to a quantum server while keeping the computation perfectly secret. Whereas in some protocols a user can verify that calculated outcomes are correct, a third party cannot do this, which allows a dishonest user or owner to benefit illegally. I propose a new blind quantum computation protocol with a new property called public verifiability, which enables any third party to assure that a party does not benefit from attempted deception.

DOI: 10.48550/arxiv.1604.00116

Related papers

Measurement-only verifiable blind quantum computing with quantum input verification

Tomoyuki Morimae

Verifiable blind quantum computing is a secure delegated quantum computing where a client with a limited quantum technology delegates her quantum computing to a server who has a universal quantum computer. The client's privacy is protected (blindness), and the correctness of the computation is verifiable by the client despite her limited quantum technology (verifiability). There are mainly two types of protocols for verifiable blind quantum computing: the protocol where the client has only to generate single-qubit states and the protocol where the client needs only the ability of single-qubit measurements. The latter is called the measurement-only verifiable blind quantum computing. If the input of the client's quantum computing is a quantum state, whose classical efficient description is not known to the client, there was no way for the measurement-only client to verify the correctness of the input. Here we introduce a protocol of measurement-only verifiable blind quantum computing where the correctness of the quantum input is also verifiable.

arXiv:1606.06467Physical Review AOct 3, 201635 citations

Multiparty Delegated Quantum Computing

Elham Kashefi, Anna Pappa

Quantum computing has seen tremendous progress in the past few years. However, due to limitations in the scalability of quantum technologies, it seems that we are far from constructing universal quantum computers for everyday users. A more feasible solution is the delegation of computation to powerful quantum servers on the network. This solution was proposed in previous studies of blind quantum computation, with guarantees for both the secrecy of the input and of the computation being performed. In this work, we further develop this idea of computing over encrypted data, to propose a multiparty delegated quantum computing protocol in the measurement-based quantum computing framework. We prove the security of the protocol against a dishonest server and against dishonest clients, under the assumption of common classical cryptographic constructions.

arXiv:1606.09200CryptographyJul 30, 201774 citations

Verifiable blind quantum computation over collective-noise

Yuan-Mao Luo, Zhen Yang, Guang-Yang Wu +2 more

Abstract Blind quantum computation(BQC) is a new type of secure quantum computation. In the natural environment, the qubits used in BQC will inevitably be affected by the noise, and the client cannot guarantee the correctness of computational results when the server is dishonest. This paper proposes a verifiable BQC over collective-noise based on quantum error correction to solve these two problems. Furthermore, the proposed protocol needs to expand Alice’s quantum capabilities. The client makes single-qubit measurements on the qubits, encoded and transmitted by the server. As a result, they protect qubits used to compute and utilize single-qubits to verify.

Physica ScriptaApr 16, 20243 citations

Analysis and improvement of verifiable blind quantum computation

Min Xiao, Yannan Zhang

In blind quantum computation (BQC), a client with weak quantum computation capabilities is allowed to delegate its quantum computation tasks to a server with powerful quantum computation capabilities, and the inputs, algorithms and outputs of the quantum computation are confidential to the server. Verifiability refers to the ability of the client to verify with a certain probability whether the server has executed the protocol correctly and can be realized by introducing trap qubits into the computation graph state to detect server deception. The existing verifiable universal BQC protocols are analyzed and compared in detail. The XTH protocol (proposed by Xu Q S, Tan X Q, Huang R in 2020), a recent improvement protocol of verifiable universal BQC, uses a sandglass-like graph state to further decrease resource expenditure and enhance verification capability. However, the XTH protocol has two shortcomings: limitations in the coloring scheme and a high probability of accepting an incorrect computation result. In this paper, we present an improved version of the XTH protocol, which revises the limitations of the original coloring scheme and further improves the verification ability. The analysis demonstrates that the resource expenditure is the same as for the XTH protocol, while the probability of accepting the wrong computation result is reduced from the original minimum (0.866) d* to (0.819) d*, where d* is the number of repeated executions of the protocol.

Chinese Physics BOct 13, 20210 citations

Blind Quantum Computation by Circuit Based Quantum Computer

Yuichi Sano

When universal quantum computer is used by public, it is assumed that it will be used as a quantum cloud server that exists in a few bases because the quantum computer is expensive. When it will be realized, a quantum universal computer is thought to work as a quantum cloud server. In the cloud server the privacy is a crucial issue. That is, we need a blind quantum computation (BQC) protocol so that each user can use the server without showing the details of the calculation. It is also important to be able to verify that the server is performing calculations as instructed by the user, since quantum calculations cannot be verified by classical computation. In this paper, we give a protocol for the blindness by using a quantum one-time pad encryption and T-like gate, and for verifying computation by using trap qubits.

Jun 11, 20200 citations

A three-party verifiable blind quantum computing protocol with separated input and function ownership

Yinqi Feng, Ri‐Gui Zhou, Ran Guo +2 more

Abstract Blind quantum computing enables quantum-limited clients to securely access untrusted quantum servers. This paper proposes a three-party verifiable blind quantum computing protocol with separated input and function ownership, where Alice holds the private input, Bob holds the target function, and Charlie performs the delegated quantum computation, with the result released only to Alice. Alice and Bob first establish a shared key using BB84. Under the measurement-based quantum computing framework, a secure two-party computation protocol is then used to jointly generate adaptive blinded measurement instructions, eliminating the need for Bob to transmit quantum states to Charlie. A hidden dummy-trap mechanism is further incorporated to verify malicious server behavior. Under the honest-but-curious client model without client-server collusion, the protocol protects input and function privacy while ensuring computation blindness, shared-key security, and verifiability. Most quantum operations are performed by Charlie, while the clients require only limited quantum capabilities.

Physica ScriptaAug 28, 20260 citations