Breaking the quantum barriers for Graph Collision
quant-ph, cs.CC, cs.DS
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- Parameterized Quantum Query Complexity of Graph Collision
- Quantum walk algorithm for element distinctness
- Bounds for Small-Error and Zero-Error Quantum Algorithms
- Learning-Graph-Based Quantum Algorithm for k-distinctness
- Tight Quantum Lower Bound for k-Distinctness
- Quantum Amplitude Amplification and Estimation
- Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection
- On the Power of Non-Adaptive Learning Graphs
- Quantum algorithms for path and cycle containment problems
- A quantum query algorithm for the graph collision problem
- Quantum Query Complexity of Maximum Degree and its Generalizations
- Negative weights make adversaries stronger
- Search via Quantum Walk
- Quantum Algorithms for the Triangle Problem
- Fixed-point quantum search with an optimal number of queries
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements