Quantum networks: anti-core of spin chains

From MaRDI portal
Publication:479435

DOI10.1007/S11128-014-0755-5zbMATH Open1303.81036arXiv1403.0159OpenAlexW3104297070MaRDI QIDQ479435FDOQ479435


Authors: Edmond Jonckheere, Frank C. Langbein, S. G. Schirmer Edit this on Wikidata


Publication date: 5 December 2014

Published in: Quantum Information Processing (Search for Journal in Brave)

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 pmax(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 pmathrmmax(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.


Full work available at URL: https://arxiv.org/abs/1403.0159




Recommendations




Cites Work


Cited In (3)





This page was built for publication: Quantum networks: anti-core of spin chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479435)