Hamiltonian Quantum Generative Adversarial Networks
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2022
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916314279313408 |
|---|---|
| author | Kim, Leeseok Lloyd, Seth Marvian, Milad |
| author_facet | Kim, Leeseok Lloyd, Seth Marvian, Milad |
| contents | We propose Hamiltonian Quantum Generative Adversarial Networks (HQuGANs), to learn to generate unknown input quantum states using two competing quantum optimal controls. The game-theoretic framework of the algorithm is inspired by the success of classical generative adversarial networks in learning high-dimensional distributions. The quantum optimal control approach not only makes the algorithm naturally adaptable to the experimental constraints of near-term hardware, but also offers a more natural characterization of overparameterization compared to the circuit model. We numerically demonstrate the capabilities of the proposed framework to learn various highly entangled many-body quantum states, using simple two-body Hamiltonians and under experimentally relevant constraints such as low-bandwidth controls. We analyze the computational cost of implementing HQuGANs on quantum computers and show how the framework can be extended to learn quantum dynamics. Furthermore, we introduce a new cost function that circumvents the problem of mode collapse that prevents convergence of HQuGANs and demonstrate how to accelerate the convergence of them when generating a pure state. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_02584 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Hamiltonian Quantum Generative Adversarial Networks Kim, Leeseok Lloyd, Seth Marvian, Milad Quantum Physics We propose Hamiltonian Quantum Generative Adversarial Networks (HQuGANs), to learn to generate unknown input quantum states using two competing quantum optimal controls. The game-theoretic framework of the algorithm is inspired by the success of classical generative adversarial networks in learning high-dimensional distributions. The quantum optimal control approach not only makes the algorithm naturally adaptable to the experimental constraints of near-term hardware, but also offers a more natural characterization of overparameterization compared to the circuit model. We numerically demonstrate the capabilities of the proposed framework to learn various highly entangled many-body quantum states, using simple two-body Hamiltonians and under experimentally relevant constraints such as low-bandwidth controls. We analyze the computational cost of implementing HQuGANs on quantum computers and show how the framework can be extended to learn quantum dynamics. Furthermore, we introduce a new cost function that circumvents the problem of mode collapse that prevents convergence of HQuGANs and demonstrate how to accelerate the convergence of them when generating a pure state. |
| title | Hamiltonian Quantum Generative Adversarial Networks |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2211.02584 |