Back to News
quantum-computing

Low $T$-count preparation of nuclear eigenstates with tensor networks

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers developed a hybrid quantum-classical protocol to efficiently prepare nuclear eigenstates, addressing a key bottleneck in fault-tolerant quantum simulations of strongly correlated fermionic systems. The team used Density Matrix Renormalization Group algorithms to approximate target states as Matrix Product States, exploiting favorable entanglement structures in fermionic systems for high-fidelity classical pre-processing. These classical approximations were then optimized via variational circuit compilation, producing shallow quantum circuits with minimal resource demands when decomposed into Clifford+T gates. Testing on nuclear systems up to 76 qubits revealed consistently low T-counts (~20,000 T-gates total), suggesting feasibility on early fault-tolerant quantum computers. The work establishes a practical pathway for ground state preparation in nuclear physics and broader fermionic applications, advancing near-term quantum simulation capabilities.
Low $T$-count preparation of nuclear eigenstates with tensor networks

Summarize this article with:

Quantum Physics arXiv:2603.11156 (quant-ph) [Submitted on 11 Mar 2026] Title:Low $T$-count preparation of nuclear eigenstates with tensor networks Authors:Joe Gibbs, Lukasz Cincio, Chandan Sarma, Zoë Holmes, Paul Stevenson View a PDF of the paper titled Low $T$-count preparation of nuclear eigenstates with tensor networks, by Joe Gibbs and 4 other authors View PDF HTML (experimental) Abstract:We present an efficient protocol leveraging classical computation to support Initial State Preparation for strongly correlated fermionic systems, a critical bottleneck for fault-tolerant quantum simulation. Focusing on nuclear shell model eigenstates, we first demonstrate that the Density Matrix Renormalization Group algorithm can efficiently approximate target states as Matrix Product States, capitalizing on the favourable entanglement structure of these fermionic systems. These high-fidelity approximations are then leveraged as a classical resource in a variational circuit optimization scheme to compile shallow quantum circuits. We establish concrete resource estimates by decomposing the resulting circuits into the industry-standard Clifford$+T$ gateset, exploring the benefits of specialized $U3$ synthesis techniques. For all nuclear systems tested, on up to 76 qubit Hamiltonians, we consistently find low $T$-count circuits preparing the nuclear eigenstates to high fidelity with $\sim 2\times 10^4$ total $T$ gates. This low number gives confidence these eigenstates can be prepared on early fault-tolerant quantum computers. Our work establishes a viable path toward practical ground state preparation for nuclear structure and other fermionic applications. Comments: Subjects: Quantum Physics (quant-ph) Report number: LA-UR-26-21805 Cite as: arXiv:2603.11156 [quant-ph] (or arXiv:2603.11156v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2603.11156 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Joe Gibbs [view email] [v1] Wed, 11 Mar 2026 18:00:00 UTC (2,102 KB) Full-text links: Access Paper: View a PDF of the paper titled Low $T$-count preparation of nuclear eigenstates with tensor networks, by Joe Gibbs and 4 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-03 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-hardware
quantum-simulation

Source Information

Source: arXiv Quantum Physics