Time-Efficient Logical Operations on Quantum Low-Density Parity Check Codes
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910870959816704 |
|---|---|
| author | Zhang, Guo Li, Ying |
| author_facet | Zhang, Guo Li, Ying |
| contents | We propose schemes capable of measuring an arbitrary set of commutative logical Pauli operators in time independent of the number of operators. The only condition is commutativity, a fundamental requirement for simultaneous measurements in quantum mechanics. Quantum low-density parity check (qLDPC) codes show great promise for realizing fault-tolerant quantum computing. They are particularly significant for early fault-tolerant technologies as they can encode many logical qubits using relatively few physical qubits. By achieving simultaneous measurements of logical operators, our approaches enable fully parallelized quantum computing, thus minimizing computation time. Our schemes are applicable to any qLDPC codes and maintain the low density of parity checks while measuring multiple logical operators simultaneously. These results enhance the feasibility of applying early fault-tolerant technologies to practical problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_01339 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Time-Efficient Logical Operations on Quantum Low-Density Parity Check Codes Zhang, Guo Li, Ying Quantum Physics We propose schemes capable of measuring an arbitrary set of commutative logical Pauli operators in time independent of the number of operators. The only condition is commutativity, a fundamental requirement for simultaneous measurements in quantum mechanics. Quantum low-density parity check (qLDPC) codes show great promise for realizing fault-tolerant quantum computing. They are particularly significant for early fault-tolerant technologies as they can encode many logical qubits using relatively few physical qubits. By achieving simultaneous measurements of logical operators, our approaches enable fully parallelized quantum computing, thus minimizing computation time. Our schemes are applicable to any qLDPC codes and maintain the low density of parity checks while measuring multiple logical operators simultaneously. These results enhance the feasibility of applying early fault-tolerant technologies to practical problems. |
| title | Time-Efficient Logical Operations on Quantum Low-Density Parity Check Codes |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2408.01339 |