A generic multi-Pauli compilation framework for limited connectivity
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_ | 1866929621171175424 |
|---|---|
| author | Glos, Adam Salehi, Özlem |
| author_facet | Glos, Adam Salehi, Özlem |
| contents | Efficient and effective compilation of quantum circuits remains an important aspect of executing quantum programs. In this paper, we propose a generic compilation framework particularly suitable for limited connectivity, that extends many of the known techniques for Pauli network synthesis. Our compilation method, built on the introduced Clifford Executive Representation, stands out by considering the implementation of multiple Pauli operators at once, which are not necessarily commuting. The proposed technique also allows for effective Clifford circuit synthesis. We benchmark our methods against circuits resulting from the Variational Quantum Eigensolver algorithm and the results show that the proposed methods outperform the state-of-the-art. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_06909 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A generic multi-Pauli compilation framework for limited connectivity Glos, Adam Salehi, Özlem Quantum Physics Efficient and effective compilation of quantum circuits remains an important aspect of executing quantum programs. In this paper, we propose a generic compilation framework particularly suitable for limited connectivity, that extends many of the known techniques for Pauli network synthesis. Our compilation method, built on the introduced Clifford Executive Representation, stands out by considering the implementation of multiple Pauli operators at once, which are not necessarily commuting. The proposed technique also allows for effective Clifford circuit synthesis. We benchmark our methods against circuits resulting from the Variational Quantum Eigensolver algorithm and the results show that the proposed methods outperform the state-of-the-art. |
| title | A generic multi-Pauli compilation framework for limited connectivity |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2412.06909 |