Quantum networks: anti-core of spin chains

Jonckheere, E., Langbein, F. C. ORCID: https://orcid.org/0000-0002-3379-0323 and Schirmer, S. 2014. Quantum networks: anti-core of spin chains. Quantum Information Processing 13 , pp. 1607-1637. 10.1007/s11128-014-0755-5

Full text not available from this repository.

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.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Schools > Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QC Physics
Publisher:	Springer Verlag
ISSN:	1570-0755
Date of Acceptance:	6 May 2014
Last Modified:	31 Oct 2022 08:59
URI:	https://orca.cardiff.ac.uk/id/eprint/79389

Citation Data

Cited 8 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item