An exact quantum logarithmic time algorithm for the 3-junta problem
From MaRDI portal
Publication:6566204
DOI10.1007/S11128-024-04402-0zbMATH Open1542.68066MaRDI QIDQ6566204
Publication date: 3 July 2024
Published in: Quantum Information Processing (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Learning functions of \(k\) relevant variables
- A exact quantum learning algorithm for the 2-junta problem in constant time
- An exact quantum algorithm for the 2-junta problem
- Quantum algorithms for learning and testing juntas
- An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables
- An exact quantum algorithm for testing 3-junta in Boolean functions with one uncomplemented product
- Learning juntas
- Quantum Complexity Theory
- Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing
- 10.1162/153244303322753616
This page was built for publication: An exact quantum logarithmic time algorithm for the 3-junta problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566204)