arXiv (All)
open access
Optimization Geometry of QAOA and Variational Quantum Algorithms
Variational quantum algorithms turn choices of Hamiltonian, ansatz, and parameterization into a classical nonconvex optimization problem. We study how this objective function can be visualized and characterized in ways that help explain optimizer behavior. We distinguish two properties of the object
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
- Training Variational Quantum Algorithms Is NP-Hard, Even Locally#1201141
- Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization#1156210
- Transformers as Intrinsic Optimizers for Quantum Approximate Optimization Algorithm#1013987
- Disentangling QAOA: From Weakly Entangled Circuits to a Classical QUBO Solver#1109706
- Dynamical regimes of QAOA gradient response#821233
Record · ID 1201537
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