One qubit as a Universal Approximant
| Autor: | Pérez-Salinas, Adrián, López-Núñez, David, García-Sáez, Artur, Forn-Díaz, P., Latorre, José I. |
|---|---|
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | Phys. Rev. A 104, 012405 (2021) |
| Druh dokumentu: | Working Paper |
| DOI: | 10.1103/PhysRevA.104.012405 |
| Popis: | A single-qubit circuit can approximate any bounded complex function stored in the degrees of freedom defining its quantum gates. The single-qubit approximant presented in this work is operated through a series of gates that take as their parameterization the independent variable of the target function and an additional set of adjustable parameters. The independent variable is re-uploaded in every gate while the parameters are optimized for each target function. The output state of this quantum circuit becomes more accurate as the number of re-uploadings of the independent variable increases, i. e., as more layers of gates parameterized with the independent variable are applied. In this work, we provide two different proofs of this claim related to both the Fourier series and the Universal Approximation Theorem for Neural Networks, and we benchmark both methods against their classical counterparts. We further implement a single-qubit approximant in a real superconducting qubit device, demonstrating how the ability to describe a set of functions improves with the depth of the quantum circuit. This work shows the robustness of the re-uploading technique on Quantum Machine Learning. Comment: 10 pages + 6 (appendix); 7 figures + 4 (appendix) Changes made for publication. The text has been changed to improve clarity. A stronger relationship between the model in this paper and Machine Learning was stated. Some content has been moved to appendix. Acknowledgements added |
| Databáze: | arXiv |
| Externí odkaz: |
|