Faculty

	Daniel Gottesman PhD Caltech (1997) Quantum Information
	Phone:	(519) 569-7600 x8581
	Email:	dgottesman[at]perimeterinstitute.ca
	Personal Webpage:	http://www.perimeterinstitute.ca/personal/dgottesman/

Daniel Gottesman received his PhD in 1997 from Caltech, where he was a student of John Preskill. He then held postdoctoral positions at Los Alamos National Lab, Microsoft Research, and UC Berkeley (as a long-term CMI Prize Fellow for the Clay Mathematics Institute).

Affiliations

University of Waterloo (adjunct)

Positions Held

• 2002 - present Perimeter Institute for Theoretical Physics Faculty Member
• 2001 - 20002 Theory group, Computer Science Department, UC Berkeley Long-Term Clay Mathematics Institute Prize Fellow
• 1999 - 2000 Theory group, Microsoft Research Postdoctoral Researcher
• 1997 - 1999 T-6 and CIC-3 groups, Los Alamos National Laboratory Director-Funded Postdoctoral Fellow

Awards

• Promoted to CIFAR Fellow in Quantum Information Processing program
• Named as CIFAR Scholar in Quantum Information Processing program
• Named to 2003 TR100: Top Young Innovators by MIT Technology Review
• Long-Term Clay Mathematics Institute Prize Fellowship
• National Science Foundation Graduate Fellowship
• Elected Junior Phi Beta Kappa at Harvard
• Member of 1988 U.S. Physics Olympiad Team
• National Merit Scholar
• Participant in 1987 U.S. Math Olympiad Program
• 17th Place in 1987 U.S. Mathematical Olympiad

Recent Publications

• Daniel Gottesman, Spin Systems and Computational Complexity, Physics in Canada, vol. 66, no. 2, pp. 87-89, 2010, arxiv: 0911.5596
• D. Gottesman, S. Irani, The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems, Proc. 50th Annual Symp. on Foundations of Computer Science, 95-104 (2009), arxiv: 0905.2419
• Daniel Gottesman, M. B. Hastings, Entanglement vs. gap for one-dimensional spin systems, New J. Phys. 12, 025002 (2010)., arxiv: 0901.1108
• R. Cleve, D. Gottesman, M. Mosca, R.D. Somma, D.L. Yonge-Mallo, Efficient discrete-time simulations of continuous-time quantum query algorithms, Proc. 41st Ann. Symp. on Theory of Computing, 409-416 (2009), arxiv: 0811.4428
• Michael Ben-Or, Claude Crepeau, Daniel Gottesman, Avinatan Hassidim, Adam Smith, Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority, Proc. 47th Annual IEEE Symposium on the Foundations of Computer Science (FOCS '06), pp. 249-260. IEEE Press, 2006, arxiv: 0801.1544
• D. Aharonov, D. Gottesman, S. Irani, J. Kempe, The power of quantum systems on a line, Proc. 48th IEEE Symposium on the Foundations of Computer Science (FOCS), 373-383 (2007), full version Comm. Math. Physics 287, No. 1, 41-65 (2009), arxiv: 0705.4077
• P. Aliferis, D. Gottesman, J. Preskill, Accuracy threshold for postselected quantum computation, Quantum Information and Computation 8, No. 3, 181-244 (2008), quant-ph/0703264
• D. Gottesman, Fault-Tolerant Quantum Computation, Physics in Canada 63, No. 4, (Oct.-Dec. 2007), quant-ph/0701112
• C. Cormick, E. F. Galvao, D. Gottesman, J. P. Paz, and A. O. Pittenger, Classicality in discrete Wigner functions, Phys. Rev. A 73, 012301 (2006) (9 pages), quant-ph/0506222
• P. Aliferis, D. Gottesman, and J. Preskill, Quantum accuracy threshold for concatenated distance-3 codes, Quant. Information and Computation 6, No. 2, 97-165 (2006), quant-ph/0504218
• S. Bravyi, D. Fattal, and D. Gottesman, GHZ extraction yield for multipartite stabilizer states, J. Math. Phys. 47, 062106 (2006) (19 pages), quant-ph/0504208.
• Streaming universal distortion-free entanglement concentration, Robin Blume-Kohout, Sarah Croke, Daniel Gottesman, arxiv: 0910.5952
• D. Gottesman, An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation, arxiv: 0904.2557

Seminars

• Quantum Error Correction, 4 1.25-hour lectures at 10th Canadian Summer School on Quantum Information (Vancouver, British Columbia, July 17-18, 2010)
• Proving the Threshold Theorem for Fault Tolerant Quantum Computation, 3 lectures at NATO ASI in Quantum Information Processing and Quantum Cryptography (Montreal, Quebec, June 25, 2010)
• Computational Complexity of Translationally-Invariant Systems, Invited talk at Workshop on Quantum Statistical Mechanics, Computation, and Information (Trieste, Italy, June 18, 2010)
• Computational Complexity of Translationally-Invariant Systems, Invited talk at SFB meeting (Innsbruck, Austria, May 7, 2010)
• Spin Glasses and Computational Complexity, Harvard Physics Colloquium (Cambridge, Massachusetts, Mar. 22, 2010)
• The quantum and classical complexity of translationally invariant tiling and Hamiltonian problems, QIP 2010 long contributed talk (Zurich, Switzerland, Jan. 18, 2010)
• Computationally Hard Problems in Translationally-Invariant Spin Systems, KITP Quantum Information Science seminar (Santa Barbara, California, Nov. 13, 2009)
• Computational Complexity of Translationally-Invariant Systems, Princeton Quantum Computation Seminar (Princeton, New Jersey, Sep. 16, 2009)
• PIRSA:09100032, Harnessing Quantum Physics, 2009-10-18, Quantum to Cosmos Festival - Tickets Available starting TUE. Sep 8, 2009
• PIRSA:09080056, Quantum Cryptography, 2009-08-20, ISSYP 2009
• PIRSA:08080052, Identifying Stabilizer States , 2008-08-29, Quantum Estimation: Theory and Practice
• PIRSA:08070024, Quantum Mechanics for 10-Year Olds, 2008-07-07, EinsteinPlus 2008
• PIRSA:07040020, Quantum Cryptography: A Tale of Secrets Hidden and Revealed Through the Laws of Physics, 2007-04-04, Perimeter Institute Public Lecture Series