Quantum-classical algorithm for Ewald summation based computation of long-range electrostatics

Quantum Physics arXiv:2512.20886 (quant-ph) [Submitted on 24 Dec 2025] Title:Quantum-classical algorithm for Ewald summation based computation of long-range electrostatics Authors:Mansur Ziiatdinov, Igor Novikov, Farid Ablayev, Valeri Barsegov View a PDF of the paper titled Quantum-classical algorithm for Ewald summation based computation of long-range electrostatics, by Mansur Ziiatdinov and 3 other authors View PDF Abstract:Numerical exploration of large-size real biological systems requires computational power far exceeding that of modern classical computers. In computational molecular science, calculation of long-range electrostatic interactions between charged atoms - the strongest interactions in condensed phases, is a major bottleneck. Here, we propose a quantum algorithm for fast yet accurate computation of Coulomb electrostatic energy for a system of point charges. The algorithm employs the Ewald method based decomposition of electrostatic energy E into several energy terms, of which "the Fourier component" of E is computed in the algorithm proposed on a quantum device, utilizing the power of Quantum Fourier Transform. We demonstrate the algorithm's quantum advantage for a range of systems of point charges in the three-dimensional space when the number of charges (system size) N exceeds the number of grid points M, and show that the numerical error is rather small new | recent | 2025-12 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)