Hybrid quantum network design against unauthorized secret-key generation, and its memory cost (original) (raw)

Secret key rates for an encoded quantum repeater

Physical Review A

We investigate secret key rates for the quantum repeater using encoding [L. Jiang et al., Phys. Rev. A 79, 032325 (2009)] and compare them to the standard repeater scheme by Briegel, D\"ur, Cirac, and Zoller. The former scheme has the advantage of a minimal consumption of classical communication. We analyze the trade-off in the secret key rate between the communication time and the required resources. For this purpose, we introduce an error model for the repeater using encoding which allows for input Bell states with a fidelity smaller than one, in contrast to the model given in [L. Jiang et al., Phys. Rev. A 79, 032325 (2009)]. We show that one can correct additional errors in the encoded connection procedure of this repeater and develop a suitable decoding algorithm. Furthermore, we derive the rate of producing entangled pairs for the quantum repeater using encoding and give the minimal parameters (gate quality and initial fidelity) for establishing a nonzero secret key. We f...

Security Bounds for Efficient Decoy-State Quantum Key Distribution

IEEE Journal of Selected Topics in Quantum Electronics, 2015

Information-theoretical security of quantum key distribution (QKD) has been convincingly proven in recent years and remarkable experiments have shown the potential of QKD for real world applications. Due to its unique capability of combining high key rate and security in a realistic finite-size scenario, the efficient version of the BB84 QKD protocol endowed with decoy states has been subject of intensive research. Its recent experimental implementation finally demonstrated a secure key rate beyond 1 Mbps over a 50 km optical fiber. However the achieved rate holds under the restrictive assumption that the eavesdropper performs collective attacks. Here, we review the protocol and generalize its security. We exploit a map by Ahrens to rigorously upper bound the Hypergeometric distribution resulting from a general eavesdropping. Despite the extended applicability of the new protocol, its key rate is only marginally smaller than its predecessor in all cases of practical interest.

Private quantum channels and the cost of randomizing quantum information

Arxiv preprint quant-ph/0003101, 2000

We investigate how a classical private key can be used by two players, connected by an insecure one-way quantum channel, to perform private communication of quantum information. In particular we show that in order to transmit n qubits privately, 2n bits of shared private key are necessary and sufficient. This result may be viewed as the quantum analogue of the classical one-time pad encryption scheme. From the point of view of the eavesdropper, this encryption process can be seen as a randomization of the original state. We thus also obtain strict bounds on the amount of entropy necessary for randomizing n qubits.

Quantum key distribution over probabilistic quantum repeaters

Physical Review A, 2010

A feasible route towards implementing long-distance quantum key distribution (QKD) systems relies on probabilistic schemes for entanglement distribution and swapping as proposed in the work of Duan, Lukin, Cirac, and Zoller (DLCZ) [Nature 414, 413 (2001)]. Here, we calculate the conditional throughput and fidelity of entanglement for DLCZ quantum repeaters, by accounting for the DLCZ self-purification property, in the presence of multiple excitations in the ensemble memories as well as loss and other sources of inefficiency in the channel and measurement modules. We then use our results to find the generation rate of secure key bits for QKD systems that rely on DLCZ quantum repeaters. We compare the key generation rate per logical memory employed in the two cases of with and without a repeater node. We find the cross-over distance beyond which the repeater system outperforms the non-repeater one. That provides us with the optimum inter-node distancing in quantum repeater systems. We also find the optimal excitation probability at which the QKD rate peaks. Such an optimum probability, in most regimes of interest, is insensitive to the total distance.

Securing quantum key distribution systems using fewer states

Physical Review A, 2018

Quantum key distribution (QKD) allows two remote users to establish a secret key in the presence of an eavesdropper. The users share quantum states prepared in two mutually-unbiased bases: one to generate the key while the other monitors the presence of the eavesdropper. Here, we show that a general d-dimension QKD system can be secured by transmitting only a subset of the monitoring states. In particular, we find that there is no loss in the secure key rate when dropping one of the monitoring states. Furthermore, it is possible to use only a single monitoring state if the quantum bit error rates are low enough. We apply our formalism to an experimental d = 4 timephase QKD system, where only one monitoring state is transmitted, and obtain a secret key rate of 17.4 ± 2.8 Mbits/s at a 4 dB channel loss and with a quantum bit error rate of 0.045 ± 0.001 and 0.037 ± 0.001 in time and phase bases, respectively, which is 58.4% of the secret key rate that can be achieved with the full setup. This ratio can be increased, potentially up to 100%, if the error rates in time and phase basis are reduced. Our results demonstrate that it is possible to substantially simplify the design of high-dimensional QKD systems, including those that use the spatial or temporal degrees-of-freedom of the photon, and still outperform qubit-based (d = 2) protocols.

