Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.06959 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912671264145408 |
|---|---|
| author | Herzog, Laura S. Burgholzer, Lukas Ufrecht, Christian Scherer, Daniel D. Wille, Robert |
| author_facet | Herzog, Laura S. Burgholzer, Lukas Ufrecht, Christian Scherer, Daniel D. Wille, Robert |
| contents | Despite the continuous advancements in size and robustness of real quantum devices, reliable large-scale quantum computers are not yet available. Hence, classical simulation of quantum algorithms remains crucial for testing new methods and estimating quantum advantage. Pushing classical simulation methods to their limit is essential, particularly due to their inherent exponential complexity. Besides the established Schrödinger-style full statevector simulation, so-called Hybrid Schrödinger-Feynman (HSF) approaches have shown promise to make simulations more efficient. HSF simulation employs the idea of "cutting" the circuit into smaller parts, reducing their execution times. This, however, comes at the cost of an exponential overhead in the number of cuts. Inspired by the domain of Quantum Circuit Cutting, we propose an HSF simulation method based on the idea of "joint cutting" to significantly reduce the aforementioned overhead. This means that, prior to the cutting procedure, gates are collected into "blocks" and all gates in a block are jointly cut instead of individually. We investigate how the proposed refinement can help decrease simulation times and highlight the remaining challenges. Experimental evaluations show that "joint cutting" can outperform the standard HSF simulation by up to a factor $\approx 4000\times$ and the Schrödinger-style simulation by a factor $\approx 200\times$ for suitable instances. The implementation is available at https://github.com/cda-tum/mqt-qsim-joint-cutting. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_06959 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Joint Cutting for Hybrid Schrödinger-Feynman Simulation of Quantum Circuits Herzog, Laura S. Burgholzer, Lukas Ufrecht, Christian Scherer, Daniel D. Wille, Robert Quantum Physics Despite the continuous advancements in size and robustness of real quantum devices, reliable large-scale quantum computers are not yet available. Hence, classical simulation of quantum algorithms remains crucial for testing new methods and estimating quantum advantage. Pushing classical simulation methods to their limit is essential, particularly due to their inherent exponential complexity. Besides the established Schrödinger-style full statevector simulation, so-called Hybrid Schrödinger-Feynman (HSF) approaches have shown promise to make simulations more efficient. HSF simulation employs the idea of "cutting" the circuit into smaller parts, reducing their execution times. This, however, comes at the cost of an exponential overhead in the number of cuts. Inspired by the domain of Quantum Circuit Cutting, we propose an HSF simulation method based on the idea of "joint cutting" to significantly reduce the aforementioned overhead. This means that, prior to the cutting procedure, gates are collected into "blocks" and all gates in a block are jointly cut instead of individually. We investigate how the proposed refinement can help decrease simulation times and highlight the remaining challenges. Experimental evaluations show that "joint cutting" can outperform the standard HSF simulation by up to a factor $\approx 4000\times$ and the Schrödinger-style simulation by a factor $\approx 200\times$ for suitable instances. The implementation is available at https://github.com/cda-tum/mqt-qsim-joint-cutting. |
| title | Joint Cutting for Hybrid Schrödinger-Feynman Simulation of Quantum Circuits |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2502.06959 |