Heuristic and Optimal Synthesis of CNOT and Clifford Circuits
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_ | 1866910883168387072 |
|---|---|
| author | Webster, Mark Koutsioumpas, Stergios Browne, Dan E |
| author_facet | Webster, Mark Koutsioumpas, Stergios Browne, Dan E |
| contents | Efficiently implementing Clifford circuits is crucial for quantum error correction and quantum algorithms. Linear reversible circuits, equivalent to circuits composed of CNOT gates, have important applications in classical computing. In this work we present methods for CNOT and general Clifford circuit synthesis which can be used to minimise either the entangling two-qubit gate count or the circuit depth. We present three families of algorithms - optimal synthesis which works on small circuits, A* synthesis for intermediate-size circuits and greedy synthesis for large circuits. We benchmark against existing methods in the literature and show that our approach results in circuits with lower two-qubit gate count than previous methods. The algorithms have been implemented in a GitHub repository for use by the classical and quantum computing community. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_14660 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Heuristic and Optimal Synthesis of CNOT and Clifford Circuits Webster, Mark Koutsioumpas, Stergios Browne, Dan E Quantum Physics Efficiently implementing Clifford circuits is crucial for quantum error correction and quantum algorithms. Linear reversible circuits, equivalent to circuits composed of CNOT gates, have important applications in classical computing. In this work we present methods for CNOT and general Clifford circuit synthesis which can be used to minimise either the entangling two-qubit gate count or the circuit depth. We present three families of algorithms - optimal synthesis which works on small circuits, A* synthesis for intermediate-size circuits and greedy synthesis for large circuits. We benchmark against existing methods in the literature and show that our approach results in circuits with lower two-qubit gate count than previous methods. The algorithms have been implemented in a GitHub repository for use by the classical and quantum computing community. |
| title | Heuristic and Optimal Synthesis of CNOT and Clifford Circuits |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2503.14660 |