Ben-Or, Michael

Fault-tolerant quantum computation with constant error

Aharonov, D., & Ben-Or, M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 631

Fault-Tolerant Quantum Computation with Constant Error Rate

Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 513

The Universal Composable Security of Quantum Key Distribution

Ben-Or, M., Horodecki, M., Leung, D. W., Mayers, D., & Oppenheim, J. (2005) · Lecture Notes in Computer Science

Quantum Information and CryptographyCryptography and Data Security

Cited by 227

Computing Algebraic Formulas Using a Constant Number of Registers

Ben-Or, M., & Cleve, R. (1992) · SIAM Journal on Computing

Complexity and Algorithms in GraphsPolynomial and algebraic computation

Cited by 139

Polynomial simulations of decohered quantum computers

Aharonov, D., & Ben-Or, M. (2002) · Proceedings of 37th Conference on Foundations of Computer Science

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 41