Shengyu Zhang

activity

20032013

most citedA single-shot measurement of the energy of product states in a translation invariant spin chain can replace any quantum computation

14 citations · 39 across the 10 of their papers we have counts for

collaborators

Showing 2009Show all

1 paper · 1 filter

cs.CC2009

Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas

Rahul Jain, Hartmut Klauck, Shengyu Zhang

We show lower bounds of $Ω (n)$ and $Ω (n^{1/4})$ on the randomized and quantum communication complexity, respectively, of all $n$ -variable read-once Boolean formulas. Our res…