Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.20886 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917277390077952 |
|---|---|
| author | Ziiatdinov, Mansur Novikov, Igor Ablayev, Farid Barsegov, Valeri |
| author_facet | Ziiatdinov, Mansur Novikov, Igor Ablayev, Farid Barsegov, Valeri |
| contents | In computational molecular science, calculation of electrostatic interactions involving charged atoms - the strongest interactions in condensed phases, is a major bottleneck. We propose a quantum-classical algorithm for fast, yet, accurate computation of the Coulomb electrostatic energy for a system of point charges. The algorithm employs the Ewald method based decomposition of electrostatic energy into several energy terms, of which the "Fourier component" (long-range electrostatics) computed on a quantum device, utilizing the power of Quantum Fourier Transform (QFT). We demonstrate that the algorithm complexity is $N \log M$ and that the quantum advantage for a system of point charges in the three-dimensional space is achieved when the number of grid points $M^3$ exceeds the number of charges $N$. The numerical error is small $<10^{-3}$. The algorithm can be implemented to run the all-atom Molecular Dynamics simulations on a quantum device requiring 15 qubits, thereby expanding the scope of applications of QFT-based methods to computational chemistry and biophysics. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_20886 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum algorithm for Ewald summation based computation of long-range electrostatics Ziiatdinov, Mansur Novikov, Igor Ablayev, Farid Barsegov, Valeri Quantum Physics In computational molecular science, calculation of electrostatic interactions involving charged atoms - the strongest interactions in condensed phases, is a major bottleneck. We propose a quantum-classical algorithm for fast, yet, accurate computation of the Coulomb electrostatic energy for a system of point charges. The algorithm employs the Ewald method based decomposition of electrostatic energy into several energy terms, of which the "Fourier component" (long-range electrostatics) computed on a quantum device, utilizing the power of Quantum Fourier Transform (QFT). We demonstrate that the algorithm complexity is $N \log M$ and that the quantum advantage for a system of point charges in the three-dimensional space is achieved when the number of grid points $M^3$ exceeds the number of charges $N$. The numerical error is small $<10^{-3}$. The algorithm can be implemented to run the all-atom Molecular Dynamics simulations on a quantum device requiring 15 qubits, thereby expanding the scope of applications of QFT-based methods to computational chemistry and biophysics. |
| title | Quantum algorithm for Ewald summation based computation of long-range electrostatics |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2512.20886 |