Quantum algorithms for testing Boolean functions
From MaRDI portal
Recommendations
- Quantum algorithms for testing and learning Boolean functions
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions
- An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables
- Boolean functions identification via quantum computing methods
Cited in
(17)- Quantum cryptographic property testing of multi-output Boolean functions
- 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
- A exact quantum learning algorithm for the 2-junta problem in constant time
- Quantum algorithms for the resiliency of vectorial Boolean functions
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- An exact quantum algorithm for testing 3-junta in Boolean functions with one uncomplemented product
- Boolean functions identification via quantum computing methods
- Quantum Algorithm for the Boolean Hidden Shift Problem
- QCL implementation of the Bernstein-Vazirani algorithm
- Quantum algorithms for testing and learning Boolean functions
- Testing Boolean functions properties
- Quantum Algorithms for Testing Properties of Distributions
- scientific article; zbMATH DE number 6297720 (Why is no real title available?)
- SOFSEM 2005: Theory and Practice of Computer Science
- Quantum algorithms related to \(HN\)-transforms of Boolean functions
- Distributed Bernstein-Vazirani algorithm
This page was built for publication: Quantum algorithms for testing Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151021)
