Pages that link to "Item:Q4575644"
From MaRDI portal
The following pages link to Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing (Q4575644):
Displaying 9 items.
- Quantum cryptographic property testing of multi-output Boolean functions (Q2100834) (← links)
- An exact quantum polynomial-time algorithm for solving \(k\)-junta problem with one uncomplemented product (Q2118738) (← links)
- A fast Fourier transform for the Johnson graph (Q2154368) (← 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)
- Harmonicity and invariance on slices of the Boolean cube (Q2334365) (← 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)
- Quantum Algorithms for Classical Probability Distributions (Q5075751) (← links)
