Quantum low-density parity check (QLDPC) codes can significantly reduce the overhead of quantum computing, provided the methods for performing logical operations do not require substantial space and time resources.
A popular method for performing logical operations is by measuring logical Pauli operators.
We present a simple, explicit construction for fixed gadgets that can measure arbitrary logical Pauli operators on QLDPC codes when dynamically connected to the code block.
We apply this construction to a family of generalised bicycle codes with distances relevant to utility-scale quantum computation ($10\leq d \leq 24$) and show that it reduces the space overhead by at least an order of magnitude compared to corresponding surface code architectures, without increasing the time overhead.
Explicit construction of low-overhead gadgets for gates on quantum LDPC codes · Around
Built on
A. A. Kovalev and L. P. Pryadko, Phys. Rev. A 88
2013
Earlier work this paper cites.
D. Litinski, Quantum 3
2019
Earlier work this paper cites.
N. P. Breuckmann and J. N. Eberhardt, PRX Quantum 2
L. Z. Cohen, I. H. Kim, S. D. Bartlett, and B. J. Brown, Science Advances 8
2022
Earlier work this paper cites.
P. Panteleev and G. Kalachev, in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , STOC 2022 (Association for Computing Machinery, New York, NY, USA, 2022) p. 375–388