Private quantum channels

Proceedings 41st Annual Symposium on Foundations of Computer Science, 2000

We investigate how a classical private key can be used by two players, connected by an insecure one-way quantum channel, to perform private communication of quantum information. In particular we show that in order to transmit n qubits privately, 2n bits of shared private key are necessary and sufficient. This result may be viewed as the quantum analogue of the classical one-time pad encryption scheme.

Long-distance practical quantum key distribution by entanglement swapping

Optics Express, 2011

We develop a model for practical, entanglement-based longdistance quantum key distribution employing entanglement swapping as a key building block. Relying only on existing off-the-shelf technology, we show how to optimize resources so as to maximize secret key distribution rates. The tools comprise lossy transmission links, such as telecom optical fibers or free space, parametric down-conversion sources of entangled photon pairs, and threshold detectors that are inefficient and have dark counts. Our analysis provides the optimal trade-off between detector efficiency and dark counts, which are usually competing, as well as the optimal source brightness that maximizes the secret key rate for specified distances (i.e. loss) between sender and receiver. Practical decoy state for quantum key distribution," Phys. Rev. A 72, 012326 (2005). 21. X.-B. Wang, "Decoy-state protocol for quantum cryptography with four different intensities of coherent light," Phys. Rev. A 72, 012322 (2005). 22. Y. Zhao, B. Qi, X. Ma, H.-K. Lo, and L. Qian, "Experimental Quantum Key Distribution with Decoy States," Phys. Rev. Lett. 96, 070502 (2006). 23. N. Lütkenhaus, "Security against individual attacks for realistic quantum key distribution," Phys. Rev. A 61, 052304 (2000). 24. l.-M. Duan, M. D. Lukin, J. I. Cirac, and P. Zoller, "Long-distance quantum communication with atomic ensembles and linear optics," Nature 414, 413-418, 2001. 25. J. B. Brask and A. S. Sørensen, "Memory imperfections in atomic-ensemble-based quantum repeaters," Phys. Rev. A 78, 012350 (2008). 26. L. Jiang, J. M. Taylor, and M. D. Lukin, "Fast and robust approach to long-distance quantum communication with atomic ensembles," Phys. Rev. A 76, 012301 (2007). -W. Pan, "Robust creation of entanglement between remote memory qubits," Phys. Rev. Lett. 98, 240502 (2007). 28. J. B. Brask, L. Jiang, A. V. Gorshkov, V. Vuletic, A. S. Sørensen, and M. D. Lukin "Fast entanglement distribution with atomic ensembles and fluorescent detection," Phys. Rev. A 81, 020303(R) (2010). 29. J. Amirloo, M. Razavi, and A. H. Majedi, "

Continuous Variable Quantum Cryptography: Beating the 3 dB Loss Limit

Physical Review Letters, 2002

We demonstrate that secure quantum key distribution systems based on continuous variables implementations can operate beyond the apparent 3 dB loss limit that is implied by the beam splitting attack . The loss limit was established for standard minimum uncertainty states such as coherent states. We show that by an appropriate postselection mechanism we can enter a region where Eve's knowledge on Alice's key falls behind the information shared between Alice and Bob even in the presence of substantial losses.

Fundamental limits of repeaterless quantum communications

Nature communications, 2017

Quantum communications promises reliable transmission of quantum information, efficient distribution of entanglement and generation of completely secure keys. For all these tasks, we need to determine the optimal point-to-point rates that are achievable by two remote parties at the ends of a quantum channel, without restrictions on their local operations and classical communication, which can be unlimited and two-way. These two-way assisted capacities represent the ultimate rates that are reachable without quantum repeaters. Here, by constructing an upper bound based on the relative entropy of entanglement and devising a dimension-independent technique dubbed 'teleportation stretching', we establish these capacities for many fundamental channels, namely bosonic lossy channels, quantum-limited amplifiers, dephasing and erasure channels in arbitrary dimension. In particular, we exactly determine the fundamental rate-loss tradeoff affecting any protocol of quantum key distribut...