Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection

DOI10.1007/978-3-642-33090-2_18zbMath1368.68216arXiv1203.2603OpenAlexW3106262597MaRDI QIDQ2912841

Ben W. Reichardt, Aleksandrs Belovs

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.2603

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (10)

Quantum walk and its application domains: a systematic review ⋮ Approximate span programs ⋮ Quantum bounds for 2D-grid and Dyck language ⋮ Unnamed Item ⋮ Quantum algorithm design: techniques and applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quantum Algorithms for Classical Probability Distributions ⋮ Quantum algorithms for learning symmetric juntas via the adversary bound

This page was built for publication: Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection