The following pages link to (Q3002756):
Displaying 33 items.
- On the power of Ambainis lower bounds (Q557899) (← links)
- The hardest halfspace (Q1983325) (← links)
- Element distinctness revisited (Q1993785) (← links)
- Quantum algorithm for the multicollision problem (Q2006780) (← links)
- Quantum algorithm to find invariant linear structure of \(MD\) hash functions (Q2018202) (← links)
- A quantum evolving secret sharing scheme (Q2024899) (← links)
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work (Q2056756) (← links)
- Key establishment à la Merkle in a quantum world (Q2318085) (← links)
- Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384) (← links)
- (Q2830865) (← links)
- (Q3191147) (← links)
- Hardness Amplification and the Approximate Degree of Constant-Depth Circuits (Q3448791) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- The Power of Asymmetry in Constant-Depth Circuits (Q4562278) (← links)
- (Q4637977) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Quantum Algorithms for Classical Probability Distributions (Q5075751) (← links)
- (Q5090392) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- On the Power of Statistical Zero Knowledge (Q5117376) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- (Q5140844) (← links)
- Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations (Q5149756) (← links)
- (Q5158501) (← links)
- Quantum Random Walks – New Method for Designing Quantum Algorithms (Q5448636) (← links)
- Deterministic quantum search with adjustable parameters: implementations and applications (Q6044469) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)
- (Q6176153) (← links)
- Optimal deterministic quantum algorithm for the promised element distinctness problem (Q6496884) (← links)
