Perfect quantum state transfer on diamond fractal graphs

September 18, 2019 ยท Declared Dead ยท ๐Ÿ› Quantum Information Processing

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Maxim Derevyagin, Gerald V. Dunne, Gamal Mograby, Alexander Teplyaev arXiv ID 1909.08668 Category math-ph Cross-listed cs.IT, math.FA, math.SP, quant-ph Citations 29 Venue Quantum Information Processing Last Checked 1 month ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” math-ph

Died the same way โ€” ๐Ÿ‘ป Ghosted