We’re delighted to announce that Prof. Aaronson will be visiting us from July 9 till July 13 and will present a series of lectures on quantum complexity theory covering topics on complexity of linear optics and information content of quantum states.
The venue is the School of Informatics, University of Edinburgh, Room 4.33/4.31 on Tuesday, Wednesday and Thursday July 10, 11 and 12 from 15:00 till 16:30.
We hope you can all attend this unique rejuvenating QUISCO meetings.
Biography
Scott Aaronson is an Associate Professor of Electrical Engineering and Computer Science at MIT. He received his PhD in computer science from University of California, Berkeley and did postdocs at the Institute for Advanced Study and the University of Waterloo. Scott’s research interests center around fundamental limits on what can efficiently be computed in the physical world. This has entailed studying quantum computing, the most powerful model of computation we have based on known physical theory. He also writes a popular blog, and is the creator of the Complexity Zoo, an online encyclopedia of computational complexity theory. He is the recipient of NSF’s Alan T. Waterman Award for 2012.
I'm delighted to announce that Prof. Aaronson will be visiting us from July 9 till July 13 and will present a series of lectures on quantum complexity theory covering topics on complexity of linear optics and information content of quantum states. The venue is the School of Informatics, University of Edinburgh, Room 3.44 on Tuesday, Wednesday and Thursday July 10, 11 and 12 from 15:00 till 16:30. I hope you can all attend this unique rejuvenating QUISCO meetings, Elham BIO Scott Aaronson is an Associate Professor of Electrical Engineering and Computer Science at MIT. He received his PhD in computer science from University of California, Berkeley and did postdocs at the Institute for Advanced Study and the University of Waterloo. Scott's research interests center around fundamental limits on what can efficiently be computed in the physical world. This has entailed studying quantum computing, the most powerful model of computation we have based on known physical theory. He also writes a popular blog<http://(www.scottaaronson.com/blog)>, and is the creator of the Complexity Zoo <http://(www.complexityzoo.com)>, an online encyclopedia of computational complexity theory. He is the recipient of NSF's Alan T. Waterman Award<http://web.mit.edu/newsoffice/2012/aaronson-nsf-award-0308.html>for 2012.