127 citations · 262 across the 14 of their papers we have counts for
16 papers
A physical and universal model of bosonic computations with Solovay-Kitaev theorem
Dorian Rudolph, Arsalan Motamedi, Dhruva Sambrani +4
Bosonic quantum systems are among the leading architectures for quantum information processing, offering continuous-variable degrees of freedom with strong error-correction capabil…
Quantum state isomorphism problems for groups
Alexandru Gheorghiu, Dale Jacobs, Saeed Mehraban +1
We study the computational complexity of quantum state isomorphism problems under group actions: given two quantum circuits that prepare pure or mixed states, decide whether the tw…
Energy, Bosons and Computational Complexity
Dorian Rudolph, Arsalan Motamedi, Dhruva Sambrani +4
We investigate the role of energy, i.e. average photon number, as a resource in the computational complexity of bosonic systems. We show three sets of results: (1. Energy growth ra…
Bosonic Quantum Computational Complexity
Ulysse Chabaud, Michael Joseph, Saeed Mehraban +1
Quantum computing involving physical systems with continuous degrees of freedom, such as the quantum states of light, has recently attracted significant interest. However, a well-d…
Quadratic Lower bounds on the Approximate Stabilizer Rank: A Probabilistic Approach
Saeed Mehraban, Mehrdad Tahmasbi
The approximate stabilizer rank of a quantum state is the minimum number of terms in any approximate decomposition of that state into stabilizer states. Bravyi and Gosset showed th…
Quantum-inspired permanent identities
Ulysse Chabaud, Abhinav Deshpande, Saeed Mehraban
The permanent is pivotal to both complexity theory and combinatorics. In quantum computing, the permanent appears in the expression of output amplitudes of linear optical computati…
Holomorphic representation of quantum computations
Ulysse Chabaud, Saeed Mehraban
We study bosonic quantum computations using the Segal-Bargmann representation of quantum states. We argue that this holomorphic representation is a natural one which not only gives…
Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits
Enric Boix-Adserà, Lior Eldar, Saeed Mehraban
The determinant can be computed by classical circuits of depth , and therefore it can also be computed in classical space . Recent progress by Ta-Shma [Ta…
Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems
Aram Harrow, Saeed Mehraban, Mehdi Soleimanifar
In this paper, we present a quasi-polynomial time classical algorithm that estimates the partition function of quantum many-body systems at temperatures above the thermal phase tra…
A Separation of Out-of-time-ordered Correlation and Entanglement
Aram W. Harrow, Linghang Kong, Zi-Wen Liu +2
The out-of-time-ordered correlation (OTOC) and entanglement are two physically motivated and widely used probes of the "scrambling" of quantum information, a phenomenon that has dr…
Approximate unitary -designs by short random quantum circuits using nearest-neighbor and long-range gates
Aram Harrow, Saeed Mehraban
We prove that -depth local random quantum circuits with two qudit nearest-neighbor gates on a -dimensional lattice with n qudits are approximate -desig…
Approximating the Permanent of a Random Matrix with Vanishing Mean
Lior Eldar, Saeed Mehraban
We show an algorithm for computing the permanent of a random matrix with vanishing mean in quasi-polynomial time. Among special cases are the Gaussian, and biased-Bernoulli random…
The Computational Complexity of Ball Permutations
Scott Aaronson, Adam Bouland, Greg Kuperberg +1
Inspired by connections to two dimensional quantum theory, we define several models of computation based on permuting distinguishable particles (which we call balls), and character…
Computational Complexity of Some Quantum Theories in Dimensions
Saeed Mehraban
We study the computational complexity of certain integrable quantum theories in 1+1 dimensions. We formalize a model of quantum computation based on these theories. In this model,…
Coupling between time series: a network view
Saeed Mehraban, Amirhossein Shirazi, Maryam Zamani +1
Recently, the visibility graph has been introduced as a novel view for analyzing time series, which maps it to a complex network. In this paper, we introduce new algorithm of visib…
A self-organized graph evolution model with preferential network random walk
S. Mehraban, M. R. Ejtehadi
We introduce a self-organized model of graph evolution associated with preferential network random walkers. The idea is developed by using two different types of walkers, the inter…