arXiv (All)
open access
Landscape Compression in Constrained QAOA Tracks Feasibility Loss on IBM Heron Hardware
We study how hardware noise changes the p=1 Quantum Approximate Optimization Algorithm (QAOA) landscape for cardinality-constrained portfolio problems on ibm_fez (IBM Heron r2): seven instances from n=6 to 16 qubits, each on a 7x7 parameter grid at 4,096 and 8,192 shots per point. The first version
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
- Landscape Limits of Quantum-Inspired Evolutionary Optimization across 256 continuous functions#1105497
- Decomposition Pipeline for Large-Scale Portfolio Optimization with Applications to Near-Term Quantum Computing#999626
- A Distributed Quantum Approximate Optimization Algorithm For Unit Commitment#429321
- Quantum Approximate Optimization via Noise-Directed Adaptive Warm-Starting#1063965
Record · ID 1142664
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