Perfect quantum state transfer on diamond fractal graphs

In the quest for designing novel protocols for quantum information and quantum computation, an important goal is to achieve perfect quantum state transfer for systems beyond the well-known one- dimensional cases, such as 1D spin chains. We use methods from fractal analysis and probability to find a...

Full description

Saved in:
Bibliographic Details
Published in:Quantum information processing 2020-08, Vol.19 (9), Article 328
Main Authors: Derevyagin, Maxim, Dunne, Gerald V., Mograby, Gamal, Teplyaev, Alexander
Format: Article
Language:English
Subjects:
Chains
Data Structures and Information Theory
Diamond fractal
Diamonds
Fractal analysis
Fractals
Graphs
Hamiltonians with engineered couplings
Hierarchical graphs
Mathematical Physics
MATHEMATICS AND COMPUTING
Permutations
Physics
Physics and Astronomy
Quantum channels
Quantum computer
Quantum Computing
Quantum Information Technology
Quantum phenomena
Quantum Physics
Quantum state transfer
Spin chain
Spintronics
Structural hierarchy
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the quest for designing novel protocols for quantum information and quantum computation, an important goal is to achieve perfect quantum state transfer for systems beyond the well-known one- dimensional cases, such as 1D spin chains. We use methods from fractal analysis and probability to find a new class of quantum spin chains on fractal-like graphs (known as diamond fractals) which support perfect quantum state transfer and which have a wide range of different Hausdorff and spectral dimensions. The resulting systems are spin networks combining Dyson hierarchical model structure with transverse permutation symmetries of varying order.
ISSN:1570-0755
1573-1332
DOI:10.1007/s11128-020-02828-w