arXiv (All)
open access
The Expressive Power of Constrained QAOA: What You Might Have MISsed
Feasibility-preserving mixer Hamiltonians offer an attractive alternative to penalty encodings for constrained quantum optimization, yet how enforcing constraints alters the state space reachable by the Quantum Approximate Optimization Algorithm (QAOA) remains largely unexplored. We address this que
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
- Exposing Finite-Depth, Finite-Shot Guarantees for Constrained Quantum Optimization via Fejér Filtering#925940
- Disentangling QAOA: From Weakly Entangled Circuits to a Classical QUBO Solver#1109706
- On Relationship Between Circuit Depth and Trainability of VQAs#1064032
- Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization#1156210
- Learning parameter curves in feedback-based quantum optimization algorithms#1144750
Record · ID 1012410
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