Abstract
To utilize a scalable quantum network and perform a quantum state transfer within distant arbitrary nodes, coherence and control of the dynamics of couplings between the information units must be achieved as a prerequisite ingredient for quantum information processing within a hierarchical structure. Graph theoretic approach provides a powerful tool for the characterization of quantum networks with non-trivial clustering properties. By encoding the topological features of the underlying quantum graphs, relations between the quantum complexity measures are presented revealing the intricate links between a quantum and a classical networks dynamics.
Reference29 articles.
1. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
2. Quantum Neural Computing
3. Töth G., Lent C.S., Tougaw P.D., Brazhnik Y., Weng W., Porod W., Liu R.W., Huang Y.F., arXiv preprint cond-mat/0005038 (2000)
4. Penrose R.: Applications of negative dimensional tensors, in Combinatorial Mathematics and its Applications, Academic Press (1971)