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

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

Authors: Shelby Kimmel, R. Teal Witter 

Publication date: 25 March 2022

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

zbMATH Keywords

quantum algorithmmaximum matching

Mathematics Subject Classification ID

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

Cites Work

• Paths, Trees, and Flowers
• Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
• Optimal Sequencing of Two Equivalent Processors
• Quantum Query Complexity of State Conversion
• SOFSEM 2004: Theory and Practice of Computer Science
• Title not available (Why is that?)
• Quantum lower bounds by quantum arguments
• Pairwise kidney exchange
• On the power of Ambainis lower bounds
• The weighted matching approach to maximum cardinality matching
• Quantum algorithms for matching problems
• Title not available (Why is that?)
• Quantum Algorithms for Matching and Network Flows
• Title not available (Why is that?)

Cited In (4)

• Graph comparison via nonlinear quantum search
• SOFSEM 2004: Theory and Practice of Computer Science
• Quantum time complexity and algorithms for pattern matching on labeled graphs
• Quantum Algorithms for Matching and Network Flows

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

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