Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.17743 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908897650933760 |
|---|---|
| author | Doherty, Michael Puviani, Matteo Brewer, Jasmine Matos, Gabriel Amaro, David Criger, Ben Stephen, David T. |
| author_facet | Doherty, Michael Puviani, Matteo Brewer, Jasmine Matos, Gabriel Amaro, David Criger, Ben Stephen, David T. |
| contents | We propose a general method for preparing stabilizer states with reduced two-qubit gate count and depth compared to the state of the art. The method starts from a graph state representation of the stabilizer state and iteratively reduces the number of edges in the graph using two-qubit Clifford gates to produce a unitary preparation circuit. We explore various heuristic search and AI-based approaches to optimally choose Clifford gates at each step, the most sophisticated of which is a combination of reinforcement learning and Monte Carlo tree search that we call QuSynth. We apply our method to synthesize code states of various quantum error correcting codes including the 23-qubit Golay code and the 144-qubit gross code, the latter of which is significantly beyond the qubit number that is accessible to prior optimal circuit synthesis methods. We demonstrate that our techniques are capable of reducing the required two-qubit gates by up to a factor of 2.5 compared to previous approaches while retaining low circuit depth. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_17743 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Fast stabilizer state preparation via AI-optimized graph decimation Doherty, Michael Puviani, Matteo Brewer, Jasmine Matos, Gabriel Amaro, David Criger, Ben Stephen, David T. Quantum Physics We propose a general method for preparing stabilizer states with reduced two-qubit gate count and depth compared to the state of the art. The method starts from a graph state representation of the stabilizer state and iteratively reduces the number of edges in the graph using two-qubit Clifford gates to produce a unitary preparation circuit. We explore various heuristic search and AI-based approaches to optimally choose Clifford gates at each step, the most sophisticated of which is a combination of reinforcement learning and Monte Carlo tree search that we call QuSynth. We apply our method to synthesize code states of various quantum error correcting codes including the 23-qubit Golay code and the 144-qubit gross code, the latter of which is significantly beyond the qubit number that is accessible to prior optimal circuit synthesis methods. We demonstrate that our techniques are capable of reducing the required two-qubit gates by up to a factor of 2.5 compared to previous approaches while retaining low circuit depth. |
| title | Fast stabilizer state preparation via AI-optimized graph decimation |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2603.17743 |