Reduction of the complete bipartite graph with k edge removal for quantum walks


Introduction: In previous works, systematic dimensionality reduction for Quantum Walks has been studied for optimization of search and transport on particular graphs. The Lanczos Algorithm (LA) has been used to perform the... [ view full abstract ]


  1. Viktoria Koscinski (SUNY Polytechnic Institute)
  2. Chen-Fu Chiang (State University of New York Polytechnic Institute)

Topic Areas

Quantum information processing and computing , Quantum simulation , Fundamental science for quantum technologies


PS1 » Poster Session (13:30 - Wednesday, 5th September, Hall)

Presentation Files

The presenter has not uploaded any presentation files.