Pages that link to "Item:Q5495861"
From MaRDI portal
The following pages link to Superlinear advantage for exact quantum algorithms (Q5495861):
Displaying 13 items.
- Optimal separation in exact query complexities for Simon's problem (Q1672002) (← links)
- Evaluation of exact quantum query complexities by semidefinite programming (Q2100824) (← links)
- Revisiting Deutsch-Jozsa algorithm (Q2216118) (← links)
- On exact quantum query complexity (Q2350895) (← links)
- Parity decision tree in classical-quantum separations for certain classes of Boolean functions (Q2690505) (← links)
- Superlinear advantage for exact quantum algorithms (Q2805516) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Exact Quantum Algorithms for the Leader Election Problem (Q2947561) (← links)
- Exact Quantum Query Complexity of EXACT and THRESHOLD (Q2958430) (← links)
- Exact Quantum Query Complexity of $$\text {EXACT}_{k,l}^n$$ (Q2971138) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- Exact distributed quantum algorithm for generalized Simon's problem (Q6541034) (← links)