Author

Niranka Banerjee

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Sep 2026

Quantum Query Complexity for List Search

This paper gives a precise characterization of when the ambient address space yields a genuine quantum advantage for linked-list search, and extends the results and gives the same tight asymptotic bounds for the natural double linked-list version as well.

Niranka Banerjee, Akinori Kawachi · arXiv.org · 0 citations