1 citations · 2 across the 4 of their papers we have counts for
5 papers · 1 filter
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…
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…