Aram Harrow

Aram Wettroth Harrow (born 1980) is an Associate Professor of Physics in the Massachusetts Institute of Technology's Center for Theoretical Physics.^[1]

Harrow works in quantum information science and quantum computing.^[2] Together with Avinatan Hassidim and Seth Lloyd, he designed a quantum algorithm for linear systems of equations, which in some cases exhibits an exponential advantage over the best classical algorithms.^[3] The algorithm has wide application in quantum machine learning.

He is a steering committee member of Quantum Information Processing (QIP),^[4] the largest annual conference in the field of quantum computing. Harrow is a co-administrator of SciRate,^[5] a free and open access scientific collaboration network. He also co-runs a blog, The Quantum Pontiff. His collaborators include Peter Shor and Charles H. Bennett.

Selected publications[]

• Bremner, Michael J.; Dawson, Christopher M.; Dodd, Jennifer L.; Gilchrist, Alexei; Harrow, Aram W.; Mortimer, Duncan; Nielsen, Michael A.; Osborne, Tobias J. (2002-11-25). "Practical Scheme for Quantum Computation with Any Two-Qubit Entangling Gate". Physical Review Letters. 89 (24): 247902. arXiv:quant-ph/0207072. Bibcode:2002PhRvL..89x7902B. doi:10.1103/PhysRevLett.89.247902. PMID 12484981.
• Devetak, I.; Harrow, A. W.; Winter, A. J. (October 2008). "A Resource Framework for Quantum Shannon Theory". IEEE Transactions on Information Theory. 54 (10): 4587–4618. arXiv:quant-ph/0512015. doi:10.1109/tit.2008.928980. ISSN 0018-9448.
• Barak, Boaz; Brandao, Fernando G. S. L.; Harrow, Aram W.; Kelner, Jonathan; Steurer, David; Zhou, Yuan (2012-05-19). "Hypercontractivity, sum-of-squares proofs, and their applications". STOC '12: Proceedings of the Forty-fourth Annual ACM Symposium on Theory of Computing. ACM: 307–326. arXiv:1205.4484. Bibcode:2012arXiv1205.4484B. doi:10.1145/2213977.2214006. ISBN 9781450312455.

References[]

External links[]

• Aram Harrow publications indexed by Google Scholar

This article about an American physicist is a stub. You can help Wikipedia by .

• v
• t