Follow
Saeed Mehraban
Title
Cited by
Cited by
Year
Approximate Unitary t-Designs by Short Random Quantum Circuits Using Nearest-Neighbor and Long-Range Gates
AW Harrow, S Mehraban
Communications in Mathematical Physics 401 (2), 1531-1626, 2023
1392023
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
452020
Separation of out-of-time-ordered correlation and entanglement
AW Harrow, L Kong, ZW Liu, S Mehraban, PW Shor
PRX Quantum 2 (2), 020339, 2021
352021
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
232018
Coupling between time series: A network view
S Mehraban, AH Shirazi, M Zamani, GR Jafari
Europhysics Letters 103 (5), 50011, 2013
212013
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
182017
Holomorphic representation of quantum computations
U Chabaud, S Mehraban
Quantum 6, 831, 2022
102022
Quantum-inspired permanent identities
U Chabaud, A Deshpande, S Mehraban
Quantum 6, 877, 2022
82022
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020
AW Harrow, S Mehraban, M Soleimanifar
Association for Computing Machinery, 2020
62020
Lower bounds on the approximate stabilizer rank: A probabilistic approach
S Mehraban, M Tahmasbi
arXiv preprint arXiv:2305.10277, 2023
32023
Computational Complexity of Some Quantum Theories in Dimensions
S Mehraban
arXiv preprint arXiv:1512.09243, 2015
32015
Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits
E Boix-Adsera, L Eldar, S Mehraban
arXiv preprint arXiv:1912.03824, 2019
22019
Quadratic Lower bounds on the Approximate Stabilizer Rank: A Probabilistic Approach
S Mehraban, M Tahmasbi
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 608-619, 2024
12024
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–16