The following pages link to (Q3549652):
Displaying 37 items.
- A strong direct product theorem for quantum query complexity (Q354645) (← links)
- A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
- On the power of non-adaptive learning graphs (Q488054) (← links)
- Improved quantum query algorithms for triangle detection and associativity testing (Q513275) (← links)
- Quantum counterfeit coin problems (Q714865) (← links)
- A query-efficient quantum algorithm for maximum matching on general graphs (Q832903) (← links)
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643) (← links)
- Quantum separation of local search and fixed point computation (Q848947) (← links)
- Quantum algorithms for finding constant-sized sub-hypergraphs (Q896154) (← links)
- On convex complexity measures (Q964405) (← links)
- Quantum query as a state decomposition (Q1643135) (← links)
- Evaluation of exact quantum query complexities by semidefinite programming (Q2100824) (← links)
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives (Q2220875) (← links)
- Extended learning graphs for triangle finding (Q2300731) (← links)
- Key establishment à la Merkle in a quantum world (Q2318085) (← links)
- On exact quantum query complexity (Q2350895) (← links)
- Quantum algorithms for learning symmetric juntas via the adversary bound (Q2351390) (← links)
- Optimal parallel quantum query algorithms (Q2408924) (← links)
- Superlinear Advantage for Exact Quantum Algorithms (Q2805516) (← links)
- Quantum Property Testing for Bounded-Degree Graphs (Q3088108) (← links)
- All Classical Adversary Methods are Equivalent for Total Functions (Q3304102) (← links)
- Квантовые атаки на итерационные блочные шифры (Q3381825) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
- Quantum Query Algorithms Are Completely Bounded Forms (Q4634058) (← links)
- (Q4637977) (← links)
- Quantum Query Algorithms are Completely Bounded Forms. (Q4993266) (← links)
- Quantum vs Classical Proofs and Subset Verification (Q5005122) (← links)
- Quantum Algorithms for Classical Probability Distributions (Q5075751) (← links)
- (Q5089146) (← links)
- (Q5091221) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262) (← links)
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) (← links)
- Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems (Q5889069) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)
- (Q6176155) (← links)
- Optimal deterministic quantum algorithm for the promised element distinctness problem (Q6496884) (← links)
