A significant number of servers that constitute the Internet are to provide private data via private communication channels to mutually anonymous registered users.Such are the servers of banks, hospitals that provide cloud storage and many others.Replacing communication channels by maximally entangled states is a promising idea for the quantum-secured Internet (QI).While it is an important idea for large distances secure communication, for the case of the mentioned class of servers pure entanglement based solution is not only unnecessary but also opens a threat.A crack stimulating a node to generate secure connections via entanglement swapping between two hackers can cause uncontrolled consumption of resources.Turning into positive a recently proven no-go result by S. Bäuml et al. [Nat. Commun. 6, 6908 (2015)], we propose a natural countermeasure against this threat.The solution bases on connections between hub-nodes and end-users realized with states that contain secure key but do not allow for swapping of this key.We then focus on the study of the quantum memory cost of such a scheme and prove a fundamental lower bound on its memory overhead.In particular, we show that to avoid the possibility of entanglement swapping, it is necessary to store at least twice as much memory than it is the case in standard quantum-repeater-based network design.For schemes employing either states with positive partial transposition that approximates certain privates states or private states hardly distinguishable from their attacked versions, we derive much tighter lower bounds on required memory.Our considerations yield upper bounds on a two-way repeater rate for states with positive partial transposition (PPT), which approximates strictly irreducible private states.As a byproduct, we provide a lower bound on the trace distance between PPT and private states, shown previously only for private bits.
A significant number of servers that constitute the Internet are to provide private data via private communication channels to mutually anonymous registered users.Such are the servers of banks, hospitals that provide cloud storage and many others.Replacing communication channels by maximally entangled states is a promising idea for the quantum-secured Internet (QI).While it is an important idea for large distances secure communication, for the case of the mentioned class of servers pure entanglement based solution is not only unnecessary but also opens a threat.A crack stimulating a node to generate secure connections via entanglement swapping between two hackers can cause uncontrolled consumption of resources.Turning into positive a recently proven no-go result by S. Bäuml et al. [Nat. Commun. 6, 6908 (2015)], we propose a natural countermeasure against this threat.The solution bases on connections between hub-nodes and end-users realized with states that contain secure key but do not allow for swapping of this key.We then focus on the study of the quantum memory cost of such a scheme and prove a fundamental lower bound on its memory overhead.In particular, we show that to avoid the possibility of entanglement swapping, it is necessary to store at least twice as much memory than it is the case in standard quantum-repeater-based network design.For schemes employing either states with positive partial transposition that approximates certain privates states or private states hardly distinguishable from their attacked versions, we derive much tighter lower bounds on required memory.Our considerations yield upper bounds on a two-way repeater rate for states with positive partial transposition (PPT), which approximates strictly irreducible private states.As a byproduct, we provide a lower bound on the trace distance between PPT and private states, shown previously only for private bits.
Quantum key repeater is the backbone of the future Quantum Internet. It is an open problem to determine, for an arbitrary mixed bipartite state shared between the stations of a quantum key repeater, how much key can be generated between its two end-nodes. We place a novel bound on the quantum key repeater rate, which uses the relative entropy distance from, in general, entangled quantum states. It allows us to generalize bounds on key repeaters of M. Christandl and R. Ferrara [Phys. Rev. Lett. 119, 220506]. As in the latter article, we consider a scenario used for measurement-device-independent quantum cryptography. The derived bound, although not tighter, holds for a more general class of states, thereby avoiding the NP-hard separability problem. We show that the repeated key of the broad class of key correlated states can exceed twice the one-way distillable entanglement by at most the max relative entropy of entanglement of its attacked version. We also provide a non-trivial upper bound on the amount of private randomness of a generic independent bit - a state containing one bit of ideal private randomness.
Two quantum links can each supply arbitrarily much secret key and still supply none to their remote endpoints through an untrusted repeater. We prove that this obstruction is exact whenever the two links are independent and have positive partial transpose (PPT), even with collective processing of all copies, two-way public communication and postselection. Every positive-probability endpoint output remains at least 1/5 in unhalved trace norm from every nonempty private state, independently of block length, local memory and shield dimension. Explicit link families therefore realise KD(ρr) → ∞ while Krep(ρr, ρr) = 0. For a network of independent edge states, let dP(a,b) count the fewest PPT edges along any terminal path. The condition dP(a,b) ≥ 2 is necessary and sufficient for the PPT labels alone to force zero endpoint key for every compatible resource assignment. The threshold is sharp: one fixed pair of eight-dimensional link resources gives positive key exactly when dP(a,b) ≤ 1. The proof transfers the four-effect inequality for local PPT maps to complete repeater operations and reduces every blocked network to two PPT boundary bundles. Combined with the known failure of the PPT-square conjecture, the result separates entanglement swapping from private connectivity: an entangled endpoint state can survive two PPT links, while secret key remains impossible. Exact Markov sources and normal local operations on separable Hilbert spaces obey corresponding extensions.
An important contribution to the understanding of quantum key distribution has been the discovery of entangled states from which secret bits, but no maximally entangled states, can be extracted [Horodecki et al., Phys. Rev. Lett. 94, 200501 (2005)PRLTAO0031-900710.1103/PhysRevLett.94.200501]. The construction of those states was based on an intuition that the quantum mechanical phenomena of data hiding and privacy might be related. In this Letter we firmly connect these two phenomena and highlight three aspects of this result. First, we simplify the definition of the secret key rate. Second, we give a formula for the one-way distillable entanglement of certain private states. Third, we consider the problem of extending the distance of quantum key distribution with help of intermediate stations, a setting called the quantum key repeater. We show that for protocols that first distill private states, it is essentially optimal to use the standard quantum repeater protocol based on entanglement distillation and entanglement swapping.
Cryptographic protocols are often based on the two main resources: private randomness and private key. In this paper, we develop the relationship between these two resources. First, we show that any state containing perfect, directly accessible, private key (a private state) is a particular case of the state containing perfect, directly accessible, private randomness (an independent state). We then demonstrate a fundamental limitation on the possibility of transferring the privacy of random bits in quantum networks with an intermediate repeater station. More precisely, we provide an upper bound on the rate of repeated randomness in this scenario, similar to the one derived for private key repeaters. This bound holds for states with positive partial transposition. We further demonstrate the power of this upper bound by showing a gap between the localizable and the repeated private randomness for separable Werner states. In the case of restricted class of operations, we provide also a bound on repeated randomness which holds for arbitrary states.
Abstract In quantum mechanics, a fundamental law prevents quantum communications to simultaneously achieve high rates and long distances. This limitation is well known for point-to-point protocols, where two parties are directly connected by a quantum channel, but not yet fully understood in protocols with quantum repeaters. Here we solve this problem bounding the ultimate rates for transmitting quantum information, entanglement and secret keys via quantum repeaters. We derive single-letter upper bounds for the end-to-end capacities achievable by the most general (adaptive) protocols of quantum and private communication, from a single repeater chain to an arbitrarily complex quantum network, where systems may be routed through single or multiple paths. We analytically establish these capacities under fundamental noise models, including bosonic loss which is the most important for optical communications. In this way, our results provide the ultimate benchmarks for testing the optimal performance of repeater-assisted quantum communications.
The emergence of sixth-generation (6G) networks presents a promising paradigm aimed at meeting stringent quality-of-service (QoS) requirements, thereby paving the way for modern applications such as the metaverse. In contrast, the advent of quantum computers poses a significant threat to the security of such networks. However, the quantum Internet signifies a remarkable advancement in communication technology, harnessing the principles of quantum entanglement and superposition to facilitate unparalleled levels of security and efficient computations. Quantum communication can be achieved through the utilization of quantum entanglement. Through the exchange of entangled pairs between two entities, quantum communication becomes feasible, enabled by the process of quantum teleportation. Given the lossy nature of the channels and the exponential decoherence of the transmitted photons, a set of intermediate nodes can serve as quantum repeaters to perform entanglement swapping and directly entangle two distant nodes. Such quantum repeaters may be malicious and by setting up malicious entanglements, intermediate nodes can jeopardize the confidentiality of the quantum information exchanged between the two communication nodes. Hence, this paper proposes a quantum identity authentication protocol that protects quantum networks from malicious entanglements. Unlike the existing protocols, the proposed quantum authentication protocol does not require periodic refreshments of the shared secret keys. Simulation results demonstrate that the proposed protocol can detect malicious entanglements with a 100% probability after an average of 4 authentication rounds. Moreover, the average number of authentication rounds required to detect an attack is reduced by 69% and 76.5% compared with benchmark protocols. Index Terms—Quantum identity authentication, quantum communications, malicious entanglement, quantum security, quantum Internet, 6G.