Back to News
quantum-computing

Logical Resource Estimation for Quantum State Preparation with Compilation

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
A team of nine researchers compared rotation-based and sampling-based methods for preparing n-qubit quantum states, finding sampling-based approaches achieve asymptotically lower T-counts and maintain advantages even after accounting for compilation overhead. The study introduces a new software package for compiling state preparation circuits, designed as a practical subroutine for broader quantum computations, addressing gaps in real-world implementation costs beyond theoretical metrics. Numerical experiments across quantum chemistry, condensed matter physics, and Magnus expansion simulations demonstrate sampling-based methods outperform rotation-based ones in total gate count at varying accuracy levels (ε). Unlike prior work focusing solely on CNOT and T-counts, this analysis evaluates total gate count and compilation overhead, providing a more practical benchmark for quantum state preparation efficiency. Results suggest sampling-based methods are more scalable for fault-tolerant quantum computing, particularly in applications requiring high-precision state encoding like material science and chemical simulations.
Logical Resource Estimation for Quantum State Preparation with Compilation

Summarize this article with:

Quantum Physics arXiv:2605.18877 (quant-ph) [Submitted on 15 May 2026] Title:Logical Resource Estimation for Quantum State Preparation with Compilation Authors:Diyi Liu, Hanyu Wang, Shuchen Zhu, Jason Cong, Wibe A. de Jong, Di Fang, Zhen Huang, Costin Iancu, Chao Yang View a PDF of the paper titled Logical Resource Estimation for Quantum State Preparation with Compilation, by Diyi Liu and 8 other authors View PDF HTML (experimental) Abstract:Quantum state preparation is a fundamental primitive in quantum algorithms for encoding classical data into quantum amplitudes. We compare the cost of preparing general $n$-qubit states with real amplitudes using two common paradigms: rotation-based methods, based on controlled rotations, and sampling-based methods, based on a structured representation of the target state. Although these approaches are often theoretically compared using CNOT count and $T$-count, their relative performance in total gate count remains less well understood practically. We compare representative rotation-based and sampling-based methods using $T$-count and total gate count, and analyze how compilation overhead affects their relative performance. We also develop a software package for compiling state preparation circuits, designed as a practical subroutine for more general quantum computations. Numerical experiments on resource states and quantum states related to quantum chemistry, condensed matter physics, and simulation via Magnus expansion over a range of target accuracies $\epsilon$ support the analysis. Our results show that sampling-based methods achieve asymptotically lower $T$-count and retain an overall advantage after accounting for total gate count and compilation overhead. Subjects: Quantum Physics (quant-ph) MSC classes: 81P68, 68Q12 Cite as: arXiv:2605.18877 [quant-ph] (or arXiv:2605.18877v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2605.18877 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Diyi Liu [view email] [v1] Fri, 15 May 2026 23:24:46 UTC (2,167 KB) Full-text links: Access Paper: View a PDF of the paper titled Logical Resource Estimation for Quantum State Preparation with Compilation, by Diyi Liu and 8 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-05 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?) 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-chemistry
quantum-algorithms
quantum-hardware

Source Information

Source: arXiv Quantum Physics