Showing quant-phShow all
3 papers · 1 filter
quant-ph2025
Average-Case Complexity of Quantum Stabilizer Decoding
Andrey Boris Khesin, Jonathan Z. Lu, Alexander Poremba +2
Random classical linear codes are widely believed to be hard to decode. While slightly sub-exponential time algorithms exist when the coding rate vanishes sufficiently rapidly, all…
quant-ph2025
High-Temperature Fermionic Gibbs States are Mixtures of Gaussian States
Akshar Ramkumar, Yiyi Cai, Yu Tong +1
Efficient simulation of a quantum system generally relies on structural properties of the quantum state. Motivated by the recent results by Bakshi et al. on the sudden death of ent…
quant-ph2024
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…