arXiv (All)
open access
Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA
Divide-and-conquer strategies mitigate hardware constraints for the Quantum Approximate Optimization Algorithm (QAOA) on Noisy Intermediate-Scale Quantum (NISQ) devices by partitioning large interaction graphs into smaller, hardware-compatible sub-problems. However, this approach introduces a severe
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
- Circuit-depth optimization of quantum partial-search algorithms#1064691
- DreamQAS: Learning a Decision-Useful World Model for VQE-Efficient Quantum Architecture Search#422252
- Transformers as Intrinsic Optimizers for Quantum Approximate Optimization Algorithm#1013987
- Managing Iterative Hybrid Quantum-Classical Optimization as a First-Class Scientific Workflow#1104731
- Landscape Compression in Constrained QAOA Tracks Feasibility Loss on IBM Heron Hardware#1142664
Record · ID 1011048
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