Pages that link to "Item:Q2240988"
From MaRDI portal
The following pages link to An exact quantum algorithm for the 2-junta problem (Q2240988):
Displaying 14 items.
- Solving binary \(\mathcal {MQ}\) with Grover's algorithm (Q1989633) (← 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)
- Quantum algorithms for learning symmetric juntas via the adversary bound (Q2351390) (← links)
- Quantum algorithms for learning and testing juntas (Q2462663) (← links)
- An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables (Q2681549) (← links)
- An exact quantum algorithm for testing 3-junta in Boolean functions with one uncomplemented product (Q2684236) (← links)
- Exact Quantum Algorithms for the Leader Election Problem (Q2947561) (← links)
- Linear-Time Algorithm for Quantum 2SAT (Q4568109) (← links)
- (Q5368761) (← links)
- A two-way algorithm for the entanglement problem (Q5462519) (← links)
- An exact quantum logarithmic time algorithm for the 3-junta problem (Q6566204) (← links)
