Blind quantum computation for quantum Fourier transform on Bell states
Xiaoqian Zhang

TL;DR
This paper develops secure blind quantum computation protocols for performing quantum Fourier transform on Bell states, ensuring privacy of inputs, algorithms, and outputs in delegated quantum computing.
Contribution
It introduces new protocols for blind quantum Fourier transform on Bell states, enhancing security and generality compared to previous methods.
Findings
Protocols are proven to be blind and correct.
Enhanced security protocols for QFT on Bell states.
Generalized protocols for different Bell state configurations.
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 with relevant circuits. To strengthen security, we construct enhanced BQC protocols of QFT performed on qubits 13 of any two Bell states with relevant quantum circuits. Featured the property of stronger security, we give generalized BQC protocols of QFT…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
