Nikhil Mande

Dr Nikhil Mande is a researcher at the University of Liverpool's Department of Computer Science within the School of Electrical Engineering, Electronic and Computer Science. His work bridges quantum computing and classical complexity theory, with a focus on decision trees, communication complexity, and Fourier-sparse Boolean functions.

His research includes groundbreaking work in quantum query complexity and communication complexity, supported by a Royal Society grant (2024-2026) titled "Power of Knowledge in Explorable Uncertainty." He has developed novel frameworks for comparing quantum and classical algorithms and analyzing complexity lower bounds.

• Key research outputs include studies on quantum sabotage complexity (2024), parity decision trees (2024), and randomized vs deterministic decision tree size (2023).
• His theoretical work challenges established conjectures, such as the Log-Approximate-Rank Conjecture (2020).
• He co-authored publications in venues like Quantum journal and LIPIcs conference proceedings.

Scientific awards include:

• Royal Society Grant (2024-2026)