arXiv (All)
open access
Motzkin-Straus Optimization on an Entropy-Computing Platform
We introduce a framework for combinatorial optimization using sum-constrained continuous quadratic programs solvable by QCi's Dirac-3S photonic entropy computer. This is enabled by the Motzkin-Straus theorem which provides a powerful bridge between discrete clique problems and optimization over 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
- QUBO Formulations and Characterization of Penalty Parameters for the Multi-Knapsack Problem#417120
- Combinatorial Optimization#66996
- Simple QKD keyrate computations from tangent-line bounds#996664
- Coded-BKW: Solving LWE Using Lattice Codes.#215520
- Quantum Multi-Armed Bandits and Linear Bandits: Lower Bounds and Algorithms#458286
Record · ID 1143380
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