Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing

SODA '16: Symposium on Discrete Algorithms Arlington Virginia January, 2016, pp. 903-922, 2015.

Cited by: 16|Bibtex|Views31|Links
EI

Abstract:

In the k-junta testing problem, a tester has to efficiently decide whether a given function f: {0, 1}n → {0, 1} is a k-junta (i.e., depends on at most fc of its input bits) or is ε-far from any k-junta. Our main result is a quantum algorithm for this problem with query complexity Õ([EQUATION]) and time complexity Õ(n[EQUATION]). This quad...More

Code:

Data:

Your rating :
0

 

Tags
Comments