Saeed Mehraban

PhD 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.

Prior to MIT, I completed a B.Sc. degree in Electrical Engineering and a B.Sc. degree Physics in physics from Sharif university of technology, Tehran, Iran. Here is my google scholar and CV.

I am also an amateur artist (mainly as hobby) you can find my artworks in this page.

Publications:

1. Aram Harrow, Mehraban Saeed, "approximate unitary t-designs by short random quantum circuits using nearest neighbor and long-range gates", [arXiv]

Accepted as one out of the 5 plenary talks at the 22nd Annual Conference on Quantum Information Processing (QIP 2019).

2. Eldar Lior, Mehraban Saeed, "approximating the permanent of a random matrix with vanishing mean", to appear in FOCS 2018 [arXiv]

3. Aaronson Scott, Bouland Adam, Kuperberg Greg, Mehraban Saeed, "the computational complexity of ball permutations, proc STOC 2017 [arXiv]

4. Mehraban Saeed, Shirazi Amirhossein, Zamani Maryam, Jafari Gholamreza, "Coupling between time series: a network view", EPL 2017 [arXiv, Journal]

45 Mehraban Saeed, Ejtehadi Reza, "A self-organized graph evolution model with preferential network random walk" [arXiv]

6. Mehraban Saeed, "Computational Complexity of Some Quantum Theories in 1+1 Dimensions", Masters Thesis [arXiv, Thesis]

Talks

  • Approximate unitary t-designs by short random quantum circuits using nearest neighbor and long-range gates”, (One out of the five plenary talks). at the 22nd Annual Conference on Quantum Information Processing (QIP 2019). University of Colorado Boulder, Colorado USA. Based on a joint work with Aram Harrow
  • The complexity of sampling from a weak quantum computer”, Harvard Quantum Initiative Program. Harvard University, Cambridge, MA USA
  • Approximating the permanent of a random matrix”, (invited talk). Simons Institute Berkeley California. Based on a joint work with Lior Eldar”,
  • Approximate unitary t-designs by short random quantum circuits using nearest neighbor and long-range gates”, American Mathematical Society (AMS) Sectional meet- ing, based on a joint work with Aram Harrow, Northeastern University, Boston, Massachusetts, USA, April 2018
  • Invited to give a talk at the Paris International symposium on mathematical programming (ISMP), Paris July 2018,
  • Approximate unitary t-designs by short random quantum circuits using nearest neighbor and long-range gates” kickoff meeting for the IBM-MIT collaboration “Machine Learning in Hilbert Space”, IBM Research, Yorktown Heights, USA, March 2018
  • Computational complexity of ball permutations”, June 2017, Host: Jim Crutchfield, complexity Sciences center, UC Davis, California USA
  • Representation theory of the symmetric group and BQP universality of permutation gates”, Host: Greg Kuperberg, UC Davis, California USA
  • Computational complexity of ball permutations” Host: Scott Aaronson, UT Austin, January 2017


Teaching experience:

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