Saeed Mehraban
Saeed Mehraban
Verified email at caltech.edu - Homepage
Title
Cited by
Cited by
Year
Approximate unitary -designs by short random quantum circuits using nearest-neighbor and long-range gates
A Harrow, S Mehraban
arXiv preprint arXiv:1809.06957, 2018
202018
Coupling between time series: A network view
S Mehraban, AH Shirazi, M Zamani, GR Jafari
EPL (Europhysics Letters) 103 (5), 50011, 2013
162013
Approximating the permanent of a random matrix with vanishing mean
L Eldar, S Mehraban
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 23-34, 2018
142018
Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems
AW Harrow, S Mehraban, M Soleimanifar
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computingá…, 2020
72020
The computational complexity of ball permutations
S Aaronson, A Bouland, G Kuperberg, S Mehraban
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computingá…, 2017
62017
A separation of out-of-time-ordered correlator and entanglement
AW Harrow, L Kong, ZW Liu, S Mehraban, PW Shor
arXiv preprint arXiv:1906.02219, 2019
22019
Computational Complexity of Some Quantum Theories in Dimensions
S Mehraban
arXiv preprint arXiv:1512.09243, 2015
22015
Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits
E Boix-AdserÓ, L Eldar, S Mehraban
arXiv preprint arXiv:1912.03824, 2019
12019
A self-organized graph evolution model with preferential network random walk
S Mehraban, MR Ejtehadi
arXiv preprint arXiv:1205.7069, 2012
12012
The complexity of sampling from a weak quantum computer
S Mehraban
Massachusetts Institute of Technology, 2019
2019
Computational complexity of certain quantum theories in 1+ 1 dimensions
S Mehraban
Massachusetts Institute of Technology, 2015
2015
The system can't perform the operation now. Try again later.
Articles 1–11