scientific article; zbMATH DE number 7559367

DOI10.4230/LIPIcs.TQC.2019.6MaRDI QIDQ5089153

Kai Delorenzo, R. Teal Witter, Shelby Kimmel

Publication date: 18 July 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmsquantum algorithmsgraphsquery complexityspan programs

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the power of Ambainis lower bounds
• Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection
• A Complexity Measure
• Finding Even Cycles Even Faster
• Algebraic Potential Theory on Graphs
• Quantum Query Complexity of Minor-Closed Graph Properties
• Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
• Span programs for functions with constant-sized 1-certificates
• A compendium of problems complete for symmetric logarithmic space

This page was built for publication: