Quantum algorithms for matching problems
DOI10.1007/S00224-008-9118-XzbMATH Open1191.68328OpenAlexW2071207394MaRDI QIDQ839634FDOQ839634
Authors: 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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph theory with applications
- Title not available (Why is that?)
- Quantum verification of matrix products
- Faster Scaling Algorithms for Network Problems
- Algorithms – ESA 2004
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Title not available (Why is that?)
- Quantum lower bounds by polynomials
- Automata, Languages and Programming
- SOFSEM 2004: Theory and Practice of Computer Science
- The Quantum Query Complexity of Algebraic Properties
- Quantum lower bounds by quantum arguments
- A decomposition theorem for maximum weight bipartite matchings
- Quantum algorithms for the triangle problem
- Automata, Languages and Programming
- Quantum Algorithms for Element Distinctness
- Quantum Algorithms for Matching and Network Flows
- Automata, Languages and Programming
Cited In (10)
- Quantum search for the dating market
- Quantum search of matching on signed graphs
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems
- Phase matching in Grover's algorithm
- A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk
- Quantum algorithm for dynamic programming approach for DAGs and applications
- A query-efficient quantum algorithm for maximum matching on general graphs
- Title not available (Why is that?)
- Quantum algorithm for shortest path search in directed acyclic graph
- Quantum Algorithms for Matching and Network Flows
This page was built for publication: Quantum algorithms for matching problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839634)
