65 citations · 154 across the 13 of their papers we have counts for
Showing 2007 · quant-phShow all
2 papers · 2 filters
quant-ph2007★ 28 cited
A nearly optimal discrete query quantum algorithm for evaluating NAND formulas
Andris Ambainis
We present an O(\sqrt{N}) discrete query quantum algorithm for evaluating balanced binary NAND formulas and an O(N^{{1/2}+O(\frac{1}{\sqrt{\log N}})}) discrete query quantum algori…
quant-ph2007
Quantum t-designs: t-wise independence in the quantum world
Andris Ambainis, Joseph Emerson
A t-design for quantum states is a finite set of quantum states with the property of simulating the Haar-measure on quantum states, w.r.t. any test that uses at most t copies of a…