A graph-state based synthesis framework for Clifford isometries
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915102488264704 |
|---|---|
| author | de Brugière, Timothée Goubault Martiel, Simon Vuillot, Christophe |
| author_facet | de Brugière, Timothée Goubault Martiel, Simon Vuillot, Christophe |
| contents | We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis that only exploits the elementary properties of the Clifford group and one equation of the symplectic group. We highlight the versatility of our framework by showing that several normal forms of the literature are natural corollaries. We recover the state of the art two-qubit gate depth necessary for the execution of a Clifford circuit on an LNN architecture, concomitantly with another work. We also propose practical synthesis algorithms for Clifford isometries with a focus on Clifford operators, graph states and codiagonalization of Pauli rotations. Benchmarks show that in all three cases we improve the 2-qubit gate count and depth of random instances compared to the state-of-the-art methods. We also improve the execution of practical quantum chemistry experiments. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2212_06928 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | A graph-state based synthesis framework for Clifford isometries de Brugière, Timothée Goubault Martiel, Simon Vuillot, Christophe Quantum Physics We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis that only exploits the elementary properties of the Clifford group and one equation of the symplectic group. We highlight the versatility of our framework by showing that several normal forms of the literature are natural corollaries. We recover the state of the art two-qubit gate depth necessary for the execution of a Clifford circuit on an LNN architecture, concomitantly with another work. We also propose practical synthesis algorithms for Clifford isometries with a focus on Clifford operators, graph states and codiagonalization of Pauli rotations. Benchmarks show that in all three cases we improve the 2-qubit gate count and depth of random instances compared to the state-of-the-art methods. We also improve the execution of practical quantum chemistry experiments. |
| title | A graph-state based synthesis framework for Clifford isometries |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2212.06928 |