The following pages link to On exact quantum query complexity (Q2350895):
Displaying 36 items.
- A strong direct product theorem for quantum query complexity (Q354645) (← links)
- Unbounded-error quantum query complexity (Q638526) (← links)
- On the quantum query complexity of local search in two and three dimensions (Q835649) (← links)
- The quantum setting with randomized queries for continuous problems (Q850543) (← links)
- The quantum query complexity of elliptic PDE (Q855898) (← links)
- Quantum query as a state decomposition (Q1643135) (← links)
- Optimal separation in exact query complexities for Simon's problem (Q1672002) (← links)
- Nonadaptive quantum query complexity (Q1675876) (← links)
- Sharp quantum versus classical query complexity separations (Q1871634) (← links)
- The power of various real-valued quantum queries (Q1888377) (← 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)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm (Q2684233) (← links)
- On a poset of quantum exact promise problems (Q2690501) (← links)
- Parity decision tree in classical-quantum separations for certain classes of Boolean functions (Q2690505) (← links)
- Superlinear advantage for exact quantum algorithms (Q2805516) (← links)
- The quantum query complexity of approximating the median and related statistics (Q2819571) (← 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 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)
- Computational Complexity of Quantum Satisfiability (Q3177775) (← links)
- (Q3179349) (← links)
- (Q4535800) (← links)
- Algorithms and Computation (Q5191645) (← links)
- Superlinear advantage for exact quantum algorithms (Q5495861) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)
- SOFSEM 2004: Theory and Practice of Computer Science (Q5902000) (← links)
- Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability (Q6102995) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
- (Q6176153) (← links)
- Characterization of exact two-query quantum algorithms (Q6543265) (← links)
