1 citations · 2 across the 6 of their papers we have counts for
8 papers · 1 filter
A polynomial-time approximation scheme for minimum-weight decoding of topological codes
Shouzhen Gu, Lily Wang, Aleksander Kubica
Two-dimensional topological translationally invariant (2D TTI) stabilizer codes lie at the heart of fault-tolerant quantum computation, but using them requires solving the decoding…
The color code, the surface code, and the transversal CNOT: NP-hardness of minimum-weight decoding
Shouzhen Gu, Lily Wang, Aleksander Kubica
The decoding problem is a ubiquitous algorithmic task in fault-tolerant quantum computing, and solving it efficiently is essential for scalable quantum computing. Here, we prove th…
Check-weight-constrained quantum codes: Bounds and examples
Lily Wang, Andy Zeyi Liu, Ray Li +2
Quantum low-density parity-check (qLDPC) codes can be implemented by measuring only low-weight checks, making them compatible with noisy quantum hardware and central to the quest t…
Layer codes as partially self-correcting quantum memories
Shouzhen Gu, Libor Caha, Shin Ho Choe +3
We investigate layer codes, a family of three-dimensional stabilizer codes that can achieve optimal scaling of code parameters and a polynomial energy barrier, as candidates for se…
Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes
Shouzhen Gu, Mehdi Soleimanifar
Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable…
Fast correlated decoding of transversal logical algorithms
Madelyn Cain, Dolev Bluvstein, Chen Zhao +7
Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead. Recent advances have shown that by jointly decoding logical qubi…