Quantum linear network coding for entanglement distribution in restricted architectures
Niel de Beaudrap, Steven Herbert

TL;DR
This paper introduces a quantum linear network coding method for efficient entanglement distribution across constrained quantum networks, enabling parallel Bell and GHZ state sharing with low-depth circuits.
Contribution
It adapts classical network coding techniques to quantum entanglement distribution, achieving parallel state sharing with constant quantum circuit depth regardless of network size.
Findings
Enables parallel entanglement distribution in constrained networks.
Achieves low quantum circuit depth independent of network size.
Generalizes to qudits of any prime dimension.
Abstract
In this paper we propose a technique for distributing entanglement in architectures in which interactions between pairs of qubits are constrained to a fixed network . This allows for two-qubit operations to be performed between qubits which are remote from each other in , through gate teleportation. We demonstrate how adapting \emph{quantum linear network coding} to this problem of entanglement distribution in a network of qubits can be used to solve the problem of distributing Bell states and GHZ states in parallel, when bottlenecks in would otherwise force such entangled states to be distributed sequentially. In particular, we show that by reduction to classical network coding protocols for the -pairs problem or multiple multicast problem in a fixed network , one can distribute entanglement between the transmitters and receivers with a Clifford circuit whose quantum…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
