Bacon-Shor Board Games
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_ | 1866914309529927680 |
|---|---|
| author | Alam, M. Sohaib Zen, Jun Scruby, Thomas R. |
| author_facet | Alam, M. Sohaib Zen, Jun Scruby, Thomas R. |
| contents | We identify a period-4 measurement schedule for the checks of the Bacon-Shor code that fully covers spacetime with constant-weight detectors, and is numerically observed to provide the code with a threshold. Unlike previous approaches, our method does not rely on code concatenation and instead arises as the solution to a coloring game on a square grid. Under a uniform circuit-level noise model, we observe a threshold of approximately $0.3\%$ when decoding with minimum weight perfect matching, and we conjecture that this could be improved using a more tailored decoder. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_02749 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Bacon-Shor Board Games Alam, M. Sohaib Zen, Jun Scruby, Thomas R. Quantum Physics Information Theory We identify a period-4 measurement schedule for the checks of the Bacon-Shor code that fully covers spacetime with constant-weight detectors, and is numerically observed to provide the code with a threshold. Unlike previous approaches, our method does not rely on code concatenation and instead arises as the solution to a coloring game on a square grid. Under a uniform circuit-level noise model, we observe a threshold of approximately $0.3\%$ when decoding with minimum weight perfect matching, and we conjecture that this could be improved using a more tailored decoder. |
| title | Bacon-Shor Board Games |
| topic | Quantum Physics Information Theory |
| url | https://arxiv.org/abs/2504.02749 |