Quantum Circuit Tensors and Enumerators with Applications to Quantum Fault Tolerance
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909213247143936 |
|---|---|
| author | Kukliansky, Alon Lackey, Brad |
| author_facet | Kukliansky, Alon Lackey, Brad |
| contents | We extend the recently introduced notion of tensor enumerator to the circuit enumerator. We provide a mathematical framework that offers a novel method for analyzing circuits and error models without resorting to Monte Carlo techniques. We introduce an analogue of the Poisson summation formula for stabilizer codes, facilitating a method for the exact computation of the number of error paths within the syndrome extraction circuit of the code that does not require direct enumeration. We demonstrate the efficacy of our approach by explicitly providing the number of error paths in a distance five surface code under various error models, a task previously deemed infeasible via simulation. We also show our circuit enumerator is related to the process matrix of a channel through a type of MacWilliams identity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_19643 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Quantum Circuit Tensors and Enumerators with Applications to Quantum Fault Tolerance Kukliansky, Alon Lackey, Brad Quantum Physics We extend the recently introduced notion of tensor enumerator to the circuit enumerator. We provide a mathematical framework that offers a novel method for analyzing circuits and error models without resorting to Monte Carlo techniques. We introduce an analogue of the Poisson summation formula for stabilizer codes, facilitating a method for the exact computation of the number of error paths within the syndrome extraction circuit of the code that does not require direct enumeration. We demonstrate the efficacy of our approach by explicitly providing the number of error paths in a distance five surface code under various error models, a task previously deemed infeasible via simulation. We also show our circuit enumerator is related to the process matrix of a channel through a type of MacWilliams identity. |
| title | Quantum Circuit Tensors and Enumerators with Applications to Quantum Fault Tolerance |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2405.19643 |