Pages that link to "Item:Q2958430"
From MaRDI portal
The following pages link to Exact Quantum Query Complexity of EXACT and THRESHOLD (Q2958430):
Displaying 17 items.
- Quantum query as a state decomposition (Q1643135) (← links)
- Sharp quantum versus classical query complexity separations (Q1871634) (← 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)
- Superlinear advantage for exact quantum algorithms (Q2805516) (← links)
- Exact quantum query algorithm for error detection code verification (Q2917306) (← 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)
- (Q3179349) (← links)
- (Q3534614) (← links)
- Superlinear advantage for exact quantum algorithms (Q5495861) (← links)
- Bounds on Threshold Gate Realizability (Q5601779) (← links)
- STACS 2005 (Q5710709) (← links)