5 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…