Guy Weissenberg

1 citations · 1 across the 1 of their papers we have counts for

collaborators

2 papers

cs.CC2025

3-Query RLDCs are Strictly Stronger than 3-Query LDCs

Tom Gur, Dor Minzer, Guy Weissenberg +1

We construct $3$ -query relaxed locally decodable codes (RLDCs) with constant alphabet size and length $O ~ (k^{2})$ for $k$ -bit messages. Combined with the lower bound of $\tild…

quant-ph2021★ 1 cited

Unitary Subgroup Testing

Zvika Brakerski, Devika Sharma, Guy Weissenberg

We consider the problem of $subgroup testing$ for a quantum circuit $C$ : given access to $C$ , determine whether it implements a unitary that is $a$ -close or $b$ -far from a…