Application of Blind Quantum Computation to Two-Party Quantum Computation

Blind quantum computation (BQC) allows a client who has only limited quantum power to achieve quantum computation with the help of a remote quantum server and still keep the client’s input, output, and algorithm private. Recently, Kashefi and Wallden extended BQC to achieve two-party quantum computation which allows two parties Alice and Bob to perform a joint unitary transform upon their inputs. However, in their protocol Alice has to prepare rotated single qubits and perform Pauli operations, and Bob needs to have a powerful quantum computer. In this work, we also utilize the idea of BQC to put forward an improved two-party quantum computation protocol in which the operations of both Alice and Bob are simplified since Alice only needs to apply Pauli operations and Bob is just required to prepare and encrypt his input qubits.

[1]  Lan Zhou,et al.  Efficient N-particle W state concentration with different parity check gates , 2012, 1204.1492.

[2]  Lov K. Grover.  Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.

[3]  Louis Salvail,et al.  Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries , 2010, CRYPTO.

[4]  R Raussendorf,et al.  A one-way quantum computer. , 2001, Physical review letters.

[5]  T. Morimae,et al.  Blind quantum computation protocol in which Alice only makes measurements , 2012, 1201.3966.

[6]  N. Gisin,et al.  Heralded photon amplification for quantum communication , 2012, 1203.3396.

[7]  Tomoyuki Morimae.  Continuous-variable blind quantum computation. , 2012, Physical review letters.

[8]  Keisuke Fujii,et al.  Secure entanglement distillation for double-server blind quantum computation. , 2013, Physical review letters.

[9]  Keisuke Fujii,et al.  Blind quantum computation over a collective-noise channel , 2016 .

[10]  Andrew M. Childs.  Secure assisted quantum computation , 2001, Quantum Inf. Comput..

[11]  Wolfgang Dür,et al.  Robustness of hashing protocols for entanglement purification , 2014 .

[12]  E. Kashefi,et al.  Unconditionally verifiable blind quantum computation , 2012, 1203.5217.

[13]  A. Miyake,et al.  Measurement-based quantum computer in the gapped ground state of a two-body Hamiltonian. , 2008, Physical review letters.

[14]  Lan Zhou,et al.  Deterministic entanglement distillation for secure double-server blind quantum computation , 2013, Scientific Reports.

[15]  Chunhui Wu,et al.  Multiple-server Flexible Blind Quantum Computation in Networks , 2016 .

[16]  Yu-Bo Sheng,et al.  Purification of Logic-Qubit Entanglement , 2015, Scientific Reports.

[17]  Yu-Bo Sheng,et al.  Distributed secure quantum machine learning. , 2017, Science bulletin.

[18]  Keisuke Fujii,et al.  Blind topological measurement-based quantum computation , 2011, Nature Communications.

[19]  Elham Kashefi,et al.  Blind quantum computing with weak coherent pulses. , 2011, Physical review letters.

[20]  I. Chuang,et al.  Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition , 2010 .

[21]  Elham Kashefi,et al.  Garbled Quantum Computation , 2017, Cryptogr..

[22]  Joseph Fitzsimons,et al.  Private quantum computation: an introduction to blind quantum computing and related protocols , 2016, npj Quantum Information.

[23]  Joseph Fitzsimons,et al.  Optimal Blind Quantum Computation , 2013, Physical review letters.

[24]  Yu-Bo Sheng,et al.  Recyclable amplification protocol for the single-photon entangled state , 2015 .

[25]  Shengyu Zhang,et al.  Blind quantum computation with identity authentication , 2018 .

[26]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[27]  Louis Salvail,et al.  BLIND QUANTUM COMPUTATION , 2003 .

[28]  T. Morimae,et al.  Ancilla-Driven Universal Blind Quantum Computation , 2012, 1210.7450.

[29]  Qin Li,et al.  Triple-server blind quantum computation using entanglement swapping , 2014 .