Quantum algorithms for matching problems

DOI10.1007/s00224-008-9118-xzbMath1191.68328MaRDI QIDQ839634

Sebastian Dörn

Publication date: 2 September 2009

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

Full work available at URL: https://doi.org/10.1007/s00224-008-9118-x

zbMATH Keywords

quantum algorithms; graph theory; matching problems

Mathematics Subject Classification ID

81P68: Quantum computation

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68Q12: Quantum algorithms and complexity in the theory of computing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Decomposition Theorem for Maximum Weight Bipartite Matchings
• Quantum verification of matrix products
• Faster Scaling Algorithms for Network Problems
• Quantum Algorithms for Element Distinctness
• Quantum lower bounds by polynomials
• The Quantum Query Complexity of Algebraic Properties
• Quantum Algorithms for Matching and Network Flows
• Algorithms – ESA 2004
• Automata, Languages and Programming
• Automata, Languages and Programming
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Automata, Languages and Programming
• Quantum lower bounds by quantum arguments
• SOFSEM 2004: Theory and Practice of Computer Science