activity
20192023
most citedOptimized Geometric Quantum Computation with mesoscopic ensemble of Rydberg Atoms

59 citations · 104 across the 8 of their papers we have counts for

collaborators

8 papers

math.PR2023

Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles

Guy Bresler, Chenghao Guo, Yury Polyanskiy

We aim to understand the extent to which the noise distribution in a planted signal-plus-noise problem impacts its computational complexity. To that end, we consider the planted cl…

cs.DS2023

Smoothed Complexity of SWAP in Local Graph Partitioning

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

We give the first quasipolynomial upper bound for the smoothed complexity of the SWAP algorithm for local Graph Partitioning (also known as Bisection Width…

cs.DS2022

Linear Programs with Polynomial Coefficients and Applications to 1D Cellular Automata

Guy Bresler, Chenghao Guo, Yury Polyanskiy

Given a matrix and vector with polynomial entries in real variables we consider the following notion of feasibility: the pair is locally fe…

quant-ph2020★ 59 cited

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.DS2019★ 1 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★ 9 cited

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.GT2019★ 24 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-ph2019★ 11 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…