9 citations · 27 across the 14 of their papers we have counts for
Showing 2025 · quant-phShow all
2 papers · 2 filters
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★ 1 cited
Quantum Computing from Graphs
Andrey Boris Khesin
While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorit…