most citedExperimental Quantum Secret Sharing and Third-Man Quantum Cryptography

193 citations · 253 across the 7 of their papers we have counts for

collaborators

7 papers

quant-ph200540 cited

Experimental Fault-Tolerant Quantum Cryptography in a Decoherence-Free Subspace

Q. Zhang, J. Yin, T. -Y. Chen +6

we experimentally implement a fault-tolerant quantum key distribution protocol with two photons in a decoherence-free subspace (DFS). It is demonstrated that our protocol can yield…

quant-ph20051 cited

Quantum-Relay-Assisted Key Distribution over High Photon Loss Channels

An-Ning Zhang, Yu-Ao Chen, Chao-Yang Lu +5

The maximum distance of quantum communication is limited due to the photon loss and detector noise. Exploiting entanglement swapping, quantum relay could offer ways to extend the a…

quant-ph20058 cited

Comment on "Quantum Key Distribution with the Blind Polarization Bases"

Qiang Zhang, Xiang-Bin Wang, Yu-Ao Chen +2

We show an eavesdropping scheme, by which the eavesdropper can achieve the full information of the key against the protocol [Kye et al., PRL 95 040501 (2005)] with a probability of…

quant-ph2005193 cited

Experimental Quantum Secret Sharing and Third-Man Quantum Cryptography

Yu-Ao Chen, An-Ning Zhang, Zhi Zhao +5

Quantum secret sharing (QSS) is a protocol to split a message into several parts so that no subset of parts is sufficient to read the message, but the entire set is. In the scheme,…

quant-ph20051 cited

Experimental Test of the Kochen-Specker Theorem for Single Qubits using Positive Operator-Valued Measures

Qiang Zhang, Hui Li, Tao Yang +3

We present an experimental scheme for the implementation of arbitrary generalized measurements, represented by positive-operator valued measures, on the polarization of single phot…

quant-ph20026 cited

Implement Quantum Random Walks with Linear Optics Elements

Zhi Zhao, Jiangfeng Du, Hui Li +3

The quantum random walk has drawn special interests because its remarkable features to the classical counterpart could lead to new quantum algorithms. In this paper, we propose a f…