Regev, Oded

On lattices, learning with errors, random linear codes, and cryptography

Regev, O. (2009) · Journal of the ACM

Cryptography and Data SecurityQuantum Information and Cryptography

Cited by 2,315

The Complexity of the Local Hamiltonian Problem

Kempe, J., Kitaev, A., & Regev, O. (2006) · SIAM Journal on Computing

Quantum Computing Algorithms and ArchitectureComplexity and Algorithms in Graphs

Cited by 648

Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation

Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2007) · SIAM Journal on Computing

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 457

Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation

Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2008) · SIAM Review

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 395

Quantum Computation and Lattice Problems

Regev, O. (2004) · SIAM Journal on Computing

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 188

An Efficient Quantum Factoring Algorithm

Regev, O. (2025) · Journal of the ACM

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 42

Beating the random assignment on constraint satisfaction problems of bounded degree

Barak, B., Moitra, A., O'Donnell, R., Raghavendra, P., Regev, O., Steurer, D., Trevisan, L., Vijayaraghavan, A., Witmer, D., & Wright, J. (2015) · arXiv

Constraint Satisfaction and OptimizationComplexity and Algorithms in Graphs

Cited by 8