Quantum Algorithms for Learning Symmetric Juntas via the Adversary Bound
In this paper, we study the following variant of the junta learning problem. We are given oracle access to a Boolean function f on n variables that only depends on k variables, and, when restricted to them, equals some predefined function h. The task is to identify the variables the function depends...
Main Author: | Belovs, Aleksandrs |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Springer Basel
2017
|
Online Access: | http://hdl.handle.net/1721.1/106915 |
Similar Items
-
Adversary lower bounds for the collision and the set equality problems
by: Belovs, Aleksandrs, et al.
Published: (2020) -
Quantum Lower Bound for Inverting a Permutation with Advice
by: Nayebi, Aran, et al.
Published: (2015) -
Junta Correlation is Testable
by: De, Anindya, et al.
Published: (2021) -
Learning and testing junta distributions over hypercubes
by: Aliakbarpour, Maryam
Published: (2016) -
Kedudukan Myanmar tanpa junta
by: Kari, Nurul Anuar
Published: (2011)