arXiv (All)
open access
Reducing QUBO Complexity in Drone Delivery Through Classical Feasibility Preprocessing
Drone-delivery planning combines routing decisions with operational constraints such as payload capacity and limited onboard energy, resulting in combinatorial optimization problems that can become costly to encode directly in binary form. This work investigates a hybrid quantum--classical approach
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
- Binary Optimization with Complex Constraints via Quantum Approximate Multi-Objective Optimization#1083290
- Shared drone route scheduling optimization.#209374
- Granthi: Higher-Order Quantum Programming via Unitary Wiring#986327
- Leveraging LLM-Based Agentic Systems to Generate Quantum Applications for Test Optimization#329150
- Linear-depth quantum oracles for clique problems from edge colorings and graph states, with linear non-Clifford cost and a provably bounded-error k-clique search#1130431
Record · ID 1356339
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