An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables

DOI10.1007/s11128-020-02711-8OpenAlexW3035497829MaRDI QIDQ2681549

Chien-Yuan Chen

Publication date: 3 February 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-020-02711-8

zbMATH Keywords

quantum algorithmBernstein-Vazirani algorithmquantum learning algorithm

Mathematics Subject Classification ID

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

Related Items (5)

A exact quantum learning algorithm for the 2-junta problem in constant time ⋮ An exact quantum algorithm for testing 3-junta in Boolean functions with one uncomplemented product ⋮ An exact quantum algorithm for the 2-junta problem ⋮ Solving Bernstein and Vazirani's problem with the 2-bit permutation function ⋮ An exact quantum polynomial-time algorithm for solving \(k\)-junta problem with one uncomplemented product

Cites Work

• Quantum algorithms for learning and testing juntas
• Learning juntas
• Quantum Complexity Theory
• Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing
• Quantum algorithms for testing and learning Boolean functions

This page was built for publication: An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables