Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1611.03035 · Quantum Information Processing

Improving quantum state transfer efficiency and entanglement distribution in binary tree spin network through incomplete collapsing measurements

Naghi Behzadi, Bahram Ahansaz

Published Mar 2, 2018• 5 citations
arXivHTMLPDF
DOI
10.1007/s11128-018-1860-7

Related papers

Improved quantum state transfer via quantum partially collapsing measurements

Zhong‐Xiao Man, Nguyen Ba An, Yun‐Jie Xia

Annals of Physics•Jun 24, 2014•11 citations

Quantum state transfer between cells and binary tree model

Qi Han, Ning Bai

Physics Letters A•Oct 2, 2024•4 citations

Entanglement in the trees: Optimal entanglement distribution in binary tree quantum network topologies

Iulian Ioan Bîrlică, Alin-Bogdan Popa, Bogdan-Călin Ciobanu +2 more

Quantum entanglement is the most important resource in quantum networks, with no classical equivalent, and therefore, efficient entanglement distribution plays a key role in quantum communications and technologies. Optimal distribution of entanglement in a general network is a known hard problem. In this paper we analyze entanglement distribution via entanglement swapping in tree topologies showing how the problem can be reduced to chordal graph coloring. Our proposed solutions are mathematically sound for any tree network, providing polynomial-time optimal scheduling for entanglement distribution. The binary tree topology requires only one Bell State Measurement device per node, i.e. minimal hardware configuration, so, providing an optimal polynomial-time entanglement distribution algorithm for this topology establishes a fundamental building block that can be extended to more general tree topologies with diverse hardware setups. Through numerical simulation, we present a comprehensive analysis of the requests distribution per timeslot, optimal number of timeslots, variance, and running time, in terms of tree size, request distance bias, and parametrized balance in the tree topology construction. A complete optimality and complexity analysis is also provided.

Future Generation Computer Systems•May 15, 2026•1 citation

Achieving Load-Balanced Entanglement Distribution in Quantum Networks

Zhuoyue Chen, Kechao Cai, Jinbei Zhang +1 more

IEEE Transactions on Communications•Jan 1, 2026•0 citations

High-fidelity state transfer in binary-tree spin networks

Tommaso Tufarelli, Vittorio Giovannetti

Quantum state propagation over binary-tree configurations is studied in the context of quantum spin networks. For a binary tree of order 2, a simple protocol is presented which allows one to achieve arbitrary high transfer fidelity. It does not require fine-tuning of local fields and two-node coupling of the intermediate spins. Instead it assumes simple local operations on the intended receiving node: their role is to brake the transverse symmetry of the network that induces an effective refocusing of the propagating signals. Some ideas on how to scale up these effects to a binary tree of arbitrary order are discussed.

arXiv:0807.4030•Physical Review A•Feb 10, 2009•11 citations

Optimising the distribution of entanglement in quantum networks

Kenneth Goodenough, Stephanie Wehner, David Elkouss

Bulletin of the American Physical Society•Mar 8, 2018•0 citations
Quantum entanglement is the most important resource in quantum networks, with no classical equivalent, and therefore, efficient entanglement distribution plays a key role in quantum communications and technologies. Optimal distribution of entanglement in a general network is a known hard problem. In this paper we analyze entanglement distribution via entanglement swapping in tree topologies showing how the problem can be reduced to chordal graph coloring. Our proposed solutions are mathematically sound for any tree network, providing polynomial-time optimal scheduling for entanglement distribution. The binary tree topology requires only one Bell State Measurement device per node, i.e. minimal hardware configuration, so, providing an optimal polynomial-time entanglement distribution algorithm for this topology establishes a fundamental building block that can be extended to more general tree topologies with diverse hardware setups. Through numerical simulation, we present a comprehensive analysis of the requests distribution per timeslot, optimal number of timeslots, variance, and running time, in terms of tree size, request distance bias, and parametrized balance in the tree topology construction. A complete optimality and complexity analysis is also provided.
Quantum state propagation over binary-tree configurations is studied in the context of quantum spin networks. For a binary tree of order 2, a simple protocol is presented which allows one to achieve arbitrary high transfer fidelity. It does not require fine-tuning of local fields and two-node coupling of the intermediate spins. Instead it assumes simple local operations on the intended receiving node: their role is to brake the transverse symmetry of the network that induces an effective refocusing of the propagating signals. Some ideas on how to scale up these effects to a binary tree of arbitrary order are discussed.