Related papers: Optimum ratio between two bases in Bennett-Brassar…
Since the invention of Bennett-Brassard 1984 (BB84) protocol, many quantum key distribution (QKD) protocols have been proposed and some protocols are operated even in field environments. One of the striking features of QKD is that QKD…
We study the robustness of various protocols for quantum key distribution. We first consider the case of qutrits and study quantum protocols that employ two and three mutually unbiased bases. We then derive the optimal eavesdropping…
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…
We obtain strict upper bounds on the bit transmission rate for communication of Classical bit codewords over Quantum channels. Albeit previous arguments in arXiv: 1804.01797 which have demonstrated that lower bounds can be shown to hold for…
We propose an efficient four-intensity decoy-state BB84 protocol and derive concise security bounds for this protocol with the universally composable finite-key analysis method. Comparing with the efficient three-intensity protocol, we find…
We discuss the Bennett-Brassard 1984 (BB84) quantum key distribution protocol in the light of quantum algorithmic information. While Shannon's information theory needs a probability to define a notion of information, algorithmic information…
We study quantum soft covering and privacy amplification against quantum side information. The former task aims to approximate a quantum state by sampling from a prior distribution and querying a quantum channel. The latter task aims to…
In optical implementations of the phase-encoded BB84 protocol, the bit information is usually encoded in the phase of two consecutive photon pulses generated in a Mach-Zehnder interferometer. In the actual experimental realization, the loss…
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O(sqrt{n}) repetitions of the base algorithms and with high probability finds the…
Consensus is one of the most thoroughly studied problems in distributed computing, yet there are still complexity gaps that have not been bridged for decades. In particular, in the classical message-passing setting with processes' crashes,…
We compare the effect of different noise scenarios on the achievable rate of an epsilon-secure key for the BB84 and the six-state protocol. We study the situation where quantum noise is added deliberately, and investigate the remarkable…
Fuchs et al. [Phys. Rev. A, 1997] suggested an optimal attack on the BB84 protocol, where the necessary and sufficient condition for optimality involves the joint Hilbert space of the sender and the attacker. In this work, we propose a…
Continuous-variable systems protected by bosonic quantum error-correcting codes have emerged as a promising platform for quantum information processing. To date, design of codewords has centered on optimizing the occupation of basis states…
We present security proofs for a protocol for Quantum Key Distribution (QKD) based on encoding in finite high-dimensional Hilbert spaces. This protocol is an extension of Bennett's and Brassard's basic protocol from two bases, two state…
We consider error correction in quantum key distribution. To avoid that Alice and Bob unwittingly end up with different keys precautions must be taken. Before running the error correction protocol, Bob and Alice normally sacrifice some bits…
Imperfect measurement can degrade a quantum error correction scheme. A solution that restores fault tolerance is to add redundancy to the process of syndrome extraction. In this work, we show how to optimize this process for an arbitrary…
This paper studies the second-order asymptotics of the Gaussian multiple-access channel with degraded message sets. For a fixed average error probability $\varepsilon \in (0,1)$ and an arbitrary point on the boundary of the capacity region,…
In this paper we consider a three-state variant of the BB84 quantum key distribution (QKD) protocol. We derive a new lower-bound on the key rate of this protocol in the asymptotic scenario and use mismatched measurement outcomes to improve…
We propose a prepare-and-measure scheme for quantum key distribution with 2-bit quantum codes. The protocol is unconditionally secure under whatever type of intercept-and-resend attack. Given the symmetric and independent errors to the…
We consider a variant of the BB84 protocol for quantum cryptography, the prototype of tomographically incomplete protocols, where the key is generated by one-way communication rather than the usual two-way communication. Our analysis,…