Academic
Publications:
Mehraban Saeed, Tahmasbi Mehrdad, "Quadratic Lower Bounds on the Stabilizer Rank: A Probabilistic Approach", [arXiv, Presented at QIP 2024, to be presented at STOC 2024]
Chabaud Ulysse, Deshpande Abhinav, Mehraban Saeed, "Quantum Inspired Permanent Identities", Quantum, 6, 877. [arXiv, Quantum]
Chabaud Ulysse, Mehraban Saeed, "Holomorphic quantum computing", Presented at QIP 2022 [arXiv]
Harrow Aram, Mehraban Saeed, Soleimanifar Mehdi, "Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems", [arXiv, STOC, video], STOC 2020.
Boix-Adserà Enric, Eldar Lior, Mehraban Saeed, "Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits", [arXiv]
Harrow Aram, Kong Linghang, Liu Zi-Wen, Mehraban Saeed, Shor Peter, "A Separation of Out-of-time-ordered Correlator and Entanglement", PRX Quantum, 2(2), 020339, Presented as a long talk AQIS 2019 [arXiv, PRX, video]
Harrow Aram, Mehraban Saeed, "approximate unitary t-designs by short random quantum circuits using nearest neighbor and long-range gates", [arXiv, video]
Accepted as one out of the 5 plenary talks at the 22nd Annual Conference on Quantum Information Processing (QIP 2019).
Eldar Lior, Mehraban Saeed, "approximating the permanent of a random matrix with vanishing mean", FOCS 2018 [arXiv, FOCS]
Aaronson Scott, Bouland Adam, Kuperberg Greg, Mehraban Saeed, "the computational complexity of ball permutations", STOC 2017 [arXiv, STOC]
Mehraban Saeed, Shirazi Amirhossein, Zamani Maryam, Jafari Gholamreza, "Coupling between time series: a network view", EPL 2017 [arXiv, Journal]
Mehraban Saeed, Ejtehadi Reza, "A self-organized graph evolution model with preferential network random walk" [arXiv]
Thesis:
Mehraban Saeed, "The Computational Complexity of Sampling from a Weak Quantum Computer", Ph.D. Thesis [Thesis]
Thesis supervisors: Scott Aaronson and Aram Harrow
Mehraban Saeed, "Computational Complexity of Some Quantum Theories in 1+1 Dimensions", Masters Thesis [arXiv, Thesis]
Thesis supervisor: Scott Aaronson
Teaching:
CS-150 Seminar in Quantum Information Science at Tufts University, Fall 2023.
CS-150 Quantum Computer Science at Tufts University, Spring 2023.
CS-150 Quantum Complexity Theory at Tufts University, Fall 2022.
Talks:
Online talk at the Mila Institute, Montreal, Canada, November 2021
Title: "Holomorphic Quantum Computing", based on joint work with Ulysse Chabaud.
Talk at the CS Colloquium, Harvard University, Cambridge MA, USA, April 2021
Title: Pseudo-randomness, complex zeros of polynomials, and hardness of sampling from small quantum devices
Talk at CS Colloquium UT Austin Computer Science, Austin, TX, USA, March 2021
Title: Pseudo-randomness, complex zeros of polynomials, and hardness of sampling from small quantum devices
Talk at UC Davis Computer Science, Medford, MA, USA, March 2021
Title: Pseudo-randomness, complex zeros of polynomials, and hardness of sampling from small quantum devices
Talk at Tufts Computer Science, Medford, MA, USA, February 2021
Title: Pseudo-randomness, average-case complexity, and hardness of sampling from small quantum devices
Talk at the Quantum Innovators in Computer Science and Mathematics, Institute for Quantum Computing at the University of Waterloo, October 2019 [Link]
Title: “The old-new extrapolation technique and its quantum interfaces”
Talk at the Institute at the Quantum Information, California Institute of Technology, April 2019,
Title: “The complexity of sampling from a weak quantum computer”, based on joint work with Lior Eldar and Aram Harrow
Talk at the Deterministic Counting, Probability, and Zeros of Partition Functions program at Simons Institute For the theory of computing March 2019, [video]
Title: “Approximating the permanent of a random matrix”, based on joint work with Lior Eldar
Talk at the Harvard Quantum Initiative Special Seminar, January 2019,
Title: “The complexity of sampling from a weak quantum computer”, based on joint works with Lior Eldar and Aram Harrow
“approximate unitary t-designs by short random quantum circuits using nearest neighbor and long-range gates”, American Mathematical Society (AMS) Sectional meeting, based on joint work with Aram Harrow, Northeastern University, Boston, Massachusetts, USA, April 2018 [Abstract]
“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”, Host: Jim Crutchfield, June 2017, 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