9 citations · 27 across the 14 of their papers we have counts for
12 papers · 1 filter
SpiderCSS: Scalable Fault-Tolerant CSS State Preparation
Boldizsár Poór, Andrey Boris Khesin, Sarah Meng Li +3
Fault-tolerant preparation of logical states is a critical primitive for the realization of large-scale fault-tolerant quantum computing. This paper introduces SpiderCSS, a scalabl…
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…
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…
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…
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…
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…
Equivalence Classes of Quantum Error-Correcting Codes
Andrey Boris Khesin, Alexander Li
Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. Using ZX calculus, we represent QECC's in a form called a ZX diagram, c…
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…
Publicly verifiable quantum money from random lattices
Andrey Boris Khesin, Jonathan Z. Lu, Peter W. Shor
Publicly verifiable quantum money is a protocol for the preparation of quantum states that can be efficiently verified by any party for authenticity but is computationally infeasib…
Simultaneous Measurement and Entanglement
Andrey Boris Khesin, Peter Shor
We study scenarios which arise when two spatially-separated observers, Alice and Bob, are try to identify a quantum state sampled from several possibilities. In particular, we exam…
Improved Graph Formalism for Quantum Circuit Simulation
Alexander Tianlin Hu, Andrey Boris Khesin
Improving the simulation of quantum circuits on classical computers is important for understanding quantum advantage and increasing development speed. In this paper, we explore a n…
Extending the Graph Formalism to Higher-Order Gates
Andrey Boris Khesin, Kevin Ren
We present an algorithm for efficiently simulating a quantum circuit in the graph formalism. In the graph formalism, we represent states as a linear combination of graphs with Clif…