On universality of hardware-efficient ansatzes
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909900264701952 |
|---|---|
| author | Iwakiri, Hokuto Kanno, Keita |
| author_facet | Iwakiri, Hokuto Kanno, Keita |
| contents | The hardware-efficient ansatz (HEA) is one of the most important class of parametrized quantum circuits for near-term applications of quantum computing. We show that the problem of simulating some major classes of the HEA is BQP-complete by explicitly demonstrating that any relevant quantum circuit can be efficiently represented as an HEA circuit of those classes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_03870 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On universality of hardware-efficient ansatzes Iwakiri, Hokuto Kanno, Keita Quantum Physics The hardware-efficient ansatz (HEA) is one of the most important class of parametrized quantum circuits for near-term applications of quantum computing. We show that the problem of simulating some major classes of the HEA is BQP-complete by explicitly demonstrating that any relevant quantum circuit can be efficiently represented as an HEA circuit of those classes. |
| title | On universality of hardware-efficient ansatzes |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2511.03870 |