vix.ing · top · new · best · stats · spec

k-Boson Quantum Walks Do Not Distinguish Arbitrary Graphs

2010/04/01 by Jamie Smith, Smith, Jamie · 2 citations
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum and electron transport phenomena #Quantum-Dot Cellular Automata #quant-ph

paper · pdf · doi:10.48550/arxiv.1004.0206

5 pages

arxiv created 2010/04/01 · openalex publication_date 2010/04/01 · arxiv updated 2010/04/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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].

Cited by

Related