63 citations · 168 across the 57 of their papers we have counts for
63 papers
A Deterministic -Approximation for Non-monotone Submodular Maximization under Matroid Constraints
Shengminjie Chen, Kaifeng Lin, Xiaoming Sun +1
Submodular maximization arises in a wide range of combinatorial optimization problems and has been extensively studied from the perspective of approximation algorithms. For maximiz…
Quantum Submodular Maximization
Yonggang Jiang, Xiaoming Sun, Penghui Yao +3
We study the quantum query complexity of maximizing a non-negative submodular function, considering both the unconstrained setting and, for monotone functions, a cardinality constr…
Optimal Extensions of Cross-Sections: Sphere Packings in Dimensions 38 to 43
Ivan Dorofeev, Xiaoming Sun, Chengu Wang
We improve the best known sphere packings in every dimension from to . Our packings in dimensions to come from one chain of cross-sections of the extremal even u…
Deterministic Algorithm for Non-monotone Submodular Maximization under Matroid and Knapsack Constraints
Shengminjie Chen, Yiwei Gao, Kaifeng Lin +2
Submodular maximization constitutes a prominent research topic in combinatorial optimization and theoretical computer science, with extensive applications across diverse domains. W…
SAQNN: Spectral Adaptive Quantum Neural Network as a Universal Approximator
Jialiang Tang, Jialin Zhang, Xiaoming Sun
Quantum machine learning (QML), as an interdisciplinary field bridging quantum computing and machine learning, has garnered significant attention in recent years. Currently, the fi…
A Unified Complexity-Algorithm Account of Constant-Round QAOA Expectation Computation
Jingheng Wang, Shengminjie Chen, Xiaoming Sun +1
The Quantum Approximate Optimization Algorithm (QAOA) is widely studied for combinatorial optimization and has achieved significant advances both in theoretical guarantees and prac…