9 citations · 27 across the 14 of their papers we have counts for
Showing 2025Show 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…
math.HO2025
SET! From Groups to Games
Andrey Boris Khesin, Tanya Khovanova
The game of SET is one of the best mathematical games ever. It is no wonder that people have tried to generalize it. We discuss existing generalizations of the game of SET to diffe…
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…