The Harrow-Hassidim-Lloyd algorithm with qutrits

Quantum Physics arXiv:2511.17960 (quant-ph) [Submitted on 22 Nov 2025] Title:The Harrow-Hassidim-Lloyd algorithm with qutrits Authors:Tushti Patel, V. S. Prasannaa View a PDF of the paper titled The Harrow-Hassidim-Lloyd algorithm with qutrits, by Tushti Patel and V. S. Prasannaa View PDF HTML (experimental) Abstract:We extend the Harrow-Hassidim-Lloyd (HHL) algorithm, which is well-studied in the qubit framework, to its qutrit counterpart (which we call qutrit HHL, as opposed to qubit HHL, which is HHL using qubits). We design the circuit for the algorithm and develop a program for its implementation. We test HHL with qutrits for simple matrices and verify the results against the expected outcomes. We apply the algorithm to quantum chemistry, and in particular, to the potential energy curve calculations of the model problem of the hydrogen molecule in the split valence basis. We compare the number of qudits and the number of gates required between qubit and qutrit HHL implementations. In general, we find that for a fixed precision, the qutrit HHL circuit requires fewer number of qudits and comparable number of two-qudit gates than its qubit counterpart. Subjects: Quantum Physics (quant-ph); Atomic Physics (physics.atom-ph); Chemical Physics (physics.chem-ph) Cite as: arXiv:2511.17960 [quant-ph] (or arXiv:2511.17960v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2511.17960 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Srinivasa Prasannaa V [view email] [v1] Sat, 22 Nov 2025 07:50:44 UTC (1,507 KB) Full-text links: Access Paper: View a PDF of the paper titled The Harrow-Hassidim-Lloyd algorithm with qutrits, by Tushti Patel and V. S. PrasannaaView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2025-11 Change to browse by: physics physics.atom-ph 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?)