Quantum walk on a chimera graph
arXiv:1705.11036 · doi:10.1088/1367-2630/aab701
Abstract
We analyze a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum-walk features such as localization that starkly distinguishes classical from quantum behavior. Motivated by technological thrusts, we study continuous-time quantum walks on enhanced variants of the chimera graph and on a diminished chimera graph with a random removal of sites. We explain the quantum walk by constructing a generating set for a suitable subgroup of graph isomorphisms and corresponding symmetry operators that commute with the quantum-walk Hamiltonian; the Hamiltonian and these symmetry operators provide a complete set of labels for the spectrum and the stationary states. Our quantum-walk characterization of the chimera graph and its variants yields valuable insights into graphs used for designing quantum-annealers.
References in corpus (14)
- Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
- Universal computation by quantum walk
- Spatial search by quantum walk
- Exploring Topological Phases With Quantum Walks
- Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
- Symmetries, Topological Phases and Bound States in the One-Dimensional Quantum Walk
- A random walk approach to quantum algorithms
- Centrality measure based on continuous-time quantum walks and experimental realization
- Quantum walk transport properties on graphene structures
- Strongly trapped two-dimensional quantum walks
- Full Characterization of Oscillatory Localization of Quantum Walks
- Oscillatory Localization of Quantum Walks Analyzed by Classical Electric Circuits
- Localization and Fractality in Inhomogeneous Quantum Walks with Self-Duality
- Random Walks on Complex Networks