On mixing in continuous-time quantum walks on some circulant graphs.
Amir AhmadiRyan BelkChristino TamonCarolyn WendlerPublished in: Quantum Inf. Comput. (2003)
Keyphrases
- least squares
- fourier transform
- markov processes
- quantum computation
- quantum inspired
- graph theory
- graph representation
- channel capacity
- graph theoretic
- graph structure
- optimal control
- markov chain
- undirected graph
- complex structures
- graph clustering
- graph structures
- graph matching
- iterative learning control
- iterative methods
- continuous time bayesian networks
- signal processing
- dynamic graph
- dynamical systems
- structured objects
- series parallel
- data sets
- graph databases