An exact quantum polynomial-time algorithm for solving k-junta problem with one uncomplemented product

DOI10.1007/S10773-022-04990-6OpenAlexW4220761777MaRDI QIDQ2118738FDOQ2118738

Authors Chien-Yuan Chen 

Publication date 23 March 2022

Published in International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10773-022-04990-6

zbMATH Keywords

machine learningquantum algorithmsBernstein-Vazirani algorithmquantum learning algorithmjunta problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• An exact quantum algorithm for testing 3-junta in Boolean functions with one uncomplemented product
• An exact quantum algorithm for the 2-junta problem
• A exact quantum learning algorithm for the 2-junta problem in constant time
• An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables
• Quantum algorithms for learning symmetric juntas via the adversary bound

Cites work

• An exact quantum algorithm for testing 3-junta in Boolean functions with one uncomplemented product
• An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables
• Efficient quantum algorithms for (gapped) group testing and junta testing
• Learning functions of \(k\) relevant variables
• Learning juntas
• Quantum Complexity Theory
• Quantum algorithms for learning and testing juntas
• Quantum algorithms for testing Boolean functions

Cited in

(9)

• An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables
• An exact quantum algorithm for the 2-junta problem
• Quantum algorithms for learning and testing juntas
• An exact quantum algorithm for testing 3-junta in Boolean functions with one uncomplemented product
• Quantum learning of concentrated Boolean functions
• An exact quantum logarithmic time algorithm for the 3-junta problem
• Efficient quantum algorithms for (gapped) group testing and junta testing
• A exact quantum learning algorithm for the 2-junta problem in constant time
• Quantum algorithms for learning symmetric juntas via the adversary bound

This page was built for publication: An exact quantum polynomial-time algorithm for solving \(k\)-junta problem with one uncomplemented product

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118738)