38 citations · 157 across the 44 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2022
Influence in Completely Bounded Block-multilinear Forms and Classical Simulation of Quantum Algorithms
Nikhil Bansal, Makrand Sinha, Ronald de Wolf
The Aaronson-Ambainis conjecture (Theory of Computing '14) says that every low-degree bounded polynomial on the Boolean hypercube has an influential variable. This conjecture, if t…
quant-ph2020
-Forrelation Optimally Separates Quantum and Classical Query Complexity
Nikhil Bansal, Makrand Sinha
Aaronson and Ambainis (SICOMP `18) showed that any partial function on bits that can be computed with an advantage over a random guess by making quantum queries, can al…
quant-ph2007★ 2 cited
Classical approximation schemes for the ground-state energy of quantum and classical Ising spin Hamiltonians on planar graphs
Nikhil Bansal, Sergey Bravyi, Barbara M. Terhal
We describe an efficient approximation algorithm for evaluating the ground-state energy of the classical Ising Hamiltonian with linear terms on an arbitrary planar graph. The runni…