Smarter k-Partitioning of ZX-Diagrams for Improved Quantum Circuit Simulation
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912010714742784 |
|---|---|
| author | Sutcliffe, Matthew |
| author_facet | Sutcliffe, Matthew |
| contents | We introduce a novel method for strong classical simulation of quantum circuits based on optimally k-partitioning ZX-diagrams, reducing each part individually, and then efficiently cross-referencing their results to conclude the overall probability amplitude of the original circuit. We then analyse how this method fares against the alternatives for circuits of various size, shape, and interconnectedness and demonstrate how it is often liable to outperform those alternatives in speed by orders of magnitude. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_00828 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Smarter k-Partitioning of ZX-Diagrams for Improved Quantum Circuit Simulation Sutcliffe, Matthew Quantum Physics Data Structures and Algorithms We introduce a novel method for strong classical simulation of quantum circuits based on optimally k-partitioning ZX-diagrams, reducing each part individually, and then efficiently cross-referencing their results to conclude the overall probability amplitude of the original circuit. We then analyse how this method fares against the alternatives for circuits of various size, shape, and interconnectedness and demonstrate how it is often liable to outperform those alternatives in speed by orders of magnitude. |
| title | Smarter k-Partitioning of ZX-Diagrams for Improved Quantum Circuit Simulation |
| topic | Quantum Physics Data Structures and Algorithms |
| url | https://arxiv.org/abs/2409.00828 |