相关论文: Efficiently implementable codes for quantum key ex…

We investigate a general class of quantum key distribution (QKD) protocols using one-way classical communication. We show that full security can be proven by considering only collective attacks. We derive computable lower and upper bounds…

Permutable Chebyshev polynomials (T polynomials) defined over the field of real numbers are suitable for creating a Diffie-Hellman-like key exchange algorithm that is able to withstand attacks using quantum computers. The algorithm takes…

A general proof of the security against eavesdropping of a previously introduced protocol for two-party quantum key distribution based on entanglement swapping [Phys. Rev. A {\bf 61}, 052312 (2000)] is provided. In addition, the protocol is…

We prove the security of the Bennett-Brassard (BB84) quantum key distribution protocol for an arbitrary source whose averaged states are basis-independent, a condition that is automatically satisfied if the source is suitably designed. The…

High-dimensional quantum key distribution (QKD) offers secure communication, with secure key rates that surpass those achievable by QKD protocols utilizing two-dimensional encoding. However, existing high-dimensional QKD protocols require…

It is demonstrated that for the entanglement-based version of the Bennett-Brassard (BB84) quantum key distribution protocol, Alice and Bob share provable entanglement if and only if the estimated qubit error rate is below 25% or above 75%.…

It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding and encoded Hilbert spaces. However, this bound only applies…

We introduce a new multiparty cryptographic protocol, which we call `entanglement sharing schemes', wherein a dealer retains half of a maximally-entangled bipartite state and encodes the other half into a multipartite state that is…

We propose the use of intra-particle entanglement to enhance the security of a practical implementation of the Bennett-Brassard-1984 (BB84) quantum key distribution scheme. Intra-particle entanglement is an attractive resource since it can…

Quantum coherence was recently formalized as a physical resource to measure the strength of superposition. Based on the resource theory, we present a systematic framework that connects a coherence measure to the security of quantum key…

We propose a novel source based on a dual-drive modulator that is adaptable and allows Alice to choose between various practical quantum key distribution (QKD) protocols depending on what receiver she is communicating with. Experimental…

This letter proposes a novel key distribution protocol with no key exchange in advance, which is secure as the BB84 quantum key distribution protocol. Our protocol utilizes a photon in superposition state for single-bit data transmission…

One of the simplest security proofs of quantum key distribution is based on the so-called complementarity scenario, which involves the complementarity control of an actual protocol and a virtual protocol [M. Koashi, e-print arXiv:0704.3661…

This paper presents a prepare-and-measure scheme using $N$-dimensional quantum particles as information carriers where $N$ is a prime power. One of the key ingredients used to resist eavesdropping in this scheme is to depolarize all Pauli…

We propose to analyse quantum protocols by applying formal verification techniques developed in classical computing for the analysis of communicating concurrent systems. One area of successful application of these techniques is that of…

The security of code based constructions is usually assessed by Information Set Decoding (ISD) algorithms. In the quantum setting, amplitude amplification yields an asymptotic square root gain over the classical analogue. However, it is…

While quantum key distribution (QKD) based on two-dimensional (qubit) encoding is a mature, field-tested technology, its performance is lacking for many cryptographic applications. High-dimensional encoding for QKD enables increased…

The secure transfer of information is an important problem in modern telecommunications. Quantum key distribution (QKD) provides a solution to this problem by using individual quantum systems to generate correlated bits between remote…

Despite enormous progress both in theoretical and experimental quantum cryptography, the security of most current implementations of quantum key distribution is still not established rigorously. One of the main problems is that the security…

According to the entropy accumulation theorem, proving the unconditional security of a device-independent quantum key distribution protocol reduces to deriving tradeoff functions, i.e., bounds on the single-round von Neumann entropy of the…