We propose a scheme for sharing an arbitrary unknown two-qubit state among three parties by using afour-qubit cluster-class state and a Bell state as a quantum channel With a quantum controlled phase gate (QCPG)operat...We propose a scheme for sharing an arbitrary unknown two-qubit state among three parties by using afour-qubit cluster-class state and a Bell state as a quantum channel With a quantum controlled phase gate (QCPG)operation and a local unitary operation,any one of the two agents has the access to reconstruct the original state ifhe/she collaborates with the other one,whilst individual agent obtains no information.As all quantum resource canbe used to carry the useful information,the intrinsic efficiency of qubits approaches the maximal value.Moreover,thepresent scheme is more feasible with present-day technique.展开更多
Recently, Liu et al. proposed a two-party quantum private comparison(QPC) protocol using entanglement swapping of Bell entangled state(Commun. Theor. Phys. 57(2012) 583). Subsequently, Liu et al. pointed out that in L...Recently, Liu et al. proposed a two-party quantum private comparison(QPC) protocol using entanglement swapping of Bell entangled state(Commun. Theor. Phys. 57(2012) 583). Subsequently, Liu et al. pointed out that in Liu et al.'s protocol, the TP can extract the two users' secret inputs without being detected by launching the Bell-basis measurement attack, and suggested the corresponding improvement to mend this loophole(Commun. Theor. Phys. 62(2014) 210). In this paper, we first point out the information leakage problem toward TP existing in both of the above two protocols, and then suggest the corresponding improvement by using the one-way hash function to encrypt the two users' secret inputs. We further put forward the three-party QPC protocol also based on entanglement swapping of Bell entangled state, and then validate its output correctness and its security in detail. Finally, we generalize the three-party QPC protocol into the multi-party case, which can accomplish arbitrary pair's comparison of equality among K users within one execution.展开更多
基金Supported by the Natural Science Research Programme of the Education Department of Anhui Province under Grant Nos.KJ2009B039Z and KJ2009B018Zthe Municipal Level Research Project from Lu'an City directive entrusted to West AnHui University under Grant No.2008LW004
文摘We propose a scheme for sharing an arbitrary unknown two-qubit state among three parties by using afour-qubit cluster-class state and a Bell state as a quantum channel With a quantum controlled phase gate (QCPG)operation and a local unitary operation,any one of the two agents has the access to reconstruct the original state ifhe/she collaborates with the other one,whilst individual agent obtains no information.As all quantum resource canbe used to carry the useful information,the intrinsic efficiency of qubits approaches the maximal value.Moreover,thepresent scheme is more feasible with present-day technique.
基金Supported by the National Natural Science Foundation of China under Grant No.61402407
文摘Recently, Liu et al. proposed a two-party quantum private comparison(QPC) protocol using entanglement swapping of Bell entangled state(Commun. Theor. Phys. 57(2012) 583). Subsequently, Liu et al. pointed out that in Liu et al.'s protocol, the TP can extract the two users' secret inputs without being detected by launching the Bell-basis measurement attack, and suggested the corresponding improvement to mend this loophole(Commun. Theor. Phys. 62(2014) 210). In this paper, we first point out the information leakage problem toward TP existing in both of the above two protocols, and then suggest the corresponding improvement by using the one-way hash function to encrypt the two users' secret inputs. We further put forward the three-party QPC protocol also based on entanglement swapping of Bell entangled state, and then validate its output correctness and its security in detail. Finally, we generalize the three-party QPC protocol into the multi-party case, which can accomplish arbitrary pair's comparison of equality among K users within one execution.
