Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.01798 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912740932583424 |
|---|---|
| author | Boosari, Emad Rezaei Fard Afsary, Maryam |
| author_facet | Boosari, Emad Rezaei Fard Afsary, Maryam |
| contents | Quantum state preparation (QSP) for a general $n$-qubit state requires $O(2^n)$ CNOT gates and circuit depth, making exact amplitude encoding (EAE) impractical for near-term quantum hardware. We introduce an ancilla-free hybrid classical-quantum strategy that reduces this cost to $O(poly(n))$ for a broad class of compressible data. The method first applies a classical compression step to obtain a $d$-sparse representation of the input, loads this sparse vector using a sparse-state preparation routine, and then reconstructs the target state through a polynomial-depth quantum inverse transform. We evaluate the framework on synthetic benchmark signals and real biomedical time series using Fourier and Haar transforms, demonstrating substantial reductions in CNOT counts and circuit depth compared to EAE, together with competitive performance relative to the Fourier Series Loader (FSL). The quantum simulation results show that combining classical data compression with quantum decompression provides a scalable framework for efficient QSP, reducing quantum overhead without requiring variational training or ancillary registers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_01798 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Hybrid Quantum State Preparation via Data Compression Boosari, Emad Rezaei Fard Afsary, Maryam Quantum Physics Quantum state preparation (QSP) for a general $n$-qubit state requires $O(2^n)$ CNOT gates and circuit depth, making exact amplitude encoding (EAE) impractical for near-term quantum hardware. We introduce an ancilla-free hybrid classical-quantum strategy that reduces this cost to $O(poly(n))$ for a broad class of compressible data. The method first applies a classical compression step to obtain a $d$-sparse representation of the input, loads this sparse vector using a sparse-state preparation routine, and then reconstructs the target state through a polynomial-depth quantum inverse transform. We evaluate the framework on synthetic benchmark signals and real biomedical time series using Fourier and Haar transforms, demonstrating substantial reductions in CNOT counts and circuit depth compared to EAE, together with competitive performance relative to the Fourier Series Loader (FSL). The quantum simulation results show that combining classical data compression with quantum decompression provides a scalable framework for efficient QSP, reducing quantum overhead without requiring variational training or ancillary registers. |
| title | Hybrid Quantum State Preparation via Data Compression |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2512.01798 |