scientific article

DOI10.4086/toc.2016.v012a018zbMath1353.81035arXiv1410.0932OpenAlexW2585327097MaRDI QIDQ3179349

Han-Hsuan Lin, Cedric Yen-Yu Lin

Publication date: 21 December 2016

Published in: Theory of Computing (Search for Journal in Brave)

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

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

zbMATH Keywords

algorithmsquantum algorithmsgraph algorithmsquery complexityquantum query complexityadversary methodElitzur-Vaidman bomb testermaximum bipartite matching

Mathematics Subject Classification ID

Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (5)

A query-efficient quantum algorithm for maximum matching on general graphs ⋮ Quantum algorithm for dynamic programming approach for DAGs and applications ⋮ Classical and quantum algorithms for constructing text from dictionary problem ⋮ Quantum bounds for 2D-grid and Dyck language ⋮ Quantum algorithms for string processing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum algorithms for matching problems
• 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

This page was built for publication: