default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaeed Mehraban
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j2]Ulysse Chabaud
, Saeed Mehraban:
Holomorphic representation of quantum computations. Quantum 6: 831 (2022)- [j1]Ulysse Chabaud, Abhinav Deshpande, Saeed Mehraban:
Quantum-inspired permanent identities. Quantum 6: 877 (2022)
Conference and Workshop Papers
- 2024
- [c4]Saeed Mehraban, Mehrdad Tahmasbi:
Quadratic Lower Bounds on the Approximate Stabilizer Rank: A Probabilistic Approach. STOC 2024: 608-619 - 2020
- [c3]Aram W. Harrow, Saeed Mehraban, Mehdi Soleimanifar:
Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems. STOC 2020: 378-386 - 2018
- [c2]Lior Eldar, Saeed Mehraban:
Approximating the Permanent of a Random Matrix with Vanishing Mean. FOCS 2018: 23-34 - 2017
- [c1]Scott Aaronson, Adam Bouland, Greg Kuperberg, Saeed Mehraban:
The computational complexity of ball permutations. STOC 2017: 317-327
Informal and Other Publications
- 2024
- [i8]Ulysse Chabaud, Michael Joseph, Saeed Mehraban, Arsalan Motamedi:
Bosonic Quantum Computational Complexity. CoRR abs/2410.04274 (2024) - [i7]Dale Jacobs, Saeed Mehraban:
The Space Just Above One Clean Qubit. CoRR abs/2410.08051 (2024) - 2023
- [i6]Saeed Mehraban, Mehrdad Tahmasbi:
Lower bounds on the Approximate Stabilizer Rank: A Probabilistic Approach. CoRR abs/2305.10277 (2023) - 2019
- [i5]Aram W. Harrow, Saeed Mehraban, Mehdi Soleimanifar:
Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems. CoRR abs/1910.09071 (2019) - [i4]Enric Boix-Adserà, Lior Eldar, Saeed Mehraban:
Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits. CoRR abs/1912.03824 (2019) - 2017
- [i3]Lior Eldar, Saeed Mehraban:
Approximating the Permanent of a Random Matrix with Vanishing Mean. CoRR abs/1711.09457 (2017) - 2016
- [i2]Scott Aaronson, Adam Bouland, Greg Kuperberg, Saeed Mehraban:
The Computational Complexity of Ball Permutations. CoRR abs/1610.06646 (2016) - 2015
- [i1]Saeed Mehraban:
Computational Complexity of Some Quantum Theories in $1+1$ Dimensions. CoRR abs/1512.09243 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
