Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.06649 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909681351393280 |
|---|---|
| author | Wagner, Friedrich Ufrecht, Christian Braun, Martin Scherer, Daniel D. |
| author_facet | Wagner, Friedrich Ufrecht, Christian Braun, Martin Scherer, Daniel D. |
| contents | Circuit cutting was originally designed to retrieve the expectation value of an observable with respect to a large quantum circuit by executing smaller circuit fragments. In this work, however, we demonstrate the application of circuit cutting to a pure sampling task. In particular, we sample solutions to an optimization problem from a trained QAOA circuit. Here, circuit cutting leads to a broadening and shift of the bitstring distribution towards suboptimal values compared to the uncut case. To reduce this effect, we minimize the number of required cuts via integer programming methods. On the other hand, cutting reduces the circuit size and thus the impact of noise. Our experiments on quantum hardware reveal that, for large circuits, the effect of noise reduction outweighs the derogative effects on the bitstring distribution. The study therefore provides evidence that circuit cutting combined with optimized cutting schemes can both scale problem size and mitigate noise for near-term quantum optimization. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_06649 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Optimized Circuit Cutting for QAOA Sampling Tasks Wagner, Friedrich Ufrecht, Christian Braun, Martin Scherer, Daniel D. Quantum Physics Circuit cutting was originally designed to retrieve the expectation value of an observable with respect to a large quantum circuit by executing smaller circuit fragments. In this work, however, we demonstrate the application of circuit cutting to a pure sampling task. In particular, we sample solutions to an optimization problem from a trained QAOA circuit. Here, circuit cutting leads to a broadening and shift of the bitstring distribution towards suboptimal values compared to the uncut case. To reduce this effect, we minimize the number of required cuts via integer programming methods. On the other hand, cutting reduces the circuit size and thus the impact of noise. Our experiments on quantum hardware reveal that, for large circuits, the effect of noise reduction outweighs the derogative effects on the bitstring distribution. The study therefore provides evidence that circuit cutting combined with optimized cutting schemes can both scale problem size and mitigate noise for near-term quantum optimization. |
| title | Optimized Circuit Cutting for QAOA Sampling Tasks |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2507.06649 |