Simplification of tensor updates toward performance-complexity balanced quantum computer simulation
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_ | 1866911479939203072 |
|---|---|
| author | Yanagisawa, Koichi Okubo, Tsuyoshi Koshikawa, Shota Yoshida, Tsuyoshi Hosaka, Aruto Todo, Synge |
| author_facet | Yanagisawa, Koichi Okubo, Tsuyoshi Koshikawa, Shota Yoshida, Tsuyoshi Hosaka, Aruto Todo, Synge |
| contents | Matrix Product States (MPS) provide a powerful framework for simulating quantum circuits. In practical simulations, tensor updates are typically performed in the canonical form (CF), which corresponds to the Schmidt decomposition and improves approximation accuracy. However, maintaining the canonical form introduces significant computational overhead. An alternative approach, known as the Simple Update (SU), does not enforce the Schmidt decomposition and is expected to reduce computational complexity. In this work, we systematically compare the performance and computational cost of SU and CF in quantum circuit simulations. We benchmark both methods on highly entangled circuits and on a QASM benchmark suite covering a wide range of circuit types. Our results show that SU achieves accuracy comparable to CF while reducing computational complexity, indicating that SU provides an efficient alternative for practical quantum circuit simulations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_03010 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Simplification of tensor updates toward performance-complexity balanced quantum computer simulation Yanagisawa, Koichi Okubo, Tsuyoshi Koshikawa, Shota Yoshida, Tsuyoshi Hosaka, Aruto Todo, Synge Quantum Physics Matrix Product States (MPS) provide a powerful framework for simulating quantum circuits. In practical simulations, tensor updates are typically performed in the canonical form (CF), which corresponds to the Schmidt decomposition and improves approximation accuracy. However, maintaining the canonical form introduces significant computational overhead. An alternative approach, known as the Simple Update (SU), does not enforce the Schmidt decomposition and is expected to reduce computational complexity. In this work, we systematically compare the performance and computational cost of SU and CF in quantum circuit simulations. We benchmark both methods on highly entangled circuits and on a QASM benchmark suite covering a wide range of circuit types. Our results show that SU achieves accuracy comparable to CF while reducing computational complexity, indicating that SU provides an efficient alternative for practical quantum circuit simulations. |
| title | Simplification of tensor updates toward performance-complexity balanced quantum computer simulation |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2406.03010 |