Pages that link to "Item:Q596296"
From MaRDI portal
The following pages link to The query complexity of order-finding (Q596296):
Displaying 12 items.
- On the optimal order of worst case complexity of direct search (Q276315) (← links)
- Property testing for cyclic groups and beyond (Q386421) (← links)
- Deterministic algorithms for the hidden subgroup problem (Q2105456) (← links)
- Sample complexity of hidden subgroup problem (Q2672576) (← links)
- Quantum complexity of permutations (Q2696406) (← links)
- Inverting a permutation is as hard as unordered search (Q3002827) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- Query Order (Q4210168) (← links)
- (Q4366882) (← links)
- Forrelation: A Problem That Optimally Separates Quantum from Classical Computing (Q4571925) (← links)
- Query order in the polynomial hierarchy (Q5055937) (← links)
- Symmetries, graph properties, and quantum speedups (Q6654557) (← links)