Hybrid quantum network design against unauthorized secret-key generation, and its memory cost
arXiv:1912.07548 · doi:10.1103/PhysRevResearch.2.043022
Abstract
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. [15], 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.
arXiv commentThis is the final version published in Physical Review Research. The title has been changed accordingly to the suggestions of the referee. Section VI A, has been added as suggested in the review process
References in corpus (27)
- Quantum Computing in the NISQ era and beyond
- Mixed State Entanglement and Quantum Error Correction
- A computable measure of entanglement
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
- The logarithmic negativity: A full entanglement monotone that is not convex
- General Benchmarks for Quantum Repeaters
- Fundamental Limits of Repeaterless Quantum Communications
- Mixed-state entanglement and distillation: is there a ``bound'' entanglement in nature?
- Distillation of secret key and entanglement from quantum states
- Quantum repeaters based on entanglement purification
- Efficient long distance quantum communication
- Coding Theorem and Strong Converse for Quantum Channels
- Negative entropy and information in quantum mechanics
- Secure key from bound entanglement
- Tight uniform continuity bounds for quantum entropies: conditional entropy, relative entropy distance and energy constraints
- General paradigm for distilling classical key from quantum states
- Low dimensional bound entanglement with one-way distillable cryptographic key
- Long-range big quantum-data transmission
- Limitations on Quantum Key Repeaters
- The quantum one-time pad in the presence of an eavesdropper
- Experimental Extraction of Secure Correlations from a Noisy Private State
- Private states, quantum data hiding and the swapping of perfect secrecy
- Maximal Privacy Without Coherence
- Bound entangled states with extremal properties
- Symmetric extendibility of quantum states
- On the geometric distance between quantum states with positive partial transposition and private states
- Limitations for private randomness repeaters