A simpler Gaussian state-preparation
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908479809126400 |
|---|---|
| author | Kuklinski, Parker Rempfer, Benjamin Obenland, Kevin Elenewski, Justin |
| author_facet | Kuklinski, Parker Rempfer, Benjamin Obenland, Kevin Elenewski, Justin |
| contents | The ability to efficiently state-prepare Gaussian distributions is critical to the success of numerous quantum algorithms. The most popular algorithm for this subroutine (Kitaev-Webb) has favorable polynomial resource scaling, however it faces enormous resource overheads making it functionally impractical. In this paper, we present a new, more intuitive method which uses exactly $n-1$ rotations, $(n-1)(n-2)/2$ two-qubit controlled rotations, and $\lfloor(n-1)/2\rfloor$ ancilla to state-prepare an $n$-qubit Gaussian state. We then apply optimizations to the circuit to render it linear in T-depth. This method can be extended to state-preparations of complex functions with polynomial phase. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_03987 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A simpler Gaussian state-preparation Kuklinski, Parker Rempfer, Benjamin Obenland, Kevin Elenewski, Justin Quantum Physics The ability to efficiently state-prepare Gaussian distributions is critical to the success of numerous quantum algorithms. The most popular algorithm for this subroutine (Kitaev-Webb) has favorable polynomial resource scaling, however it faces enormous resource overheads making it functionally impractical. In this paper, we present a new, more intuitive method which uses exactly $n-1$ rotations, $(n-1)(n-2)/2$ two-qubit controlled rotations, and $\lfloor(n-1)/2\rfloor$ ancilla to state-prepare an $n$-qubit Gaussian state. We then apply optimizations to the circuit to render it linear in T-depth. This method can be extended to state-preparations of complex functions with polynomial phase. |
| title | A simpler Gaussian state-preparation |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2508.03987 |