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
Journal ArticleDOI
Upper bounds on the noise threshold for fault-tolerant quantum computing
TL;DR: New upper bounds on the tolerable level of noise in a quantum circuit are proved using a Pauli basis decomposition, finding that for p > 1 - Θ(1/√k), the output of any such circuit of large enough depth is essentially independent of its input, making the circuit useless.
Journal ArticleDOI
Long Monotone Paths in Line Arrangements
TL;DR: In this paper, the authors show how to construct an arrangement of n lines having a monotone path of length Ω(n2 − (d/\sqrt{log n}) where d > 0 is some constant.
Journal ArticleDOI
Tight Hardness of the Non-Commutative Grothendieck Problem
Jop Briët,Oded Regev,Rishi Saket +2 more
TL;DR: It is proved that for any e > 0 it is NP-hard to approximate the non-commutative Grothendieck problem to within a factor 1=2+e, which matches the approximation ratio of the algorithm of Naor, Regev, and Vidick (STOC’13).
Journal Article
A Note on Discrete Gaussian Combinations of Lattice Vectors.
Divesh Aggarwal,Oded Regev +1 more
TL;DR: In this article, the authors analyzed the distribution of the sum of fixed vectors from a lattice over a Gaussian distribution, and showed that if the fixed vectors are chosen from a wide enough Gaussian, the sum is statistically close to a discrete Gaussian over the lattice.
Book ChapterDOI
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing
TL;DR: In this paper, it was shown that the output of a quantum circuit can be independent of its input, thereby making the circuit useless, and for the special case of k = 2, the bound was improved to 29.3%.