Back to News
quantum-computing

Symmetry Dilemmas in Quantum Computing for Chemistry: A Comprehensive Analysis

arXiv Quantum Physics
Loading...
4 min read
1 views
0 likes
Symmetry Dilemmas in Quantum Computing for Chemistry: A Comprehensive Analysis

Summarize this article with:

Quantum Physics arXiv:2512.12097 (quant-ph) [Submitted on 13 Dec 2025] Title:Symmetry Dilemmas in Quantum Computing for Chemistry: A Comprehensive Analysis Authors:Ilias Magoulas, Muhan Zhang, Francesco A. Evangelista View a PDF of the paper titled Symmetry Dilemmas in Quantum Computing for Chemistry: A Comprehensive Analysis, by Ilias Magoulas and Muhan Zhang and Francesco A. Evangelista View PDF HTML (experimental) Abstract:Symmetry adaptation, universality, and gate efficiency are central but often competing requirements in quantum algorithms for electronic structure and many-body physics. For example, fully symmetry-adapted universal operator pools typically generate long and deep quantum circuits, gate-efficient universal operator pools generally break symmetries, and gate-efficient fully symmetry-adapted operator pools may not be universal. In this work, we analyze such symmetry dilemmas both theoretically and numerically. On the theory side, we prove that the popular, gate-efficient operator pool consisting of singlet spin-adapted singles and perfect-pairing doubles is not universal when spatial symmetry is enforced. To demonstrate the strengths and weaknesses of the three types of pools, we perform numerical simulations using an adaptive algorithm paired with operator pools that are (i) fully symmetry-adapted and universal, (ii) fully symmetry-adapted and non-universal, and (iii) breaking a single symmetry and are universal. Our numerical simulations encompass three physically relevant scenarios in which the target state is (i) the global ground state, (ii) the ground state crossed by a state differing in multiple symmetry properties, and (iii) the ground state crossed by a state differing in a single symmetry property. Our results show when symmetry-breaking but universal pools can be used safely, when enforcing at least one distinguishing symmetry suffices, and when a particular symmetry must be rigorously preserved to avoid variational collapse. Together, the formal and numerical analysis provides a practical guide for designing and benchmarking symmetry-adapted operator pools that balance universality, resource requirements, and robust state targeting in quantum simulations for chemistry. Subjects: Quantum Physics (quant-ph); Chemical Physics (physics.chem-ph) Cite as: arXiv:2512.12097 [quant-ph] (or arXiv:2512.12097v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2512.12097 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Ilias Magoulas [view email] [v1] Sat, 13 Dec 2025 00:08:55 UTC (2,021 KB) Full-text links: Access Paper: View a PDF of the paper titled Symmetry Dilemmas in Quantum Computing for Chemistry: A Comprehensive Analysis, by Ilias Magoulas and Muhan Zhang and Francesco A. EvangelistaView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2025-12 Change to browse by: physics physics.chem-ph 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?)

Read Original

Tags

quantum-computing
quantum-algorithms

Source Information

Source: arXiv Quantum Physics