Pages that link to "Item:Q2681549"
From MaRDI portal
The following pages link to An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables (Q2681549):
Displaying 11 items.
- A quantum algorithm for testing and learning resiliency of a Boolean function (Q669925) (← links)
- Quantum learning of concentrated Boolean functions (Q2101535) (← links)
- Solving Bernstein and Vazirani's problem with the 2-bit permutation function (Q2102201) (← links)
- An exact quantum polynomial-time algorithm for solving \(k\)-junta problem with one uncomplemented product (Q2118738) (← links)
- A exact quantum learning algorithm for the 2-junta problem in constant time (Q2165341) (← links)
- A quantum algorithm for a FULL adder operation based on registers of the CPU in a quantum-gated computer (Q2239688) (← links)
- An exact quantum algorithm for the 2-junta problem (Q2240988) (← links)
- A quantum algorithm for approximating the influences of Boolean functions and its applications (Q2355587) (← links)
- An exact quantum algorithm for testing 3-junta in Boolean functions with one uncomplemented product (Q2684236) (← links)
- Quantum algorithms for testing and learning Boolean functions (Q4917194) (← links)
- An exact quantum logarithmic time algorithm for the 3-junta problem (Q6566204) (← links)
