• Corpus ID: 55320784

Blind quantum computation for QFT on multi-qubit states

  title={Blind quantum computation for QFT on multi-qubit states},
  author={Xiaoqian Zhang and Jian Weng and Weiqi Luo and Xiaoqing Tan},
  journal={arXiv: Quantum Physics},
After quantum computers come out, governments and rich companies will have the abilities to buy these useful quantum computers, meanwhile they are familiar with these technologies proficiently. If a client wants to perform quantum computing but she does not have quantum computers with relevant quantum technologies. She can seek help from the server and pay his salary, but she does not want to leak anything to the server. Blind quantum computing (BQC) give a good method for the client to… 

Figures from this paper



Secure entanglement distillation for double-server blind quantum computation.

This Letter shows that it is possible to perform entanglement distillation in the double-server scheme without degrading the security of blind quantum computing.

Universal Blind Quantum Computation

The protocol is the first universal scheme which detects a cheating server, as well as the first protocol which does not require any quantum computation whatsoever on the client's side.

Optimal Blind Quantum Computation

This work presents general techniques for upper and lower bounding the quantum communication necessary to perform blind quantum computation, and uses these techniques to establish concrete bounds for common choices of the client's quantum capabilities.

Blind topological measurement-based quantum computation

This work shows that fault-tolerant blind quantum computation is possible in a topologically protected manner using the Raussendorf–Harrington–Goyal scheme, and implies that secure cloud quantum computations is within reach.

Triple-server blind quantum computation using entanglement swapping

A triple-server blind computation protocol where the client can delegate quantum computation to three quantum servers by the use of entanglement swapping and the client is almost classical since one does not require any quantum computational power, quantum memory, and the ability to prepare any quantum states and only needs to be capable of getting access to quantum channels.

Blind quantum computing with two almost identical states

This work identifies sufficient criteria on the powers of the client, which still allow for secure blind quantum computation, in a universally composable framework, and provides a series of protocols, where each step reduces the number of differing states the client needs to be able to prepare.

Blind quantum computation over a collective-noise channel

This work proposes to use decoherence-free subspace (DFS) to overcome the collective noise in the quantum channel for BQC, which is called DFS-BQC and combines the ideas based on DFS and the Broadbent-Fitzsimons-Kashefi protocol without degrading unconditional security.

Blind quantum computing with weak coherent pulses.

The concept of ϵ blindness for UBQC is introduced, in analogy to the concept ofπ security developed for other cryptographic protocols, allowing us to characterize the robustness and security properties of the protocol under possible imperfections.

Verification for measurement-only blind quantum computing

This paper proposes a protocol of verification for the measurement-only blind quantum computing, a new secure quantum computing protocol where a client who does not have any sophisticated quantum technlogy can delegate her quantum computing to a server without leaking any privacy.

Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing.

We introduce a simple protocol for verifiable measurement-only blind quantum computing. Alice, a client, can perform only single-qubit measurements, whereas Bob, a server, can generate and store