arXiv (All)
open access
Resource-Aware Grover Search for Minimum Vertex Cover
The Minimum Vertex Cover (MVC) problem is a fundamental NP-hard combinatorial optimization problem with applications in network analysis and resource allocation. Grover's algorithm provides a quadratic reduction in query complexity for unstructured search, but existing Grover-based MVC formulations
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
- Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization#1156210
- Degree-conditioned anneal offsets reshape certified-optimum sampling for minimum vertex cover#1188057
- Linear-depth quantum oracles for clique problems from edge colorings and graph states, with linear non-Clifford cost and a provably bounded-error k-clique search#1130431
- Training Variational Quantum Algorithms Is NP-Hard, Even Locally#1201141
- The optimal search on graph by continuous-time quantum walks#821630
Record · ID 1216627
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