Ask a Question

Prefer a chat interface with context about you and your work?

Noninteracting multiparticle quantum random walks applied to the graph isomorphism problem for strongly regular graphs

Noninteracting multiparticle quantum random walks applied to the graph isomorphism problem for strongly regular graphs

We investigate the quantum dynamics of particles on graphs (``quantum random walks''), with the aim of developing quantum algorithms for determining if two graphs are isomorphic (related to each other by a relabeling of vertices). We focus on quantum random walks of multiple noninteracting particles on strongly regular graphs (SRGs), …