Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.13017 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917329106894848 |
|---|---|
| author | Ng, Kwai-Kong Yang, Min-Fong |
| author_facet | Ng, Kwai-Kong Yang, Min-Fong |
| contents | The notorious sign problem severely limits the applicability of quantum Monte Carlo (QMC) simulations, as statistical errors grow exponentially with system size and inverse temperature. A recent proposal of a quantum-computing stochastic series expansion (qc-SSE) method suggested that the problem could be avoided by introducing constant energy shifts into the Hamiltonian. Here we critically examine this framework and show that it does not strictly resolve the sign problem for Hamiltonians with non-commuting terms. Instead, it provides a practical mitigation strategy that suppresses the occurrence of negative weights. Using the antiferromagnetic anisotropic XY chain as a test case, we analyze the dependence of the average sign on system size, temperature, anisotropy, and shift parameters. An operator contraction method is introduced to improve efficiency. Our results demonstrate that moderate shifts optimally balance sign mitigation and statistical accuracy, while large shifts amplify errors, leaving the sign problem unresolved but alleviated. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_13017 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Mitigating the sign problem by quantum computing Ng, Kwai-Kong Yang, Min-Fong Quantum Physics Other Condensed Matter Computational Physics The notorious sign problem severely limits the applicability of quantum Monte Carlo (QMC) simulations, as statistical errors grow exponentially with system size and inverse temperature. A recent proposal of a quantum-computing stochastic series expansion (qc-SSE) method suggested that the problem could be avoided by introducing constant energy shifts into the Hamiltonian. Here we critically examine this framework and show that it does not strictly resolve the sign problem for Hamiltonians with non-commuting terms. Instead, it provides a practical mitigation strategy that suppresses the occurrence of negative weights. Using the antiferromagnetic anisotropic XY chain as a test case, we analyze the dependence of the average sign on system size, temperature, anisotropy, and shift parameters. An operator contraction method is introduced to improve efficiency. Our results demonstrate that moderate shifts optimally balance sign mitigation and statistical accuracy, while large shifts amplify errors, leaving the sign problem unresolved but alleviated. |
| title | Mitigating the sign problem by quantum computing |
| topic | Quantum Physics Other Condensed Matter Computational Physics |
| url | https://arxiv.org/abs/2509.13017 |