ISTA Publications
metadata only
Large-scale quantum approximate optimization on nonplanar graphs with machine learning noise mitigation
Quantum computers are increasing in size and quality but are still very noisy. Error mitigation extends the size of the quantum circuits that noisy devices can meaningfully execute. However, state-of-the-art error mitigation methods are hard to implement and the limited qubit connectivity in superco
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
- An in-principle super-polynomial quantum advantage for approximating combinatorial optimization problems via computational learning theory.#136047
- Certifying bipartite entanglement on a superconducting processor from a corrected QAOA cost layer#987236
- DPRQ: A Dynamic Programming-based Qubit Routing Algorithm for Collective Communication in Distributed Quantum Computing#985277
- Managing Iterative Hybrid Quantum-Classical Optimization as a First-Class Scientific Workflow#1104731
- Hybrid quantum-classical algorithms for high performance computing#357463
Record · ID 1039237
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