Practical blind quantum computation with parity quantum computing framework

doi:10.1088/2058-9565/ae54c5

Practical blind quantum computation with parity quantum computing framework

2026-03-31

0

PRE

AI

DOI：10.1088/2058-9565/ae54c5

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

Blind quantum computation

Parity quantum computing

Quantum privacy

Verifiability

Quantum device implementation

Practical blind quantum computation with parity quantum computing framework

Abstract

Journal

Organization