Role of symmetry in quantum search via continuous-time quantum walk

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.

8 pages, 5 figures

References in corpus (9)

• Universal computation by quantum walk
• Exponential algorithmic speedup by quantum walk
• Spatial search by quantum walk
• Universal computation by multi-particle quantum walk
• Measuring the quality of a quantum reference frame: the relative entropy of frameness
• Mimicking the probability distribution of a two-dimensional Grover walk with a single-qubit coin
• Quantum walks with infinite hitting times
• Connectivity is a Poor Indicator of Fast Quantum Search
• Quantum walks on quotient graphs

Cited by in corpus (2)

• Perturbed graphs achieve unit transport efficiency without environmental noise
• Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems