Alexei Kitaev: Difference between revisions
No edit summary |
No edit summary |
||
Line 1: | Line 1: | ||
<big>Big text</big>'''Alexei Kitaev''' is a professor of [[physics]] and [[computer science]] at the [[California Institute of Technology]]. He is best known for introducing the [[quantum phase estimation algorithm]] and the concept of the [[topological quantum computer]]<ref>{{cite arXiv | eprint=quant-ph/9707021v1|author1=Kitaev, A. Yu.|title=Fault-tolerant quantum computation by [[anyons]].}}</ref> while working at the [[Landau Institute for Theoretical Physics]]. For this work, he was awarded a [[MacArthur Fellowship]] in [[2008]]. He is also known for defining the complexity class QMA and showing that some local Hamiltonian problems are QMA-complete <ref>{{cite arXiv|eprint=quant-ph/0210077v1|author1=Dorit Aharonov|author2=Tomer Naveh|title=Quantum NP - A Survey|class=quant-ph|year=2002}}</ref>. |
<big>Big text</big>'''Alexei Kitaev''' is a professor of [[physics]] and [[computer science]] at the [[California Institute of Technology]]. He is best known for introducing the [[quantum phase estimation algorithm]] and the concept of the [[topological quantum computer]]<ref>{{cite arXiv | eprint=quant-ph/9707021v1|author1=Kitaev, A. Yu.|title=Fault-tolerant quantum computation by [[anyons]].}}</ref> while working at the [[Landau Institute for Theoretical Physics]]. For this work, he was awarded a [[MacArthur Fellowship]] in [[2008]]. He is also known for defining the complexity class [[QMA]] and showing that some local Hamiltonian problems are QMA-complete <ref>{{cite arXiv|eprint=quant-ph/0210077v1|author1=Dorit Aharonov|author2=Tomer Naveh|title=Quantum NP - A Survey|class=quant-ph|year=2002}}</ref>. |
||
Kitaev was educated in Russia, receiving an M.Sc from the [[Moscow Institute of Physics and Technology]] (1986), and a Ph.D from the [[Landau Institute for Theoretical Physics]] (1989). He served previously as a researcher (1999-2001) at [[Microsoft Research]] and as a research associate (1989-1998) at the Landau Institute. |
Kitaev was educated in Russia, receiving an M.Sc from the [[Moscow Institute of Physics and Technology]] (1986), and a Ph.D from the [[Landau Institute for Theoretical Physics]] (1989). He served previously as a researcher (1999-2001) at [[Microsoft Research]] and as a research associate (1989-1998) at the Landau Institute. |
Revision as of 14:29, 6 June 2011
Big textAlexei Kitaev is a professor of physics and computer science at the California Institute of Technology. He is best known for introducing the quantum phase estimation algorithm and the concept of the topological quantum computer[1] while working at the Landau Institute for Theoretical Physics. For this work, he was awarded a MacArthur Fellowship in 2008. He is also known for defining the complexity class QMA and showing that some local Hamiltonian problems are QMA-complete [2].
Kitaev was educated in Russia, receiving an M.Sc from the Moscow Institute of Physics and Technology (1986), and a Ph.D from the Landau Institute for Theoretical Physics (1989). He served previously as a researcher (1999-2001) at Microsoft Research and as a research associate (1989-1998) at the Landau Institute.
References
- ^ Kitaev, A. Yu. "Fault-tolerant quantum computation by anyons". arXiv:quant-ph/9707021v1.
- ^ Dorit Aharonov; Tomer Naveh (2002). "Quantum NP - A Survey". arXiv:quant-ph/0210077v1.
{{cite arXiv}}
:|class=
ignored (help)
http://www.cs.caltech.edu/cspeople/faculty/kitaev_a.html
http://www.macfound.org/site/c.lkLXJ8MQKrH/b.4537269/k.87D4/Alexei_Kitaev.htm