Optimal constant-cost implementations of Clifford operations using global interactions
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918167999152128 |
|---|---|
| author | Nemirovsky, Jonathan Peleg, Lee Kish, Amit Ben Shapira, Yotam |
| author_facet | Nemirovsky, Jonathan Peleg, Lee Kish, Amit Ben Shapira, Yotam |
| contents | We investigate quantum circuits built from arbitrary single-qubit operations combined with programmable all-to-all multiqubit entangling gates that are native to, among other systems, trapped-ion quantum computing platforms. We report a constant-cost of no more than four applications of such Clifford entangling multiqubit gates to realize any sequence of Clifford operations of any length, without ancillae, which is the theoretically optimal gate count cost. We do this by implementing any sequence of CNOT gates of any length with four applications of such gates, without ancillae, and show that the extension to general Clifford operations incurs no additional cost. We investigate the required qubit drive power that is associated with our implementation and show that it is lower than that of a standard approach. Our work introduces a practical and computationally efficient algorithm to realize these compilations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_20730 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Optimal constant-cost implementations of Clifford operations using global interactions Nemirovsky, Jonathan Peleg, Lee Kish, Amit Ben Shapira, Yotam Quantum Physics We investigate quantum circuits built from arbitrary single-qubit operations combined with programmable all-to-all multiqubit entangling gates that are native to, among other systems, trapped-ion quantum computing platforms. We report a constant-cost of no more than four applications of such Clifford entangling multiqubit gates to realize any sequence of Clifford operations of any length, without ancillae, which is the theoretically optimal gate count cost. We do this by implementing any sequence of CNOT gates of any length with four applications of such gates, without ancillae, and show that the extension to general Clifford operations incurs no additional cost. We investigate the required qubit drive power that is associated with our implementation and show that it is lower than that of a standard approach. Our work introduces a practical and computationally efficient algorithm to realize these compilations. |
| title | Optimal constant-cost implementations of Clifford operations using global interactions |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2510.20730 |