Sachin Kasture

Multiparticle quantum walks for distinguishing hard graphs

2025 · arXiv (Cornell University)

Quantum random walks have been shown to be powerful quantum algorithms for certain tasks on graphs like database searching, quantum simulations etc. In this work we focus on its applications for the graph isomorphism problem. …