arXiv (All)
open access
A Quantum Scaling Algorithm for Maximum-Weight Perfect Matching in General Graphs
Quantum speed-ups have been obtained for many fundamental graph problems, including most variants of matching. A notable exception, however, is the maximum-weight perfect matching (MWPM) problem in general graphs with integer edge weights, which is arguably the most challenging variant of matching.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Learning for Graph Matching and Related Combinatorial Optimization Problems#478214
- Entanglement of multi-qubit quantum graph states and studies structural properties of tripartite graphs with quantum computing#1063903
- Solving Graph Coloring Problems Using Feedback-Based Algorithm for Quantum Optimization#1105550
- Quantum Preconditioning For Constrained Optimization Problems#793080
- Quantum Preconditioning For Constrained Optimization Problems#789076
Record · ID 1144424
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive