Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2411.01131 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915708203433984 |
|---|---|
| author | Guseynov, Nikita Liu, Nana |
| author_facet | Guseynov, Nikita Liu, Nana |
| contents | Efficiently uploading data into quantum states is essential for many quantum algorithms to achieve advantage across various applications. In this paper, we address this challenge by developing a method to upload a polynomial function $f(x)$ on the interval $x \in [-1,1]$ into a pure quantum state consisting of qubits, where a discretized $f(x)$ is the amplitude of this state. The preparation cost has $\mathcal{O}(n\log n)$ scaling in the number of qubits $n$ and linear scaling with the degree of the polynomial $Q$. This efficiency allows the preparation of states whose amplitudes correspond to high-degree polynomials (up to $10^4$), enabling accurate approximation of functions that admit efficient polynomial series representations and whose amplitude profiles are not extremely localized. We provide a fully explicit circuit realization, based on four real polynomials that meet specific parity and boundedness conditions. We extend this construction to cover piece-wise polynomial functions, a case not previously addressed explicitly in the literature, the algorithm scaling linearly with the number of piecewise parts. Our method achieves efficient quantum circuit implementation and we present detailed gate counting and resource analysis. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_01131 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Efficient explicit circuit for quantum state preparation of piecewise continuous functions Guseynov, Nikita Liu, Nana Quantum Physics 68Q12 F.2.1 Efficiently uploading data into quantum states is essential for many quantum algorithms to achieve advantage across various applications. In this paper, we address this challenge by developing a method to upload a polynomial function $f(x)$ on the interval $x \in [-1,1]$ into a pure quantum state consisting of qubits, where a discretized $f(x)$ is the amplitude of this state. The preparation cost has $\mathcal{O}(n\log n)$ scaling in the number of qubits $n$ and linear scaling with the degree of the polynomial $Q$. This efficiency allows the preparation of states whose amplitudes correspond to high-degree polynomials (up to $10^4$), enabling accurate approximation of functions that admit efficient polynomial series representations and whose amplitude profiles are not extremely localized. We provide a fully explicit circuit realization, based on four real polynomials that meet specific parity and boundedness conditions. We extend this construction to cover piece-wise polynomial functions, a case not previously addressed explicitly in the literature, the algorithm scaling linearly with the number of piecewise parts. Our method achieves efficient quantum circuit implementation and we present detailed gate counting and resource analysis. |
| title | Efficient explicit circuit for quantum state preparation of piecewise continuous functions |
| topic | Quantum Physics 68Q12 F.2.1 |
| url | https://arxiv.org/abs/2411.01131 |