Pages that link to "Item:Q2351390"
From MaRDI portal
The following pages link to Quantum algorithms for learning symmetric juntas via the adversary bound (Q2351390):
Displaying 14 items.
- On the power of non-adaptive learning graphs (Q488054) (← links)
- The geometry of quantum learning (Q989901) (← links)
- Quantum algorithm for learning secret strings and its experimental demonstration (Q2111665) (← links)
- An exact quantum polynomial-time algorithm for solving \(k\)-junta problem with one uncomplemented product (Q2118738) (← links)
- Quantum algorithms for learning and testing juntas (Q2462663) (← links)
- Learning bounds for quantum circuits in the agnostic setting (Q2685576) (← links)
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS (Q2971052) (← links)
- (Q3467516) (← links)
- Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing (Q4575644) (← links)
- (Q4637977) (← links)
- Quantum vs Classical Proofs and Subset Verification (Q5005122) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Quantum Algorithms for Classical Probability Distributions (Q5075751) (← links)
- Learning quantum finite automata with queries (Q6149966) (← links)