131 citations · 192 across the 11 of their papers we have counts for
12 papers
Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes
Shouzhen Gu, Mehdi Soleimanifar
Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable…
Mixing time of quantum Gibbs sampling for random sparse Hamiltonians
Akshar Ramkumar, Mehdi Soleimanifar
Providing evidence that quantum computers can efficiently prepare low-energy or thermal states of physically relevant interacting quantum systems is a major challenge in quantum in…
When can classical neural networks represent quantum states?
Tai-Hsuan Yang, Mehdi Soleimanifar, Thiago Bergamaschi +1
A naive classical representation of an n-qubit state requires specifying exponentially many amplitudes in the computational basis. Past works have demonstrated that classical neura…
Quantum advantage from measurement-induced entanglement in random shallow circuits
Adam Bene Watts, David Gosset, Yinchen Liu +1
We study random constant-depth quantum circuits in a two-dimensional architecture. While these circuits only produce entanglement between nearby qubits on the lattice, long-range e…
Certifying almost all quantum states with few single-qubit measurements
Hsin-Yuan Huang, John Preskill, Mehdi Soleimanifar
Certifying that an n-qubit state synthesized in the lab is close to the target state is a fundamental task in quantum information science. However, existing rigorous protocols eith…
Testing matrix product states
Mehdi Soleimanifar, John Wright
Devising schemes for testing the amount of entanglement in quantum systems has played a crucial role in quantum computing and information theory. Here, we study the problem of test…
Improved approximation algorithms for bounded-degree local Hamiltonians
Anurag Anshu, David Gosset, Karen J. Morenz Korol +1
We consider the task of approximating the ground state energy of two-local quantum Hamiltonians on bounded-degree graphs. Most existing algorithms optimize the energy over the set…
From communication complexity to an entanglement spread area law in the ground state of gapped local Hamiltonians
Anurag Anshu, Aram W. Harrow, Mehdi Soleimanifar
In this work, we make a connection between two seemingly different problems. The first problem involves characterizing the properties of entanglement in the ground state of gapped…
Sample-efficient learning of quantum many-body systems
Anurag Anshu, Srinivasan Arunachalam, Tomotaka Kuwahara +1
We study the problem of learning the Hamiltonian of a quantum many-body system given samples from its Gibbs (thermal) state. The classical analog of this problem, known as learning…
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…
No-iteration of unknown quantum gates
Mehdi Soleimanifar, Vahid Karimipour
We propose a new no-go theorem by proving the impossibility of constructing a deterministic quantum circuit that iterates a unitary oracle by calling it only once. Different scheme…
Adaptive Molecule Transmission Rate for Diffusion Based Molecular Communication
Mohammad Movahednasab, Mehdi Soleimanifar, Amin Gohari +2
In this paper, a simple memory limited transmitter for molecular communication is proposed, in which information is encoded in the diffusion rate of the molecules. Taking advantage…