The following pages link to On exact quantum query complexity (Q2350895):
Displaying 13 items.
- Quantum query as a state decomposition (Q1643135) (← links)
- Optimal separation in exact query complexities for Simon's problem (Q1672002) (← links)
- Evaluation of exact quantum query complexities by semidefinite programming (Q2100824) (← links)
- An exact quantum algorithm for a restricted subtraction game (Q2190513) (← links)
- Revisiting Deutsch-Jozsa algorithm (Q2216118) (← links)
- On exact quantum query complexity (Q2350895) (← links)
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm (Q2684233) (← 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 Query Complexity of $$\text {EXACT}_{k,l}^n$$ (Q2971138) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
