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

Physics Letters A

Quantum state transfer between cells and binary tree model

Qi Han, Ning Bai

Published Oct 2, 2024• 4 citations
Publisher
DOI
10.1016/j.physleta.2024.129946

Related papers

Qubit Semantics and Quantum Trees

María Luisa Dalla Chiara, Roberto Giuntini, Alberto Leporati +1 more

arXiv:quant-ph/0211190•International Journal of Theoretical Physics•Jul 1, 2005•5 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

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

Naghi Behzadi, Bahram Ahansaz

arXiv:1611.03035•Quantum Information Processing•Mar 2, 2018•5 citations

Tree search and quantum computation

Luís Tarrataca, Andreas Wichert

arXiv:1502.01951•Quantum Information Processing•Nov 20, 2010•10 citations

Quantum cellular automata and quantum simulation

Peter J. Love

Bulletin of the American Physical Society•Mar 8, 2007•0 citations

Continuous-Time Quantum Walk in Glued Trees: Localized State-Mediated Almost Perfect Quantum-State Transfer

Vincent Pouthier, Lucie Pepe, Saad Yalouz

In this work, the dynamics of a quantum walker on glued trees is revisited to understand the influence of the architecture of the graph on the efficiency of the transfer between the two roots. Instead of considering regular binary trees, we focus our attention on leafier structures where each parent node could give rise to a larger number of children. Through extensive numerical simulations, we uncover a significant dependence of the transfer on the underlying graph architecture, particularly influenced by the branching rate (M) relative to the root degree (N). Our study reveals that the behavior of the walker is isomorphic to that of a particle moving on a finite-size chain. This chain exhibits defects that originate in the specific nature of both the roots and the leaves. Therefore, the energy spectrum of the chain showcases rich features, which lead to diverse regimes for the quantum-state transfer. Notably, the formation of quasi-degenerate localized states due to significant disparities between M and N triggers a localization process on the roots. Through analytical development, we demonstrate that these states play a crucial role in facilitating almost perfect quantum beats between the roots, thereby enhancing the transfer efficiency. Our findings offer valuable insights into the mechanisms governing quantum-state transfer on trees, with potential applications for the transfer of quantum information.

Entropy•Jun 2, 2024•1 citation
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.
In this work, the dynamics of a quantum walker on glued trees is revisited to understand the influence of the architecture of the graph on the efficiency of the transfer between the two roots. Instead of considering regular binary trees, we focus our attention on leafier structures where each parent node could give rise to a larger number of children. Through extensive numerical simulations, we uncover a significant dependence of the transfer on the underlying graph architecture, particularly influenced by the branching rate (M) relative to the root degree (N). Our study reveals that the behavior of the walker is isomorphic to that of a particle moving on a finite-size chain. This chain exhibits defects that originate in the specific nature of both the roots and the leaves. Therefore, the energy spectrum of the chain showcases rich features, which lead to diverse regimes for the quantum-state transfer. Notably, the formation of quasi-degenerate localized states due to significant disparities between M and N triggers a localization process on the roots. Through analytical development, we demonstrate that these states play a crucial role in facilitating almost perfect quantum beats between the roots, thereby enhancing the transfer efficiency. Our findings offer valuable insights into the mechanisms governing quantum-state transfer on trees, with potential applications for the transfer of quantum information.