9 citations · 10 across the 6 of their papers we have counts for
9 papers
Extensible universal photonic quantum computing with nonlinearity
Shang Yu, Jinzhao Sun, Kuan-Cheng Chen +17
Universal quantum computing requires an architecture that supports both linear circuits and, crucially, strong nonlinear resources. For quantum photonic systems, integrating such n…
Breaking Privacy in Federated Clustering: Perfect Input Reconstruction via Temporal Correlations
Guang Yang, Lixia Luo, Qiongxiu Li
Federated clustering allows multiple parties to discover patterns in distributed data without sharing raw samples. To reduce overhead, many protocols disclose intermediate centroid…
A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
Xudong Wu, Guangxu Yang, Penghui Yao
We investigates a model of hybrid classical-quantum communication complexity, in which two parties first exchange classical messages and subsequently communicate using quantum mess…
PHICOIN (PHI): The Proof of Work High-Performance Infrastructure
Guang Yang, Peter Trinh, Sannan Iqbal +1
PHICOIN (PHI) is a high-performance cryptocurrency based on the Proof-of-Work (PoW) mechanism. It aims to provide ordinary users with decentralized participation opportunities thro…
RingFed: Reducing Communication Costs in Federated Learning on Non-IID Data
Guang Yang, Ke Mu, Chunhe Song +2
Federated learning is a widely used distributed deep learning framework that protects the privacy of each client by exchanging model parameters rather than raw data. However, feder…
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…
Separating k-Player from t-Player One-Way Communication, with Applications to Data Streams
Elbert Du, Michael Mitzenmacher, David P. Woodruff +1
In a -party communication problem, the players with inputs , respectively, want to evaluate a function using as little comm…
Sharing Information with Competitors
Simina Brânzei, Claudio Orlandi, Guang Yang
We study the mechanism design problem in the setting where agents are rewarded using information only. This problem is motivated by the increasing interest in secure multiparty com…
Exact quantum query complexity of weight decision problems via Chebyshev polynomials
Xiaoyu He, Xiaoming Sun, Guang Yang +1
The weight decision problem, which requires to determine the Hamming weight of a given binary string, is a natural and important problem, with applications in cryptanalysis, coding…