Computational Complexity of Some Quantum Theories in $1+1$ Dimensions. - Saeed Mehraban (CoRR, 2015)

The computational complexity of ball permutations. - Scott Aaronson; Adam Bouland; Greg Kuperberg; Saeed Mehraban (STOC, 2017)

Approximating the Permanent of a Random Matrix with Vanishing Mean. - Lior Eldar; Saeed Mehraban (FOCS, 2018)

Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits. - Enric Boix-Adserà; Lior Eldar; Saeed Mehraban (CoRR, 2019)

Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems. - Aram W. Harrow; Saeed Mehraban; Mehdi Soleimanifar (STOC, 2020)

Quantum-inspired permanent identities. - Ulysse Chabaud; Abhinav Deshpande; Saeed Mehraban (Quantum, 2022)

Holomorphic representation of quantum computations. - Ulysse Chabaud; Saeed Mehraban (Quantum, 2022)

Lower bounds on the Approximate Stabilizer Rank: A Probabilistic Approach. - Saeed Mehraban; Mehrdad Tahmasbi (CoRR, 2023)

Quadratic Lower Bounds on the Approximate Stabilizer Rank: A Probabilistic Approach. - Saeed Mehraban; Mehrdad Tahmasbi (STOC, 2024)

The Space Just Above One Clean Qubit. - Dale Jacobs; Saeed Mehraban (CoRR, 2024)

Bosonic Quantum Computational Complexity. - Ulysse Chabaud; Michael Joseph; Saeed Mehraban; Arsalan Motamedi (ITCS, 2025)

Improved Bounds for Testing Low Stabilizer Complexity States. - Saeed Mehraban; Mehrdad Tahmasbi (STOC, 2025)