How to suppress dark states in quantum networks and bio-engineered structures
From MaRDI portal
Publication:4689536
DOI10.1088/1751-8121/aad3e6zbMath1397.81053arXiv1707.07482OpenAlexW2738466886WikidataQ59450954 ScholiaQ59450954MaRDI QIDQ4689536
Simone Severini, Thao P. le, Ludovica Donati, Filippo Caruso
Publication date: 16 October 2018
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.07482
Network design and communication in computer systems (68M10) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Systems biology, networks (92C42) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items
Survival probability of the Grover walk on the ladder graph, Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices
Cites Work
- Unnamed Item
- The nowhere-zero eigenbasis problem for a graph
- Controllable subsets in graphs
- Symmetry principles in quantum systems theory
- On a Conjecture of Godsil Concerning Controllable Random Graphs
- Statistical mechanics of complex networks
- Spatial search and the Dirac equation
- Stochastic Resonance Phenomena in Quantum Many-Body Systems
- CONTINUOUS-TIME QUANTUM WALKS AND TRAPPING
- PERFECT, EFFICIENT, STATE TRANSFER AND ITS APPLICATION AS A CONSTRUCTIVE TOOL
- Performance Analysis of Communications Networks and Systems
- COMMUNICATION IN XYZ ALL-TO-ALL QUANTUM NETWORKS WITH A MISSING LINK
- Theoretical framework for quantum networks
- Universally optimal noisy quantum walks on complex networks
- Quantum walks and search algorithms