| 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 | 211 | 2023 |
| 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 | 63 | 2020 |
| 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 | 40 | 2021 |
| Holomorphic representation of quantum computations U Chabaud, S Mehraban Quantum 6, 831, 2022 | 37 | 2022 |
| 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 | 28 | 2018 |
| 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 | 23 | 2017 |
| Coupling between time series: A network view S Mehraban, AH Shirazi, M Zamani, GR Jafari Europhysics Letters 103 (5), 50011, 2013 | 23 | 2013 |
| Quantum-inspired permanent identities U Chabaud, A Deshpande, S Mehraban Quantum 6, 877, 2022 | 16 | 2022 |
| Improved bounds for testing low stabilizer complexity states S Mehraban, M Tahmasbi Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 1222-1233, 2025 | 13 | 2025 |
| 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 | 8 | 2024 |
| Bosonic quantum computational complexity U Chabaud, M Joseph, S Mehraban, A Motamedi arXiv preprint arXiv:2410.04274, 2024 | 7 | 2024 |
| The Space Just Above One Clean Qubit D Jacobs, S Mehraban arXiv preprint arXiv:2410.08051, 2024 | 4 | 2024 |
| Computational Complexity of Some Quantum Theories in Dimensions S Mehraban arXiv preprint arXiv:1512.09243, 2015 | 3 | 2015 |
| Lower bounds on the approximate stabilizer rank: A probabilistic approach S Mehraban, M Tahmasbi arXiv preprint arXiv:2305.10277, 2023 | 2 | 2023 |
| Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits E Boix-Adsera, L Eldar, S Mehraban arXiv preprint arXiv:1912.03824, 2019 | 2 | 2019 |
| Energy, bosons and computational complexity U Chabaud, S Gharibian, S Mehraban, A Motamedi, HR Naeij, D Rudolph, ... arXiv preprint arXiv:2510.08545, 2025 | 1 | 2025 |
| A self-organized graph evolution model with preferential network random walk S Mehraban, MR Ejtehadi arXiv preprint arXiv:1205.7069, 2012 | 1 | 2012 |
| 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 |
| Logg inn Velkommen! Logg inn på kontoen din U Chabaud, S Mehraban | | |
aram harrowPhysics, MITVerified email at mit.edu
