相关论文: Equivalence between two-qubit entanglement and sec…

We revisit the problem of detection of entanglement of an unknown two-qubit state using minimal resources. Using weak values and just two copies of an arbitrary two-qubit state, we present a protocol where a post selection measurement in…

A key ingredient of quantum repeaters is entanglement distillation, i.e., the generation of high-fidelity entangled qubits from a larger set of pairs with lower fidelity. Here, we present entanglement distillation protocols based on qubit…

Quantum Key Distribution is a quantum communication technique in which random numbers are encoded on quantum systems, usually photons, and sent from one party, Alice, to another, Bob. Using the data sent via the quantum signals,…

Entanglement distillation is a well-studied problem in quantum information, where one typically starts with $n$ noisy Bell pairs and distills $k$ Bell pairs of higher fidelity. While distilling Bell pairs is the canonical setting, it is…

There has been much interest in quantum key distribution. Experimentally, quantum key distribution over 150 km of commercial Telecom fibers has been successfully performed. The crucial issue in quantum key distribution is its security.…

Semi-quantum key distribution (SQKD) can share secret keys by using less quantum resource than its fully quantum counterparts, and this likely makes SQKD become more practical and realizable. In this paper, we present a new SQKD protocol by…

In time entanglement-based quantum key distribution (QKD), Alice and Bob extract the raw key bits from the (identical) arrival times of entangled photon pairs by time-binning. Each of them individually discretizes time into bins and groups…

To detect frauds from some internal participants or external attackers, some verifiable threshold quantum secret sharing schemes have been proposed. In this paper, we present a new verifiable threshold structure based on a single qubit…

We proposed a new scheme for quantum key distribution based on entanglement swapping. By this protocol \QTR{em}{Alice} can securely share a random quantum key with \QTR{em}{Bob}, without transporting any particle.

We propose a theoretical scheme for secure quantum key distribution network following the ideas in quantum dense coding. In this scheme, the server of the network provides the service for preparing and measuring the Bell states, and the…

It is well known that any entangled mixed state in $2\otimes 2$ systems can be purified via infinite copies of the mixed state. But can one distill a pure maximally entangled state from finite copies of a mixed state in any bipartite system…

We derive a sufficient condition for advantage distillation to be secure against collective attacks in device-independent quantum key distribution (DIQKD), focusing on the repetition-code protocol. In addition, we describe a semidefinite…

Secure communication protocols are becoming increasingly important, e.g. for internet-based communication. Quantum key distribution allows two parties, commonly called Alice and Bob, to generate a secret sequence of 0s and 1s called a key…

We consider two quantum cryptographic schemes relying on encoding the key into qudits, i.e. quantum states in a d-dimensional Hilbert space. The first cryptosystem uses two mutually unbiased bases (thereby extending the BB84 scheme), while…

Quantum key distribution (QKD) is a provably secure way for two distant parties to establish a common secret key, which then can be used in a classical cryptographic scheme. Using quantum entanglement, one can reduce the necessary…

Employing the fundamental laws of quantum physics, Quantum Key Distribution (QKD) promises the unconditionally secure distribution of cryptographic keys. However, in practical realisations, a QKD protocol is only secure, when the quantum…

In this paper [Chin. Phys. B 27 (2018) 080304], Du and Bao proposed a quantum secret sharing protocol based on two-particle transform of Bell states. We study the security of the proposed protocol and find that it is not secure, that is,…

We analyse two party non-local games whose predicate requires Alice and Bob to generate matching bits, and their three party extensions where a third player receives all inputs and is required to output a bit that matches that of the…

It is possible for two parties, Alice and Bob, to establish a secure communication link by sharing an ensemble of entangled particles, and then using these particles to generate a secret key. One way to establish that the particles are…

We present a deterministic secure direct communication scheme via entanglement swapping, where a set of ordered maximally entangled three-particle states (GHZ states), initially shared by three spatially separated parties, Alice, Bob and…