Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.00416 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912686296530944 |
|---|---|
| author | Zak, Dekel Mei, Jingyi Lagniez, Jean-Marie Laarman, Alfons |
| author_facet | Zak, Dekel Mei, Jingyi Lagniez, Jean-Marie Laarman, Alfons |
| contents | Quantum circuit synthesis is the task of decomposing a given quantum operator into a sequence of elementary quantum gates. Since the finite target gate set cannot exactly implement any given operator, approximation is often necessary. Model counting, or #SAT, has recently been demonstrated as a promising new approach for tackling core problems in quantum circuit analysis. In this work, we show for the first time that the universal quantum circuit synthesis problem can be reduced to maximum model counting. We formulate a #SAT encoding for exact and approximate depth-optimal quantum circuit synthesis into the Clifford+T gate set. We evaluate our method with an open-source implementation that uses the maximum model counter d4Max as a backend. For this purpose, we extended d4Max with support for complex and negative weights to represent amplitudes. Experimental results show that existing classical tools have potential for the quantum circuit synthesis problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_00416 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Reducing Quantum Circuit Synthesis to #SAT Zak, Dekel Mei, Jingyi Lagniez, Jean-Marie Laarman, Alfons Quantum Physics Quantum circuit synthesis is the task of decomposing a given quantum operator into a sequence of elementary quantum gates. Since the finite target gate set cannot exactly implement any given operator, approximation is often necessary. Model counting, or #SAT, has recently been demonstrated as a promising new approach for tackling core problems in quantum circuit analysis. In this work, we show for the first time that the universal quantum circuit synthesis problem can be reduced to maximum model counting. We formulate a #SAT encoding for exact and approximate depth-optimal quantum circuit synthesis into the Clifford+T gate set. We evaluate our method with an open-source implementation that uses the maximum model counter d4Max as a backend. For this purpose, we extended d4Max with support for complex and negative weights to represent amplitudes. Experimental results show that existing classical tools have potential for the quantum circuit synthesis problem. |
| title | Reducing Quantum Circuit Synthesis to #SAT |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2508.00416 |