Pages that link to "Item:Q2118738"
From MaRDI portal
The following pages link to An exact quantum polynomial-time algorithm for solving \(k\)-junta problem with one uncomplemented product (Q2118738):
Displaying 8 items.
- Quantum learning of concentrated Boolean functions (Q2101535) (← links)
- A exact quantum learning algorithm for the 2-junta problem in constant time (Q2165341) (← links)
- An exact quantum algorithm for the 2-junta problem (Q2240988) (← 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)
- Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing (Q4575644) (← links)