arXiv (All)
open access
Symmetry-Preserving Hierarchical Quantum Approximate Optimization Algorithm with Subproblems Beyond the Qubit Limit
The quantum approximate optimization algorithm (QAOA) is a paradigmatic variational quantum algorithm for combinatorial optimization problems, yet on current quantum devices the available qubit count and achievable circuit depth remain the main bottlenecks to its practical application. Divide-and-me
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
- Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA#1011048
- Investigating layer-selective transfer learning of quantum approximate optimization algorithm parameters for the Max-Cut problem#1358899
- Parameter-Dependent Noise Resilience in the Quantum Approximate Optimization Algorithm#1248990
- Effective Noise Thresholds for Reliable Quantum Approximation Optimisation Algorithm under Noisy Environment#1467921
- Higher-order Parity Constraints for Quantum Approximate Optimization#1401551
Record · ID 1489136
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