Reproduce “Quantum Submodular Maximization” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Yonggang Jiang, Xiaoming Sun, Penghui Yao, Zekun Ye, Jialin Zhang, Zhijie Zhang
The authors present quantum algorithms for unconstrained and cardinality-constrained submodular maximization, where diminishing returns make marginal gains context-dependent. Reversible value queries in superposition and measurements estimate gains for many elements together. The unconstrained method achieves expected ratio 1/2−ε with Oε(log n) queries; for dense budgets, the cardinality method gives a 1−1/e−ε approximation with high probability using logarithmic queries. These are query, not runtime, guarantees.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.