Entanglement distribution based on quantum walk in arbitrary quantum networks
Tianen Chen, Yun Shang, Chitong Chen, Heng Fan

TL;DR
This paper proposes a novel method for distributing high-dimensional entangled states across arbitrary quantum networks using quantum walks, with practical implementations and experimental validation on superconducting processors.
Contribution
It introduces modules for high-dimensional entanglement distribution via quantum walks and a scheme for arbitrary network distribution, including experimental demonstrations.
Findings
Quantum walk modules enable high-dimensional entanglement distribution.
Distribution scheme works on arbitrary quantum networks using Steiner trees.
Experimental validation achieved on superconducting quantum processors.
Abstract
In large-scale quantum networks, quantum repeaters provide an efficient method to distribute entangled states among selected nodes for realizing long-distance and complicated quantum communications. However, extending quantum repeater protocols to high-dimensional quantum states in existing experiments is not easy. Owing to the feasible physical implementations of quantum walks, we proposed various basic modules applicable to quantum repeaters for distributing high-dimensional entangled states via quantum walks, including -dimensional Bell states and multi-particle -dimensional GHZ states. Furthermore, based on the above schemes, we provided a high-dimensional entanglement distribution scheme for arbitrary quantum tree networks. By searching for a Steiner tree in a quantum network, we can achieve high-dimensional entanglement distributions over an arbitrary quantum network. We…
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography
