Verifiable blind quantum computation with identity authentication for
different types of clients
- URL: http://arxiv.org/abs/2210.09830v1
- Date: Tue, 18 Oct 2022 13:21:34 GMT
- Title: Verifiable blind quantum computation with identity authentication for
different types of clients
- Authors: Junyu Quan, Qin Li, Lvzhou Li
- Abstract summary: Blind quantum computing (BQC) provides a solution for clients with limited quantum capabilities to delegate their quantum computation to remote quantum servers while keeping input, output, and even algorithm private.
In this paper, we propose three multi-party verifiable blind quantum computing (VBQC) protocols with identity authentication to handle clients with varying quantum capabilities in quantum networks.
- Score: 3.0058005235097123
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum computing has considerable advantages in solving some problems over
its classical counterpart. Currently various physical systems are developed to
construct quantum computers but it is still challenging and the first use of
quantum computers may adopt the cloud style. Blind quantum computing (BQC)
provides a solution for clients with limited quantum capabilities to delegate
their quantum computation to remote quantum servers while keeping input,
output, and even algorithm private. In this paper, we propose three multi-party
verifiable blind quantum computing (VBQC) protocols with identity
authentication to handle clients with varying quantum capabilities in quantum
networks, such as those who can just make measurements, prepare single qubits,
or perform a few single-qubit gates. They are client-friendly and flexible
since the clients can achieve BQC depending on their own quantum devices and
resist both insider outsider attacks in quantum networks. Furthermore, all the
three proposed protocols are verifiable, namely that the clients can verify the
correctness of their calculations.
Related papers
Err
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.