arXiv (All)
open access
Quantum Submodular Maximization
We study the quantum query complexity of maximizing a non-negative submodular function, considering both the unconstrained setting and, for monotone functions, a cardinality constraint $k$ on an $n$-element ground set. In the exact reversible digital value-oracle model, our unconstrained algorithm a
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
- Tight bounds for hybrid quantum-classical query algorithms#1215887
- A Catalytic Algorithm for Transposing Unknown Qutrit Unitaries with Tight Query Bounds#1296671
- Quantum Approximate Counting with Bernoulli Oracles#984515
- ZX-Calculus for Quantum Circuits : A Diagrammatic Approach to Quantum Circuit Analysis and Optimization / by Subhojit Halder#623859
- Binary Optimization of Measurement Groupings for Quantum Energy Estimation#1234706
Record · ID 1200211
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