6 citations · 24 across the 17 of their papers we have counts for
29 papers
Optimal Quantum-Classical Separations for Exact Learning
Srinivasan Arunachalam, Amin Shiraz Gilani, Nikhil S. Mande
We study exact learning with membership queries for concept classes , focusing on the relationships among their deterministic, randomized, and quantum…
Subcube Stifling
Arjan Cornelissen, Nikhil S. Mande, Nithish Raja
We introduce the subcube stifling number, a new combinatorial measure of total Boolean functions. This measure is the largest integer such that, for every set of at most $k…
Quantum Search With Generalized Wildcards
Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro +2
In the search with wildcards problem [Ambainis, Montanaro, Quantum Inf.~Comput.'14], one's goal is to learn an unknown bit-string . An algorithm may, at unit cost…
Complexity of learning matchings and half graphs via edge queries
Nikhil S. Mande, Swagato Sanyal, Viktor Zamaraev
The problem of learning or reconstructing an unknown graph from a known family via partial-information queries arises as a mathematical model in various contexts. The most basic ty…
Sensitivity and Query Complexity under Uncertainty
Deepu Benson, Balagopal Komarath, Nikhil Mande +3
In this paper, we study the query complexity of Boolean functions in the presence of uncertainty, motivated by parallel computation with an unlimited number of processors where inp…
Hardness of Finding Kings and Strong Kings
Ziad Ismaili Alaoui, Nikhil S. Mande
A king in a directed graph is a vertex such that every other vertex is reachable from via a path of length at most . It is well known that every tournament (a complete g…
Query Complexity with Unknowns
Nikhil S. Mande, Karteek Sreenivasaiah
We initiate the study of a new model of query complexity of Boolean functions where, in addition to 0 and 1, the oracle can answer queries with ``unknown''. The query algorithm is…
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…
On the communication complexity of finding a king in a tournament
Nikhil S. Mande, Manaswi Paraashar, Swagato Sanyal +1
A tournament is a complete directed graph. A king in a tournament is a vertex v such that every other vertex is reachable from v via a path of length at most 2. It is well known th…
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…
Instance complexity of Boolean functions
Alison Hsiang-Hsuan Liu, Nikhil S. Mande
In the area of query complexity of Boolean functions, the most widely studied cost measure of an algorithm is the worst-case number of queries made by it on an input. Motivated by…
Randomized and quantum query complexities of finding a king in a tournament
Nikhil S. Mande, Manaswi Paraashar, Nitin Saurabh
A tournament is a complete directed graph. It is well known that every tournament contains at least one vertex v such that every other vertex is reachable from v by a path of lengt…
Solving Odd-Fair Parity Games
Irmak Sağlam, Anne-Kathrin Schmuck
This paper discusses the problem of efficiently solving parity games where player Odd has to obey an additional 'strong transition fairness constraint' on its vertices -- given tha…
Tight Bounds for Quantum Phase Estimation and Related Problems
Nikhil S. Mande, Ronald de Wolf
Phase estimation, due to Kitaev [arXiv'95], is one of the most fundamental subroutines in quantum computing. In the basic scenario, one is given black-box access to a unitary ,…
Lifting to Parity Decision Trees Via Stifling
Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal +1
We show that the deterministic decision tree complexity of a (partial) function or relation lifts to the deterministic parity decision tree (PDT) size complexity of the compose…
Improved Quantum Query Upper Bounds Based on Classical Decision Trees
Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro
Given a classical query algorithm as a decision tree, when does there exist a quantum query algorithm with a speed-up over the classical one? We provide a general construction base…
Exact quantum query complexity of computing Hamming weight modulo powers of two and three
Arjan Cornelissen, Nikhil S. Mande, Maris Ozols +1
We study the problem of computing the Hamming weight of an -bit string modulo , for any positive integer whose only prime factors are 2 and 3. We show that the exa…
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error
Olivier Lalonde, Nikhil S. Mande, Ronald de Wolf
We investigate the randomized and quantum communication complexities of the well-studied Equality function with small error probability , getting optimal constant factors in the…
One-way communication complexity and non-adaptive decision trees
Nikhil S. Mande, Swagato Sanyal, Suhail Sherif
We study the relationship between various one-way communication complexity measures of a composed function with the analogous decision tree complexity of the outer function. We con…
The Role of Symmetry in Quantum Query-to-Communication Simulation
Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer +3
Buhrman, Cleve and Wigderson (STOC'98) showed that for every Boolean function f : {-1,1}^n to {-1,1} and G in {AND_2, XOR_2}, the bounded-error quantum communication complexity of…
Tight Chang's-lemma-type bounds for Boolean functions
Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal +3
Chang's lemma (Duke Mathematical Journal, 2002) is a classical result with applications across several areas in mathematics and computer science. For a Boolean function that ta…
On parity decision trees for Fourier-sparse Boolean functions
Nikhil S. Mande, Swagato Sanyal
We study parity decision trees for Boolean functions. The motivation of our study is the log-rank conjecture for XOR functions and its connection to Fourier analysis and parity dec…
Improved Approximate Degree Bounds For k-distinctness
Nikhil S. Mande, Justin Thaler, Shuchen Zhu
An open problem that is widely regarded as one of the most important in quantum query complexity is to resolve the quantum query complexity of the k-distinctness function on inputs…
Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead
Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande +1
Buhrman, Cleve and Wigderson (STOC'98) observed that for every Boolean function and the two-party bounded-erro…