4 citations · 9 across the 10 of their papers we have counts for
6 papers · 1 filter
Speedup in Classical Simulation of Gaussian Boson Sampling
Bujiao Wu, Bin Cheng, Jialin Zhang +2
Gaussian boson sampling is a promising model for demonstrating quantum computational supremacy, which eases the experimental challenge of the standard boson-sampling proposal. Here…
Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio
Minming Li, Pinyan Lu, Yuhao Yao +1
In this paper, we study the two-facility location game on a line with optional preference where the acceptable set of facilities for each agent could be different and an agent's co…
A Quantum-inspired Classical Algorithm for Separable Non-negative Matrix Factorization
Zhihuai Chen, Yinan Li, Xiaoming Sun +2
Non-negative Matrix Factorization (NMF) asks to decompose a (entry-wise) non-negative matrix into the product of two smaller-sized nonnegative matrices, which has been shown intrac…
Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol
Xiaohui Bei, Xiaoming Sun, Hao Wu +3
The classical cake cutting problem studies how to find fair allocations of a heterogeneous and divisible resource among multiple agents. Two of the most commonly studied fairness c…
Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis
Jiaqing Jiang, Xiaoming Sun, Shang-Hua Teng +3
Decoherence -- in the current physical implementations of quantum computers -- makes depth reduction a vital task in quantum-circuit design. Moore and Nilsson (SIAM Journal of Comp…
Querying a Matrix through Matrix-Vector Products
Xiaoming Sun, David P. Woodruff, Guang Yang +1
We consider algorithms with access to an unknown matrix via matrix-vector products, namely, the algorithm chooses vectors $\mathbf{v}^1, \ldots, \math…