Henry S. Yuen

Learn More
We present two parallel repetition theorems for the entangled value of multi-player, one-round free games (games where the inputs come from a product distribution). Our first theorem shows that for a k-player free game G with entangled value val∗(G) = 1− , the n-fold repetition of G has entangled value val∗(G⊗n) at most (1− 3/2)Ω(n/sk4), where s is the(More)
In this note we show that the Raz-McKenzie simulation algorithm which lifts deterministic query lower bounds to deterministic communication lower bounds can be implemented for functions f composed with the Inner Product gadget 1ip(x, y) = ∑ i xiyi mod 2 of logarithmic size. In other words, given a function f : {0, 1}n → {0, 1} with deterministic query(More)
Khanna and Sudan [2] studied a natural model of continuous time channels where signals are corrupted by the effects of both noise and delay, and showed that, surprisingly, in some cases both are not enough to prevent such channels from achieving unbounded capacity. Inspired by their work, we consider channels that model continuous time communication with(More)
We present a strong parallel repetition theorem for the entangled value of multi-player, oneround free games (games where the inputs come from a product distribution). Our result is the first parallel repetition theorem for entangled games involving more than two players. Furthermore, our theorem applies to games where the players are allowed to output(More)
Given a set of nodes and edges between them, what’s the maximum of number of disjoint edges? This problem is known as the graph matching problem, and its study has had an enormous impact on the develpoment of algorithms, combinatorics, optimization theory, and even complexity theory. Mathematicians have been interested in the matching problem since the 19th(More)
  • 1