Optimizing VQE Ansatz Studies Tight-Binding Models with sd-Interaction and On-Site Coulomb Repulsion

Quantum Physics arXiv:2510.08864 (quant-ph) [Submitted on 9 Oct 2025] Title:Optimizing VQE Ansatz for Studying Tight-Binding Models with \textit{sd}-Interaction and On-Site Coulomb Repulsion Authors:Oleg Udalov View a PDF of the paper titled Optimizing VQE Ansatz for Studying Tight-Binding Models with \textit{sd}-Interaction and On-Site Coulomb Repulsion, by Oleg Udalov View PDF HTML (experimental) Abstract:The VQE algorithm is applied to the problem of finding the ground state of a lattice model with on-site Coulomb repulsion, nearest-neighbor hopping, and on-site sd-interaction. We compare the performance of several ansatze, including cluster and generic forms. Several modifications of the standard cluster ansatz implementation are proposed, which significantly reduce the number of two-qubit gates. Different classical optimizers are employed within the VQE algorithm. The performance of the algorithms is evaluated using both noiseless and noisy simulations. Comments: Subjects: Quantum Physics (quant-ph); Strongly Correlated Electrons (cond-mat.str-el) Cite as: arXiv:2510.08864 [quant-ph] (or arXiv:2510.08864v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2510.08864 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Oleg Udalov [view email] [v1] Thu, 9 Oct 2025 23:42:05 UTC (64 KB) Full-text links: Access Paper: View a PDF of the paper titled Optimizing VQE Ansatz for Studying Tight-Binding Models with \textit{sd}-Interaction and On-Site Coulomb Repulsion, by Oleg UdalovView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2025-10 Change to browse by: cond-mat cond-mat.str-el 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?)