Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.01443 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915827341590528 |
|---|---|
| author | Matsumoto, Mitsuhiro Sanji, Shinichiro Satoh, Takahiko |
| author_facet | Matsumoto, Mitsuhiro Sanji, Shinichiro Satoh, Takahiko |
| contents | Circuit cutting partitions a large quantum circuit into smaller subcircuits that can be executed independently and recombined by classical post-processing. In classical state-vector simulation with full-state reconstruction, the runtime is governed by a trade-off between reduced subcircuit size and the overheads of exponentially many subcircuits and full-state reconstruction. For equal partitioning, we derive threshold conditions on the number of cuts below which cutting reduces the wall-clock time. State-vector experiments validate the predicted speedup boundary up to 24 qubits, and a runtime breakdown up to 30 qubits identifies crossovers at $q \approx 18$ and $q \approx 22$ where merging overtakes first preprocessing and then subcircuit simulation. As a practical guideline, we show that under a 10-minute wall-clock budget, two-way cutting extends the maximum feasible qubit count by 4 to 6 qubits relative to simulation without cutting. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_01443 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Applicability and Limitations of Quantum Circuit Cutting in Classical State-Vector Simulation Matsumoto, Mitsuhiro Sanji, Shinichiro Satoh, Takahiko Quantum Physics Circuit cutting partitions a large quantum circuit into smaller subcircuits that can be executed independently and recombined by classical post-processing. In classical state-vector simulation with full-state reconstruction, the runtime is governed by a trade-off between reduced subcircuit size and the overheads of exponentially many subcircuits and full-state reconstruction. For equal partitioning, we derive threshold conditions on the number of cuts below which cutting reduces the wall-clock time. State-vector experiments validate the predicted speedup boundary up to 24 qubits, and a runtime breakdown up to 30 qubits identifies crossovers at $q \approx 18$ and $q \approx 22$ where merging overtakes first preprocessing and then subcircuit simulation. As a practical guideline, we show that under a 10-minute wall-clock budget, two-way cutting extends the maximum feasible qubit count by 4 to 6 qubits relative to simulation without cutting. |
| title | Applicability and Limitations of Quantum Circuit Cutting in Classical State-Vector Simulation |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2603.01443 |