6 citations · 24 across the 17 of their papers we have counts for
Showing 2024 · quant-phShow all
2 papers · 2 filters
quant-ph2024
Quantum Sabotage Complexity
Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro
Given a Boolean function , the goal in the usual query model is to compute on an unknown input while minimizing the number of queries t…
quant-ph2024★ 1 cited
Lower bounds for quantum-inspired classical algorithms via communication complexity
Nikhil S. Mande, Changpeng Shao
Quantum-inspired classical algorithms provide us with a new way to understand the computational power of quantum computers for practically-relevant problems, especially in machine…