Pages that link to "Item:Q3498860"
From MaRDI portal
The following pages link to Quantum lower bounds for the collision and the element distinctness problems (Q3498860):
Displaying 50 items.
- Grover walks on a line with absorbing boundaries (Q331399) (← links)
- How low can approximate degree and quantum query complexity be for total Boolean functions? (Q488052) (← links)
- On the power of non-adaptive learning graphs (Q488054) (← links)
- On the relationship between continuous- and discrete-time quantum walk (Q625458) (← links)
- Low-gate quantum golden collision finding (Q832353) (← links)
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643) (← links)
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- Adversary lower bounds for nonadaptive quantum algorithms (Q980943) (← links)
- Claw finding algorithms using quantum walk (Q1034536) (← links)
- Quantum algorithms for the \(k\)-XOR problem (Q1633472) (← links)
- Quantum collision-finding in non-uniform random functions (Q1644795) (← links)
- Quantum multicollision-finding algorithm (Q1703921) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- The hardest halfspace (Q1983325) (← links)
- Element distinctness revisited (Q1993785) (← links)
- Quantum algorithm for the multicollision problem (Q2006780) (← links)
- On subset-resilient hash function families (Q2115743) (← links)
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms (Q2119016) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- Key establishment à la Merkle in a quantum world (Q2318085) (← links)
- Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795) (← links)
- Quantum algorithms for learning symmetric juntas via the adversary bound (Q2351390) (← links)
- The quantum query complexity of the abelian hidden subgroup problem (Q2373740) (← links)
- Optimal parallel quantum query algorithms (Q2408924) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- Quantum key-length extension (Q2695632) (← links)
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Quantum query complexity of constant-sized subgraph containment (Q2909539) (← links)
- Quantum lower bound for the collision problem with small range (Q3002755) (← links)
- (Q3002756) (← links)
- Quantum adversary lower bound for element distinctness with small range (Q3191147) (← links)
- The need for structure in quantum speedups (Q3191607) (← links)
- Квантовые атаки на итерационные блочные шифры (Q3381825) (← links)
- TIGHT QUANTUM BOUNDS FOR COMPUTATIONAL GEOMETRY PROBLEMS (Q3401879) (← links)
- Hardness Amplification and the Approximate Degree of Constant-Depth Circuits (Q3448791) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
- Quantum Walk Based Search Algorithms (Q3502631) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- The Power of Asymmetry in Constant-Depth Circuits (Q4562278) (← links)
- One-dimensional lackadaisical quantum walks (Q4602774) (← links)
- Quantum Query Algorithms Are Completely Bounded Forms (Q4634058) (← links)
- (Q4637977) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- Quantum Query Algorithms are Completely Bounded Forms. (Q4993266) (← links)
- Quantum vs Classical Proofs and Subset Verification (Q5005122) (← links)
- (Q5009530) (← links)
- The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound (Q5041235) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Quantum Algorithms for Classical Probability Distributions (Q5075751) (← links)
