arXiv (All)
open access
Exact Diagonal Completion on Reachable Subspaces: Application to QAOA Placement
Unused encoding states offer opportunities to simplify quantum circuits. For algorithms restricted to reachable subspaces, unspecified diagonal-operator entries can be optimized without changing ideal computation. We investigate exact diagonal completion for the quantum approximate optimization algo
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
- Hybrid Quantum–Classical Optimization with Applications to Routing Problems / Peter Josef Eder ; Gutachter: Andre Luckow, Christian Mendl ; Betreuer: Christian Mendl#970330
- Disentangling QAOA: From Weakly Entangled Circuits to a Classical QUBO Solver#1109706
- Combinatorial optimization enhanced by shallow quantum circuits with 104 superconducting qubits.#244291
- Re-uploading quantum data: a universal function approximator for quantum inputs#635644
- Re-uploading quantum data: a universal function approximator for quantum inputs#633295
Record · ID 1143335
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