Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916342449307648 |
|---|---|
| author | Huang, Qunsheng Winderl, David de Griend, Arianne Meijer-van Yeung, Richie |
| author_facet | Huang, Qunsheng Winderl, David de Griend, Arianne Meijer-van Yeung, Richie |
| contents | In quantum computing, the efficient optimization of Pauli string decompositions is a crucial aspect for the compilation of quantum circuits for many applications, such as chemistry simulations and quantum machine learning. In this paper, we propose a novel algorithm for the synthesis of trotterized time-evolution operators that results in circuits with significantly fewer gates than previous solutions. Our synthesis procedure takes the qubit connectivity of a target quantum computer into account. As a result, the generated quantum circuit does not require routing, and no additional CNOT gates are needed to run the resulting circuit on a target device. We compare our algorithm against Paulihedral and TKET, and show a significant improvement for randomized circuits and different molecular ansatzes. We also investigate the Trotter error introduced by our ordering of the terms in the Hamiltonian versus default ordering and the ordering from the baseline methods and conclude that our method on average does not increase the Trotter error. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_00354 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling Huang, Qunsheng Winderl, David de Griend, Arianne Meijer-van Yeung, Richie Quantum Physics Data Structures and Algorithms Programming Languages In quantum computing, the efficient optimization of Pauli string decompositions is a crucial aspect for the compilation of quantum circuits for many applications, such as chemistry simulations and quantum machine learning. In this paper, we propose a novel algorithm for the synthesis of trotterized time-evolution operators that results in circuits with significantly fewer gates than previous solutions. Our synthesis procedure takes the qubit connectivity of a target quantum computer into account. As a result, the generated quantum circuit does not require routing, and no additional CNOT gates are needed to run the resulting circuit on a target device. We compare our algorithm against Paulihedral and TKET, and show a significant improvement for randomized circuits and different molecular ansatzes. We also investigate the Trotter error introduced by our ordering of the terms in the Hamiltonian versus default ordering and the ordering from the baseline methods and conclude that our method on average does not increase the Trotter error. |
| title | Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling |
| topic | Quantum Physics Data Structures and Algorithms Programming Languages |
| url | https://arxiv.org/abs/2408.00354 |