A exact quantum learning algorithm for the 2-junta problem in constant time
From MaRDI portal
(Redirected from Publication:2165341)
Recommendations
- An exact quantum algorithm for the 2-junta problem
- An exact quantum polynomial-time algorithm for solving \(k\)-junta problem with one uncomplemented product
- An exact quantum algorithm for testing 3-junta in Boolean functions with one uncomplemented product
- Quantum algorithms for testing and learning Boolean functions
- An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables
Cites work
- An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables
- An exact quantum algorithm for the 2-junta problem
- Efficient quantum algorithms for (gapped) group testing and junta testing
- Learning functions of \(k\) relevant variables
- Learning juntas
- Quantum algorithms for learning and testing juntas
- Quantum algorithms for testing Boolean functions
- Quantum Complexity Theory
Cited in
(4)- An exact quantum polynomial-time algorithm for solving \(k\)-junta problem with one uncomplemented product
- An exact quantum algorithm for the 2-junta problem
- An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables
- An exact quantum logarithmic time algorithm for the 3-junta problem
This page was built for publication: A exact quantum learning algorithm for the 2-junta problem in constant time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2165341)
