Optimizing scheme for probabilistic remote preparation of a two-qubit state

Abstract Remote state preparation is increasingly becoming attractive in recent years, people have already started theoretical and experimental research, and have made valuable research results. Recently, a scheme for probabilistic remote preparation of a general two-qubit state was proposed (Wang Z Y in Quantum Inf Process. 11:1585, 2012)). In this paper, we present a modified scheme for probabilistic remote preparation of a general two-qubit state. To complete the scheme, the new and feasible complete orthogonal basis vectors have been introduced. Compared with the previous schemes, the advantage of our schemes is that the total success probability of remote state preparation will be greatly improved. The probability of success regarding this scheme is calculated in both general and particular cases. The results show that the success probability of remote state preparation can be improved a little. However, in certain special cases, the success probability of preparation can be greatly improved. In special cases, the success probability of preparation can be improved to 1. The security analysis of the scheme is provided in details.

[1]  Zhang-yin Wang Classical communication cost and probabilistic remote two-qubit state preparation via POVM and W-type states , 2012, Quantum Inf. Process..

[2]  Gilles Brassard,et al.  Quantum cryptography: Public key distribution and coin tossing , 2014, Theor. Comput. Sci..

[3]  Fuguo Deng,et al.  Two-step quantum direct communication protocol using the Einstein-Podolsky-Rosen pair block , 2003, quant-ph/0308173.

[4]  You-Bang Zhan,et al.  Scheme for remotely preparing a four-particle entangled cluster-type state , 2010 .

[5]  G. Long,et al.  Controlled order rearrangement encryption for quantum key distribution , 2003, quant-ph/0308172.

[6]  Xiubo Chen,et al.  Experimental architecture of joint remote state preparation , 2011, Quantum Information Processing.

[7]  Su-Juan Qin,et al.  Cryptanalysis of multiparty controlled quantum secure direct communication using Greenberger-Horne-Zeilinger state , 2010 .

[8]  Bin Gu,et al.  Robust quantum secure direct communication with a quantum one-time pad over a collective-noise channel , 2011 .

[9]  Yannick Ole Lipp,et al.  Quantum discord as resource for remote state preparation , 2012, Nature Physics.

[10]  Dong Wang,et al.  Joint remote state preparation of arbitrary two-qubit state with six-qubit state , 2011 .

[11]  H. Weinfurter,et al.  Experimental quantum teleportation , 1997, Nature.

[12]  Cheng-Zu Li,et al.  Deterministic remote preparation of pure and mixed polarization states , 2009, 0909.2570.

[13]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.

[14]  Qiao-Yan Wen,et al.  Quantum secure direct communication with cluster states , 2010 .

[15]  Xiubo Chen,et al.  Controlled remote state preparation of arbitrary two and three qubit states via the Brown state , 2012, Quantum Inf. Process..

[16]  M. Goggin,et al.  Remote state preparation: arbitrary remote control of photon polarization. , 2005, Physical review letters.

[17]  H. Weinfurter,et al.  Remote preparation of an atomic quantum memory , 2007, 2007 European Conference on Lasers and Electro-Optics and the International Quantum Electronics Conference.

[18]  Xi-Han Li,et al.  Efficient quantum key distribution over a collective noise channel (6 pages) , 2008, 0808.0042.

[19]  Hong-Yi Dai,et al.  Classical communication cost and remote preparation of the four-particle GHZ class state , 2006 .

[20]  B. Sanders,et al.  Optimal remote state preparation. , 2002, Physical review letters.

[21]  Ekert,et al.  Quantum cryptography based on Bell's theorem. , 1991, Physical review letters.

[22]  Charles H. Bennett,et al.  Quantum cryptography without Bell's theorem. , 1992, Physical review letters.

[23]  B. Zeng,et al.  Remote-state preparation in higher dimension and the parallelizable manifold Sn-1 , 2001, quant-ph/0105088.