O
Oded Regev
Researcher at New York University
Publications - 218
Citations - 20795
Oded Regev is an academic researcher from New York University. The author has contributed to research in topics: Lattice problem & Quantum computer. The author has an hindex of 60, co-authored 211 publications receiving 18156 citations. Previous affiliations of Oded Regev include Courant Institute of Mathematical Sciences & Tel Aviv University.
Papers
More filters
Posted Content
Impossibility of a Quantum Speed-up with a Faulty Oracle
Oded Regev,Liron Schiff +1 more
TL;DR: This work considers Grover's unstructured search problem in the setting where each oracle call has some small probability of failing and shows that no quantum speed-up is possible in this case.
Posted Content
Tight Hardness of the Non-commutative Grothendieck Problem
Jop Briët,Oded Regev,Rishi Saket +2 more
TL;DR: It is proved that it is NP-hard to approximate the non-commutative Grothendieck problem to within any constant factor larger than one-half, which matches the approximation ratio of the algorithm of Naor, Regev, and Vidick (STOC'13).
Journal ArticleDOI
A Note on the Distribution of the Distance from a Lattice
TL;DR: It is shown that α2 is exactly the approximation factor of a certain natural $\mathsf{AM}$ protocol for the Covering Radius Problem.
Journal ArticleDOI
Elementary Proofs of Grothendieck Theorems for Completely Bounded Norms
Oded Regev,Thomas Vidick +1 more
TL;DR: In this article, the authors provide alternative proofs of two Grothendieck theorems for jointly completely bounded bilinear forms, originally due to Pisier and Shlyakhtenko.
Journal ArticleDOI
The List-Decoding Size of Fourier-Sparse Boolean Functions
Ishay Haviv,Oded Regev +1 more
TL;DR: In this article, an upper bound on the number of k-Fourier-sparse Boolean functions that disagree with a function defined on the Boolean hypercube is shown. But the upper bound is tight up to a logarithmic factor and quadratically improves on a result due to Gur and Tamuz [2013].