Pages that link to "Item:Q1944033"
From MaRDI portal
The following pages link to An improved lower bound on query complexity for quantum PAC learning (Q1944033):
Displaying 6 items.
- Quantum learning of concentrated Boolean functions (Q2101535) (← links)
- Learning bounds for quantum circuits in the agnostic setting (Q2685576) (← links)
- Quantum machine learning: a classical perspective (Q4556858) (← links)
- (Q4614114) (← links)
- Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices (Q4620294) (← links)
- Learning quantum finite automata with queries (Q6149966) (← links)
