2000 character limit reached
k-Boson Quantum Walks Do Not Distinguish Arbitrary Graphs
Published 1 Apr 2010 in quant-ph | (1004.0206v1)
Abstract: In this paper, we define k-equivalence, a relation on graphs that relies on their associated cellular algebras. We show that a k-Boson quantum walk cannot distinguish pairs of graphs that are k- equivalent. The existence of pairs of k-equivalent graphs has been shown by Ponomarenko et al. [2, 6]. This gives a negative answer to a question posed by Gamble et al. [7].
Paper Prompts
Sign up for free to create and run prompts on this paper.