Role of symmetry in quantum search via continuous-time quantum walk
arXiv:2106.08398 · doi:10.1142/S2010324721400026
Abstract
For quantum search via the continuous-time quantum walk, the evolution of the whole system is usually limited in a small subspace. In this paper, we discuss how the symmetries of the graphs are related to the existence of such an invariant subspace, which also suggests a dimensionality reduction method based on group representation theory. We observe that in the one-dimensional subspace spanned by each desired basis state which assembles the identically evolving original basis states, we always get a trivial representation of the symmetry group. So we could find the desired basis by exploiting the projection operator of the trivial representation. Besides being technical guidance in this type of problem, this discussion also suggests that all the symmetries are used up in the invariant subspace and the asymmetric part of the Hamiltonian is very important for the purpose of quantum search.
arXiv comment8 pages, 5 figures
References in corpus (23)
- Quantum Mechanics helps in searching for a needle in a haystack
- Quantum random walks - an introductory overview
- Quantum Computation and Decision Trees
- A Quantum Random Walk Search Algorithm
- Universal computation by quantum walk
- Quantum walks: a comprehensive review
- Exponential algorithmic speedup by quantum walk
- Spatial search by quantum walk
- Universal quantum computation using the discrete time quantum walk
- Universal computation by multi-particle quantum walk
- Experimental Two-dimensional Quantum Walk on a Photonic Chip
- Measuring the quality of a quantum reference frame: the relative entropy of frameness
- Spatial search by quantum walk is optimal for almost all graphs
- Mimicking the probability distribution of a two-dimensional Grover walk with a single-qubit coin
- Quantum walks with infinite hitting times
- Quantum walk approach to search on fractal structures
- Global Symmetry is Unnecessary for Fast Quantum Search
- Systematic Dimensionality Reduction for Quantum Walks: Optimal Spatial Search and Transport on Non-Regular Graphs
- Connectivity is a Poor Indicator of Fast Quantum Search
- Quantum walks on quotient graphs
- Continuous-Time Quantum Search on Balanced Trees
- Quantum Walk Search on Johnson Graphs
- Controlled quantum search on structured databases