aiqbench analysis
This research presents a hybrid quantum state preparation technique leveraging the Walsh-Hadamard transform to efficiently encode structured classical data with minimal circuit overhead. By isolating sparse coefficients in the Walsh domain, the method eliminates additional CNOT gates and reduces circuit depth, offering a practical optimization for quantum algorithms requiring dense-to-sparse state initialization.
Walsh-Transform Realization of Dense-to-Sparse Quantum State Preparation
arXiv:2609.28760v1 Announce Type: new Abstract: We propose a hybrid quantum state preparation method based on the Walsh--Hadamard transform within the dense-to-sparse quantum state preparation framework. The method approximately prepares structured classical data in a quantum circuit through an indirect approach. Instead of directly preparing the dense amplitude-encoded state, the method first transforms the classical data into the Walsh domain and prepares only the largest-magnitude coefficients using a sparse state-preparation algorithm. The original state can then be approximately recovered through a parallel layer of Hadamard gates. Since this reconstruction requires no CNOT gates and has circuit depth 1, the proposed method introduces no additional CNOT or circuit-depth overhead, and its quantum preparation cost is determined by the underlying sparse state-preparation algorithm. Numerical results on representative benchmark signals demonstrate that the proposed method enables accurate state preparation for signals admitting sparse or approximately sparse representations in the Walsh domain.
Abstract:We propose a hybrid quantum state preparation method based on the Walsh--Hadamard transform within the dense-to-sparse quantum state preparation framework. The method approximately prepares structured classical data in a quantum circuit through an indirect approach. Instead of directly preparing the dense amplitude-encoded state, the method first transforms the classical data into the Walsh domain and prepares only the largest-magnitude coefficients using a sparse state-preparation algorithm. The original state can then be approximately recovered through a parallel layer of Hadamard gates. Since this reconstruction requires no CNOT gates and has circuit depth 1, the proposed method introduces no additional CNOT or circuit-depth overhead, and its quantum preparation cost is determined by the underlying sparse state-preparation algorithm. Numerical results on representative benchmark signals demonstrate that the proposed method enables accurate state preparation for signals admitting sparse or approximately sparse representations in the Walsh domain.
arXiv:2609.28760 [quant-ph]
(or arXiv:2609.28760v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.28760 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
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.
Full text under the publisher's open licence · 233 words
Related coverage
New Methods and Frameworks for Quantum State Preparation in Modern Quantum Systems
arXiv · Aug 19, 2026
Low-overhead tailoring and learning of noise in graph states
arXiv · Oct 16, 2026

German scientists cut Toffoli gate count for sparse quantum states
Quantum Zeitgeist · Sep 10, 2026

University of Wisconsin team releases open-source quantum encoding tool
Quantum Zeitgeist · Sep 1, 2026