Non-Abelian quantum codes connect quantum error correction, phases of matter, and computational resources. In this work, we develop a general framework for constructing non-Abelian quantum low-density parity-check (qLDPC) codes by gauging sheaf codes via cup products and use it to obtain families with constant encoding...
Zi-Mu Li, Fu-Chuan Wei, Zhen Han et al.· 1 citation· ⚡1
Preparing logical codewords with a single round of noisy syndrome measurements can reduce the time overhead of fault-tolerant quantum computation. It remains unclear which structural properties of the code suffice to guarantee a threshold for single-shot state preparation. Here we prove that linear confinement suffices...
Yuan-Yuan Zhao, Yi-Zheng Yuan, Zhen Han et al.· 0 citations
We prove that constant-space-overhead fault-tolerant quantum computation can be achieved with provably strictly logarithmic time overhead, improving over the best known results with additional subpolylogarithmic factors. Our main construction uses polynomial-subrank transversal logical $\CCZ$ gates on good quantum loca...
A key appeal of quantum low-density parity check (qLDPC) codes is their ability to suppress stochastic Pauli noise below nonzero thresholds. Coherent errors are fundamentally different: they produce superpositions of error patterns whose amplitudes can interfere even after syndrome measurement. Rigorous understanding o...
Zhen Han, Yuan-Yuan Zhao, Yi-Jia Xu et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
