Spanning-tree packing yields an optimal protocol for conference key generation from pairwise QKD links in arbitrary quantum network topologies.
The Quantum Internet (Technical Version),
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
fields
quant-ph 4representative citing papers
HOPPER is a novel asynchronous protocol for quantum entanglement distribution that uses hop-by-hop autonomous decisions to multiplex concurrent ebit requests, outperforming synchronous serial approaches in simulations.
Upper bounds on distillable conference key in pair-entangled networks are derived depending on topology and entanglement, with tightness proven and optimality of pairwise distillation plus merging shown for specific cases.
The authors prove existence of a unitary that maps a two-qubit state to one where a single observable expectation equals the initial concurrence and demonstrate a robust optimal control implementation via numerical simulations.
citing papers explorer
-
Spanning-tree-packing protocol for conference key propagation in quantum networks
Spanning-tree packing yields an optimal protocol for conference key generation from pairwise QKD links in arbitrary quantum network topologies.
-
HOPPER: A Hop-by-hop Entanglement Distribution Protocol for Asynchronous Quantum Networks
HOPPER is a novel asynchronous protocol for quantum entanglement distribution that uses hop-by-hop autonomous decisions to multiplex concurrent ebit requests, outperforming synchronous serial approaches in simulations.
-
Bounds on quantum conference key agreement in pair-entangled networks
Upper bounds on distillable conference key in pair-entangled networks are derived depending on topology and entanglement, with tightness proven and optimality of pairwise distillation plus merging shown for specific cases.
-
Existence of a robust optimal control process for efficient measurements in a two-qubit system
The authors prove existence of a unitary that maps a two-qubit state to one where a single observable expectation equals the initial concurrence and demonstrate a robust optimal control implementation via numerical simulations.