Boolean functions with a low polynomial degree and quantum query algorithms
From MaRDI portal
Recommendations
- Quantum Query Complexity of Boolean Functions with Small On-Sets
- Optimal quantum query bounds for almost all Boolean functions
- Polynomial-time quantum algorithms for finding the linear structures of Boolean function
- A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function
- scientific article; zbMATH DE number 6297720
- Quantum Boolean functions
- A quantum algorithm to approximate the linear structures of Boolean functions
- How low can approximate degree and quantum query complexity be for total Boolean functions?
- Quantum algorithms for testing and learning Boolean functions
- Quantum algorithms for testing Boolean functions
Cited in
(28)- Boolean functions: degree and support
- On exact quantum query complexity
- Robust polynomials and quantum algorithms
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm
- Parity decision tree in classical-quantum separations for certain classes of Boolean functions
- Computing Boolean functions via quantum hashing
- Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables
- Optimal quantum query bounds for almost all Boolean functions
- Nondeterministic query algorithms
- On quantum realisation of Boolean functions by the fingerprinting technique
- Query complexity in expectation
- Quantum query complexity of almost all functions with fixed on-set size
- Quantum query algorithms for conjunctions
- Quantum Query Complexity of Boolean Functions with Small On-Sets
- A note on quantum algorithms and the minimal degree of -error polynomials for symmetric functions
- Boolean Functions, Projection Operators, and Quantum Error Correcting Codes
- scientific article; zbMATH DE number 2062211 (Why is no real title available?)
- How low can approximate degree and quantum query complexity be for total Boolean functions?
- Algorithms for quantum branching programs based on fingerprinting
- Weak parity
- Quantum algorithms and approximating polynomials for composed functions with shared inputs
- Polynomials, quantum query complexity, and Grothendieck's inequality
- Quantum Boolean functions
- scientific article; zbMATH DE number 6297720 (Why is no real title available?)
- Quantum lower bounds by polynomials
- Robust polynomials and quantum algorithms
- SOFSEM 2006: Theory and Practice of Computer Science
- A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function
This page was built for publication: Boolean functions with a low polynomial degree and quantum query algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711559)
