Multidimensional quantum walks, recursion, and quantum divide \& conquer

DOI10.4230/LIPICS.STACS.2025.54MaRDI QIDQ7287793zbMATH OpenFDO

Authors Stacey Jeffery, Galina Pass

Publication date 24 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2025.54

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• (No) quantum space-time tradeoff for USTCON
• Approximate span programs
• Faster quantum algorithm for evaluating game trees
• scientific article; zbMATH DE number 3353170 (Why is no real title available?)
• Multidimensional quantum walks
• Quantum algorithms for connectivity and related problems
• Quantum Query Complexity of Some Graph Problems
• Quantum search with variable times
• Quantum speed-up of Markov chain based algorithms
• Relationships between nondeterministic and deterministic tape complexities
• Search via Quantum Walk
• Size-depth tradeoffs for Boolean formulae
• Span programs and quantum algorithms for st-connectivity and claw detection
• Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
• Span-program-based quantum algorithm for evaluating formulas
• Time-efficient quantum walks for 3-distinctness

This page was built for publication: Multidimensional quantum walks, recursion, and quantum divide \& conquer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7287793)