Quantum Algorithms on Edge Lists: Hiding, Shuffling, and Cycle Finding
quant-ph, cs.CC, cs.DS
Submitted: 2024-12-23
Updated: 2026-05-28
Comments: 80 pages; v2: major update to include new results on cycle finding; v3: corrected Mirroring Lemma and improved presentation; v4: changed title and improved presentation
Journal ref: 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026), LIPIcs 374, 97:1-97:16 (2026)
DOI: 10.4230/LIPIcs.ICALP.2026.97
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Tight Quantum Lower Bound for k-Distinctness
- Compressed Permutation Oracles
- The Compressed Oracle is a Worthy (Multiplicative) Adversary
- Adversary Lower Bound for Element Distinctness with Small Range
- Adversary Lower Bound for the Orthogonal Array Problem
- Quantum algorithms for hypergraph simplex finding
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians