7 papers
Communication Complexity of Distributed Unitary Synthesis
Longcheng Li, Xiaoming Sun, Jialin Zhang +1
We study space-bounded communication complexity for unitary implementation in distributed quantum processors, where we restrict the number of qubits per processor to ensure practic…
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…
Scalable Multi-QPU Circuit Design for Dicke State Preparation: Optimizing Communication Complexity and Local Circuit Costs
Ziheng Chen, Junhong Nie, Xiaoming Sun +2
Preparing large-qubit Dicke states is of broad interest in quantum computing and quantum metrology. However, the number of qubits available on a single quantum processing unit (QPU…
A Lyapunov Framework for Quantum Algorithm Design in Combinatorial Optimization with Approximation Ratio Guarantees
Shengminjie Chen, Ziyang Li, Hongyi Zhou +3
In this work, we develop a framework aiming at designing quantum algorithms for combinatorial optimization problems while providing theoretical guarantees on their approximation ra…
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…