5 papers
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…
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…
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…
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…
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…