Quantum networks: Anti-core of spin chains

Abstract

The purpose of this paper is to exhibit a quantum network phenomenon - the anti-core---that goes against the classical network concept of congestion core. Classical networks idealized as infinite, Gromov hyperbolic spaces with least-cost path routing (and subject to a technical condition on the Gromov boundary) have a congestion core, defined as a subnetwork that routing paths have a high probability of visiting. Here, we consider quantum networks, more specifically spin chains, define the so-called maximum excitation transfer probability $p_{\max }(i,j)$ between spin $i$ and spin $j$, and show that the central spin has among all other spins the lowest probability of being excited or transmitting its excitation. The anti-core is singled out by analytical formulas for $p_{\max }(i,j)$, revealing the number theoretic properties of quantum chains. By engineering the chain, we further show that this probability can be made vanishingly small.

to appear in QIP

References in corpus (1)

• On the 'Polarized distances between quantum states and observables'

Cited by in corpus (7)

• Quantum state transfer in a disordered one-dimensional lattice
• Time optimal information transfer in spintronics networks
• Robust Control Performance for Open Quantum Systems
• Jonckheere-Terpstra test for nonclassical error versus log-sensitivity relationship of quantum spin network controllers
• Statistically Characterising Robustness and Fidelity of Quantum Controls and Quantum Control Algorithms
• Structured singular value analysis for spintronics network information transfer control
• Multi-fractal Geometry of Finite Networks of Spins