Constant-Overhead Magic State Injection into qLDPC Codes with Error Independence Guarantees
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913831858470912 |
|---|---|
| author | Zhang, Guo Zhu, Yuanye Yuan, Xiao Li, Ying |
| author_facet | Zhang, Guo Zhu, Yuanye Yuan, Xiao Li, Ying |
| contents | Magic states are essential yet resource-intensive components for realizing universal fault-tolerant quantum computation. Preparing magic states within emerging quantum low-density parity-check (qLDPC) codes poses additional challenges, due to the complex encoding structures. Here, we introduce a generic and scalable method for magic state injection into arbitrarily selected logical qubits encoded using qLDPC codes. Our approach, based on parallelized code surgery, supports the injection from either physical qubits or low-distance logical qubits. For qLDPC code families with asymptotically constant encoding rates, the method achieves injection into $Θ(k)$ logical qubits -- where $k$ denotes the logical qubit number of the code -- with only constant qubit overhead and a time complexity of $\tilde{O}(d^2)$, where $d$ is the code distance. A central contribution of this work is a rigorous proof that errors affecting the injected magic states remain independent throughout the procedure. This independence ensures the resilience of logical qubits against interactions with noisy ancillae and preserves the presumption of subsequent magic state distillation protocols. We further support our theoretical results with numerical validation through circuit-level simulations. These findings advance the feasibility of scalable, fault-tolerant universal quantum computing using qLDPC codes, offering a pathway to significantly reduced qubit resource requirements in magic state injection. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_06981 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Constant-Overhead Magic State Injection into qLDPC Codes with Error Independence Guarantees Zhang, Guo Zhu, Yuanye Yuan, Xiao Li, Ying Quantum Physics Magic states are essential yet resource-intensive components for realizing universal fault-tolerant quantum computation. Preparing magic states within emerging quantum low-density parity-check (qLDPC) codes poses additional challenges, due to the complex encoding structures. Here, we introduce a generic and scalable method for magic state injection into arbitrarily selected logical qubits encoded using qLDPC codes. Our approach, based on parallelized code surgery, supports the injection from either physical qubits or low-distance logical qubits. For qLDPC code families with asymptotically constant encoding rates, the method achieves injection into $Θ(k)$ logical qubits -- where $k$ denotes the logical qubit number of the code -- with only constant qubit overhead and a time complexity of $\tilde{O}(d^2)$, where $d$ is the code distance. A central contribution of this work is a rigorous proof that errors affecting the injected magic states remain independent throughout the procedure. This independence ensures the resilience of logical qubits against interactions with noisy ancillae and preserves the presumption of subsequent magic state distillation protocols. We further support our theoretical results with numerical validation through circuit-level simulations. These findings advance the feasibility of scalable, fault-tolerant universal quantum computing using qLDPC codes, offering a pathway to significantly reduced qubit resource requirements in magic state injection. |
| title | Constant-Overhead Magic State Injection into qLDPC Codes with Error Independence Guarantees |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2505.06981 |