3 papers
quant-ph2026
Post-Quantum Cryptography from Quantum Stabilizer Decoding
Jonathan Z. Lu, Alexander Poremba, Yihui Quek +1
Post-quantum cryptography currently rests on a small number of hardness assumptions, posing significant risks should any one of them be compromised. This vulnerability motivates th…
quant-ph2026
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-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…