collaborators
Showing quant-phShow all

7 papers · 1 filter

quant-ph2026

Mirror codes: High-threshold quantum LDPC codes beyond the CSS regime

Andrey Boris Khesin, Jonathan Z. Lu

The realization of quantum error correction protocols whose logical error rates are suppressed far below physical error rates relies on an intricate combination: the error-correcti…

quant-ph20261 cited

SpiderCat: Optimal Fault-Tolerant Cat State Preparation

Andrey Boris Khesin, Sarah Meng Li, Boldizsár Poór +3

The ability to fault-tolerantly prepare CAT states, also known as multi-qubit GHZ states, is an important primitive for quantum error correction. It is required for Shor-style synd…

quant-ph2025

Universal graph representation of stabilizer codes

Andrey Boris Khesin, Jonathan Z. Lu, Peter W. Shor

While stabilizer tableaus have proven useful as a descriptive tool for additive quantum codes, they otherwise offer little guidance for concrete constructions or algorithm analysis…

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

Graphical quantum Clifford-encoder compilers from the ZX calculus

Andrey Boris Khesin, Jonathan Z. Lu, Peter W. Shor

We present a quantum compilation algorithm that maps Clifford encoders, encoding maps for stabilizer quantum codes, to a unique graphical representation in the ZX calculus. Specifi…

quant-ph2025

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…