A query-efficient quantum algorithm for maximum matching on general graphs

DOI10.1007/978-3-030-83508-8_39OpenAlexW3198528674MaRDI QIDQ832903

Shelby Kimmel, R. Teal Witter

Publication date: 25 March 2022

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

zbMATH Keywords

maximum matchingquantum algorithm

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the power of Ambainis lower bounds
• Pairwise kidney exchange
• Quantum algorithms for matching problems
• The Weighted Matching Approach to Maximum Cardinality Matching
• Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
• Paths, Trees, and Flowers
• Quantum Algorithms for Matching and Network Flows
• Quantum Query Complexity of State Conversion
• Optimal Sequencing of Two Equivalent Processors
• Quantum lower bounds by quantum arguments
• SOFSEM 2004: Theory and Practice of Computer Science

This page was built for publication: A query-efficient quantum algorithm for maximum matching on general graphs