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:2310.02922 · Quantum Information Processing

Public verifiable measurement-only blind quantum computation based on entanglement witnesses

Wenjie Liu, Zixian Li, Wenbo Li, Qi Yang

Published Mar 8, 2023• 7 citations
arXivHTMLPDF
DOI
10.1007/s11128-023-03859-9

Related papers

A publicly verifiable quantum blind signature scheme without entanglement based on asymmetric cryptography.

Yalin Chen, Jue‐Sam Chou, Liangchun Wang +1 more

•Jan 1, 2019•1 citation

Verification of blind quantum computation with entanglement witnesses

Qingshan Xu, Xiaoqing Tan, Rui Huang +1 more

Verifiable blind quantum computation provides a cloud scenario for scalable quantum information processing. However, constructing one resource-efficient verification protocol is still an open problem. In this paper, the context of verification we consider is the measurement-based model, in which the client receives the graph state prepared by the server and performs single-qubit measurements on it to drive the computation. We first utilize three entanglement witnesses to estimate the fidelity of the prepared graph state. Applying entanglement witnesses to design the test phase, we propose verification protocols. Our protocol requires overhead in terms of copies of the graph state that scales as $O({n}^{2}logn)$, where $n$ is the number of qubits of the graph state. Furthermore, the soundness of our protocol is improved. The advantages of our protocol are derived from the fact that each entanglement witness can be implemented by the client with a fixed number of measurement settings.

Physical Review A•Oct 12, 2021•20 citations

Measurement-Based and Universal Blind Quantum Computation

Anne Broadbent, Joseph F. Fitzsimons, Elham Kashefi

Lecture notes in computer science•Jan 1, 2010•23 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•11 citations

Publicly Verifiable Blind Quantum Computation

Kentaro Honda

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.

arXiv:1604.00116•Apr 1, 2016•7 citations

Verifiable single client-server Blind Quantum Computation based on measurement

Xiaoqian Zhang, Jian Weng, Weiqi Luo +1 more

The characteristics of BQC is that it enables a client with less quantum abilities to delegate her quantum computation to a server with strong quantum computablities while keeping the client's privacy. In this article, we study single client-server BQC based on measurement which is verifiable. In detail, the verifiability is that the client Alice can obtain the correct measurement results if the server Bob is honest, while Bob does not get nothing of Alice's secret information if he is malicious. We construct a latticed state, composed of six-qubit cluster states and eight-qubit entangled states, to realize Alice's quantum computing. In this proposed protocol, the cilent Alice prepares and sends initial single-qubit states to Bob, where the initial states include useful qubits and trap qubits. And then Bob performs controlled-Z gate to produce the entanglement and returns them to Alice. Alice will send trap qubits and useful qubits to Bob randomly and Bob returns all measurement results to her. Alice makes a comparison for trap qubits between true results and Bob's results to check the honesty of Bob. In a word, the trap qubtis have two purposes: 1) confusing Bob to keep the blindness; 2)verifying the honesty of Bob and correctness of Bob's quantum computing. There has an important feature that Alice does not need to encrypt the computing angles by $r\pi$ (r$\in\{0,1\}$), meanwhile the blindness and correctness can also be ensured. That is, Alice's computing results don't need to flipped since Bob is not impossible know anything about the quantum computation. Our work gives a better understanding for verifiable BQC based on measurement.

•Jan 10, 2018•0 citations
Verifiable blind quantum computation provides a cloud scenario for scalable quantum information processing. However, constructing one resource-efficient verification protocol is still an open problem. In this paper, the context of verification we consider is the measurement-based model, in which the client receives the graph state prepared by the server and performs single-qubit measurements on it to drive the computation. We first utilize three entanglement witnesses to estimate the fidelity of the prepared graph state. Applying entanglement witnesses to design the test phase, we propose verification protocols. Our protocol requires overhead in terms of copies of the graph state that scales as O(n2logn)O({n}^{2}logn)O(n2logn), where nnn is the number of qubits of the graph state. Furthermore, the soundness of our protocol is improved. The advantages of our protocol are derived from the fact that each entanglement witness can be implemented by the client with a fixed number of measurement settings.
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.
The characteristics of BQC is that it enables a client with less quantum abilities to delegate her quantum computation to a server with strong quantum computablities while keeping the client's privacy. In this article, we study single client-server BQC based on measurement which is verifiable. In detail, the verifiability is that the client Alice can obtain the correct measurement results if the server Bob is honest, while Bob does not get nothing of Alice's secret information if he is malicious. We construct a latticed state, composed of six-qubit cluster states and eight-qubit entangled states, to realize Alice's quantum computing. In this proposed protocol, the cilent Alice prepares and sends initial single-qubit states to Bob, where the initial states include useful qubits and trap qubits. And then Bob performs controlled-Z gate to produce the entanglement and returns them to Alice. Alice will send trap qubits and useful qubits to Bob randomly and Bob returns all measurement results to her. Alice makes a comparison for trap qubits between true results and Bob's results to check the honesty of Bob. In a word, the trap qubtis have two purposes: 1) confusing Bob to keep the blindness; 2)verifying the honesty of Bob and correctness of Bob's quantum computing. There has an important feature that Alice does not need to encrypt the computing angles by rπr\pirπ (r∈{0,1}\in\{0,1\}∈{0,1}), meanwhile the blindness and correctness can also be ensured. That is, Alice's computing results don't need to flipped since Bob is not impossible know anything about the quantum computation. Our work gives a better understanding for verifiable BQC based on measurement.