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

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

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)

Cites Work

• Learning juntas
• Quantum Complexity Theory
• Learning functions of \(k\) relevant variables
• Quantum algorithms for learning and testing juntas
• Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing
• Title not available (Why is that?)
• 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

Cited In (2)

• 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

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)