Saeed MehrabanPhD student, MIT EECSEmail: mehraban(at) mit (dot) eduAdress: 32-G636, 32 Vassar St, Cambridge, MA 02139
About: I am a PhD student in Electrical Engineering and Computer Science at MIT. I am advised by Aram Harrow and Scott Aaronson. My research interests include quantum computation, complexity theory and approximation algorithms.
I am also an amateur artist (mainly as hobby) you can find my artworks in this page.
1. Eldar Lior, Mehraban Saeed, "approximating the permanent of a random matrix with vanishing mean", to appear in FOCS 2018 [arXiv]
2. Aaronson Scott, Bouland Adam, Kuperberg Greg, Mehraban Saeed, "the computational complexity of ball permutations, proc STOC 2017 [arXiv]
4. Mehraban Saeed, Ejtehadi Reza, "A self-organized graph evolution model with preferential network random walk" [arXiv]
1. Harrow Aram, Mehraban Saeed, "approximate unitary t-designs by short random quantum circuits using nearest neighbor and long-range gates" [Abstract], the arXiv version is to be appeared online soon
1. (MIT) 6.443J Quantum information science, Teaching Assistant, Spring 2018
2. (MIT) 6.841 Introduction to the theory of computation, Teaching Assistant, Fall 2017
3. (MIT) 6.006 Introduction to algorithms, Teaching Assistant, Spring 2017
4. (MIT) 6.841 Introduction to the theory of computation , Teaching Assistant, Fall 2016
5. (MIT) 6.045 Automata, Computability, and Complexity, Teaching Assistant, Spring 2015
6. (Sharif University of Technology) Principles of Solid State Devices, Teaching Assistant, Spring 2012
7. (Sharif University of Technology) Analytical Mechanics II, Teaching Assistant, Spring 2012
8. (Sharif University of Technology) Analytical Mechanics I, Teaching Assistant, Fall 2011