We propose the adaptive multicarrier quadrature division–multiuser quadrature allocation (AMQD-MQA) multiple access technique for continuous-variable quantum key distribution (CVQKD). The MQA scheme is based on the AMQD modulation, which granulates the inputs of the users into Gaussian subcarrier continuous-variables (CVs). The subcarrier coherent states formulate Gaussian sub-channels from the...

We introduce the multidimensional manifold extraction for multicarrier continuousvariable (CV) quantum key distribution (QKD). The manifold extraction utilizes the resources that are injected into the transmission by the additional degrees of freedom of the multicarrier modulation. We demonstrate the results through the AMQD (adaptive multicarrier quadrature division) scheme, which granulates t...

Quantum Key Distribution (QKD) networks are of much interest due to their capacity of providing extremely high security keys to network participants. Most QKD network studies so far focus on trusted models where all the network nodes are assumed to be perfectly secured. This restricts QKD networks to be small. In this paper, we first develop a novel model dedicated to large-scale QKD networks, ...

In 2005, trace distance between an ideal quantum state to be distributed and an actually distributed quantum state was introduced as a valid security measure of Quantum Key Distribution (QKD) by R. Renner et al., then it has been perceived that the trace can be interpreted as a maximum failure probability of QKD. While such a perspective has been widely accepted, H. P. Yuen and O. Hirota have b...

The Quantum Key Distribution (QKD) protocol BB84 has been proven secure against several important types of attacks: the collective attacks and the joint attacks. Here we analyze the security of a modified BB84 protocol, for which information is sent only in the z basis while testing is done in both the z and the x bases, against collective attacks. The proof follows the framework of a previous ...

We consider the problem of secure key distribution among n trustful agents: the goal is to distribute an identical random bit-string among the n agents over a noisy channel such that eavesdroppers learn little about it. We study the general situation where the only resources required are secure bipartite key distribution and authenticated classical communication. Accordingly, multipartite quant...

Quantum key distribution is among the foremost applications of quantum mechanics, both in terms of fundamental physics and as a technology on the brink of commercial deployment. Starting from principal schemes and initial proofs of unconditional security for perfect systems, much effort has gone into providing secure schemes which can cope with numerous experimental imperfections unavoidable in...

E.O. Kiktenko, 2, 3 N.O. Pozhar, 3 A.V. Duplinskiy, 4 A.A. Kanapin, 5 A.S. Sokolov, S.S. Vorobey, A.V. Miller, V.E. Ustimchik, M.N. Anufriev, 3 A.S. Trushechkin, R.R. Yunusov, V.L. Kurochkin, Y.V. Kurochkin, and A.K. Fedorov ∗ Russian Quantum Center, Skolkovo, Moscow 143025, Russia Steklov Mathematical Institute of Russian Academy of Sciences, Moscow 119991, Russia Bauman Moscow State Technical...

We propose a proof of the security of EPR-based quantum key distribution against enemies with unlimited computational power. The proof holds for a protocol using interactive error-reconciliation scheme. We assume in this paper that the legitimate parties receive a given number of single photon signals and that their measurement devices are perfect.

Based on the controlled order rearrange encryption (CORE) for quantum key distribution using EPR pairs[Fu.G.Deng and G.L.Long Phys.Rev.A68 (2003) 042315], we propose the generalized controlled order rearrangement encryption (GCORE) protocols of N qubits and N qutrits, concretely display them in the cases using 3-qubit, 2-qutrit maximally entangled basis states. We further indicate that our prot...