Branch Sequentialization in Quantum Polytime
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914079293046784 |
|---|---|
| author | Hainry, Emmanuel Péchoux, Romain da Silva, Mário Alberto Machado |
| author_facet | Hainry, Emmanuel Péchoux, Romain da Silva, Mário Alberto Machado |
| contents | Quantum algorithms leverage the use of quantumly-controlled data in order to achieve computational advantage. This implies that the programs use constructs depending on quantum data and not just classical data such as measurement outcomes. Current compilation strategies for quantum control flow involve compiling the branches of a quantum conditional, either in-depth or in-width, which in general leads to circuits of exponential size. This problem is coined as the branch sequentialization problem. We introduce and study a compilation technique for avoiding branch sequentialization on a language that is sound and complete for quantum polynomial time, thus, improving on existing polynomial-size-preserving compilation techniques. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_09153 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Branch Sequentialization in Quantum Polytime Hainry, Emmanuel Péchoux, Romain da Silva, Mário Alberto Machado Logic in Computer Science Quantum algorithms leverage the use of quantumly-controlled data in order to achieve computational advantage. This implies that the programs use constructs depending on quantum data and not just classical data such as measurement outcomes. Current compilation strategies for quantum control flow involve compiling the branches of a quantum conditional, either in-depth or in-width, which in general leads to circuits of exponential size. This problem is coined as the branch sequentialization problem. We introduce and study a compilation technique for avoiding branch sequentialization on a language that is sound and complete for quantum polynomial time, thus, improving on existing polynomial-size-preserving compilation techniques. |
| title | Branch Sequentialization in Quantum Polytime |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2412.09153 |