Conceptio › Archive › arXiv (OAI)
arXiv (OAI) open access

Efficient Gaussian State Preparation in Quantum Circuits

Xie, Yichen et al. · 2025 · arxiv_oai
arXiv (OAI) · Papers · 2025
Open Source ↗Direct PDF ↓
81p68quantum-physics
Conceptio Open Archive

Analyze & explore related research in Conceptio

Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.

[2507.20317] Efficient Gaussian State Preparation in Quantum Circuits Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Quantum Physics arXiv:2507.20317 (quant-ph) [Submitted on 27 Jul 2025] Title: Efficient Gaussian State Preparation in Quantum Circuits Authors: Yichen Xie , Nadav Ben-Ami View a PDF of the paper titled Efficient Gaussian State Preparation in Quantum Circuits, by Yichen Xie and Nadav Ben-Ami View PDF HTML (experimental) Abstract: Gaussian states hold a fundamental place in quantum mechanics, quantum information, and quantum computing. Many subfields, including quantum simulation of continuous-variable systems, quantum chemistry, and quantum machine learning, rely on the ability to accurately and efficiently prepare states that reflect a Gaussian profile in their probability amplitudes. Although Gaussian states are natural in continuous-variable systems, the practical interest in digital, gate-based quantum computers demands discrete approximations of Gaussian distributions over a computational basis of size \(2^n\). Because of the exponential scaling of naive amplitude-encoding approaches and the cost of certain block-encoding or Hamiltonian simulation techniques, a resource-efficient preparation of approximate Gaussian states is required. In this work, we propose and analyze a circuit-based approach that starts with single-qubit rotations to form an exponential amplitude profile and then applies the quantum Fourier transform to map those amplitudes into an approximate Gaussian distribution. We demonstrate that this procedure achieves high fidelity with the target Gaussian state while allowing optional pruning of small controlled-phase angles in the quantum Fourier transform, thus reducing gate complexity to near-linear in \(\mathcal{O}(n)\). We conclude that the proposed technique is a promising route to make Gaussian states accessible on noisy quantum hardware and to pave the way for scalable implementations on future devices. The implementation of this algorithm is available at the Classiq library: this https URL . Comments: 7 pages, 7 figures. To appear in Proceedings of the IEEE International Conference on Quantum Computing and Engineering (QCE25) Subjects: Quantum Physics (quant-ph) MSC classes: 81P68, 81P40, 65Y20 Cite as: arXiv:2507.20317 [quant-ph] (or arXiv:2507.20317v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2507.20317 Focus to learn more arXiv-issued DOI via DataCite Journal reference: 2025 IEEE International Conference on Quantum Computing and Engineering (QCE), Albuquerque, NM, USA, 2025, pp. 242-248 Related DOI : https://doi.org/10.1109/QCE65121.2025.00035 Focus to learn more DOI(s) linking to related resources Submission history From: Eason Xie [ view email ] [v1] Sun, 27 Jul 2025 15:15:20 UTC (768 KB) Full-text links: Access Paper: View a PDF of the paper titled Efficient Gaussian State Preparation in Quantum Circuits, by Yichen Xie and Nadav Ben-Ami View PDF HTML (experimental) TeX Source view license Current browse context: quant-ph < prev | next > new | recent | 2025-07 References & Citations INSPIRE HEP NASA ADS Google 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? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

Record · ID 139218 · SHA-256 0180f4e68c283ce4
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive