English

Blind quantum computation for quantum Fourier transform on Bell states

Quantum Physics 2019-08-27 v4

Abstract

It is called blind quantum computation(BQC) that a client who has limited quantum technologies can delegate her quantum computing to a server who has fully-advanced quantum computers. But the privacy of the client's quantum inputs, algorithms and outputs is still a challenge. To realize a secure BQC, we mainly study how to hide quantum fourier transform (QFT) performed on Bell states. In this paper, three cases are considered as follows. For the first case, we design primary BQC protocols of QFT performed on qubits 12 of belonging to {ϕ±12,\{|\phi^\pm\rangle_{12}, ψ±12}|\psi^\pm\rangle_{12}\} with relevant circuits. To strengthen security, we construct enhanced BQC protocols of QFT performed on qubits 13 of any two Bell states ξ12θ34|\xi\rangle_{12}\otimes|\theta\rangle_{34} with relevant quantum circuits. Featured the property of stronger security, we give generalized BQC protocols of QFT performed on qubits 13 and 24 of any two Bell states with relevant quantum circuits respectively. At last, we analyze and prove the blindness and correctness.

Keywords

Cite

@article{arxiv.1712.08021,
  title  = {Blind quantum computation for quantum Fourier transform on Bell states},
  author = {Xiaoqian Zhang},
  journal= {arXiv preprint arXiv:1712.08021},
  year   = {2019}
}

Comments

This paper has been withdrawn by the author since the conclusions need to be studied and modified in depth

R2 v1 2026-06-22T23:26:07.717Z