Explicit construction of low-overhead gadgets for gates on quantum LDPC codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918210424537088 |
|---|---|
| author | Webster, Paul Smith, Samuel C. Cohen, Lawrence Z. |
| author_facet | Webster, Paul Smith, Samuel C. Cohen, Lawrence Z. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_15989 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Explicit construction of low-overhead gadgets for gates on quantum LDPC codes Webster, Paul Smith, Samuel C. Cohen, Lawrence Z. Quantum Physics 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. |
| title | Explicit construction of low-overhead gadgets for gates on quantum LDPC codes |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2511.15989 |