arXiv (OAI Expanded)
open access
When is global evolutionary search useful for variational quantum algorithms? A landscape-first study
Variational quantum algorithms recast state preparation as classical nonconvex optimization, but it is often unclear when multistart local search suffices and when population-based global search justifies its evaluation cost. Using a landscape-first design, controlled QAOA experiments identify two m
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
- Breaking the Shot-Noise Barrier: Cached Recycled Variance-Reduced Gradients for Quantum Optimization#1143401
- Block-Wise Variational Quantum Algorithms for PDEs with Interface Penalty Constraints#1131911
- Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization#1156210
- Theoretical Guarantees of Variational Quantum Algorithm with Guiding States#984903
- Hybrid Variational Quantum-Classical Framework with Adaptive Weighting and Efficiency Assessment#1076148
Record · ID 1084537
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