most citedSettling the Sample Complexity of Single-parameter Revenue Maximization

24 citations · 36 across the 3 of their papers we have counts for

collaborators

5 papers

quant-ph2020

Optimized Geometric Quantum Computation with mesoscopic ensemble of Rydberg Atoms

Chen-Yue Guo, L. -L. Yan, Shou Zhang +2

We propose a nonadiabatic non-Abelian geometric quantum operation scheme to realize universal quantum computation with mesoscopic Rydberg atoms. A single control atom entangles a m…

cs.DS20191 cited

Smoothed complexity of local Max-Cut and binary Max-CSP

Xi Chen, Chenghao Guo, Emmanouil-Vasileios Vlatakis-Gkaragkounis +2

We show that the smoothed complexity of the FLIP algorithm for local Max-Cut is at most , where is the number of nodes in the graph and is a…

cs.GT2019

Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem

Chenghao Guo, Zhiyi Huang, Zhihao Gavin Tang +1

This paper explores a theory of generalization for learning problems on product distributions, complementing the existing learning theories in the sense that it does not rely on an…

cs.GT201924 cited

Settling the Sample Complexity of Single-parameter Revenue Maximization

Chenghao Guo, Zhiyi Huang, Xinzhi Zhang

This paper settles the sample complexity of single-parameter revenue maximization by showing matching upper and lower bounds, up to a poly-logarithmic factor, for all families of v…

quant-ph201911 cited

Decomposition of symmetric multipartite observable

You Zhou, Chenghao Guo, Xiongfeng Ma

Production and verification of multipartite quantum state are an essential step in quantum information processing. In this work, we propose an efficient method to decompose symmetr…