ISTA Publications
metadata only
Quantum-informed recursive optimization algorithms
We propose and implement a family of quantum-informed recursive optimization (QIRO) algorithms for combinatorial optimization problems. Our approach leverages quantum resources to obtain information that is used in problem-specific classical reduction steps that recursively simplify the problem. The
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
- Resource-Aware Quantum Programming with General Recursion and Quantum Control#670409
- Resource-Aware Quantum Programming with General Recursion and Quantum Control#668344
- Binary Optimization of Measurement Groupings for Quantum Energy Estimation#1234706
- Beyond QAOA: A Review of AI and Quantum Computing for Adaptive Combinatorial Optimization#1249039
- Managing Iterative Hybrid Quantum-Classical Optimization as a First-Class Scientific Workflow#1104731
Record · ID 1358959
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