Hamiltonian Reordering for Shallower Trotterization Circuits
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929759785582592 |
|---|---|
| author | Thanh, Cédric Ho |
| author_facet | Thanh, Cédric Ho |
| contents | Quantum simulation is a popular application of quantum computing, but its practical realization is hindered by the technical limitations of current devices. In this work, we focus on preprocessing Hamiltonians before Trotterization to generate shallower evolution circuits, which are less prone to noise and decoherence. Specifically, we apply graph coloring techniques to reorder Pauli terms and increase "gate parallelism". We benchmark two coloring algorithms, and report the depth reduction and computational overhead. Then, we examine how these optimized circuits affect the performance of the Quantum Approximate Optimization Algorithm (QAOA). Our results show that shallower circuits lead to faster convergence and reach higher energy levels compared to their non-reordered counterparts. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_11153 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Hamiltonian Reordering for Shallower Trotterization Circuits Thanh, Cédric Ho Quantum Physics Quantum simulation is a popular application of quantum computing, but its practical realization is hindered by the technical limitations of current devices. In this work, we focus on preprocessing Hamiltonians before Trotterization to generate shallower evolution circuits, which are less prone to noise and decoherence. Specifically, we apply graph coloring techniques to reorder Pauli terms and increase "gate parallelism". We benchmark two coloring algorithms, and report the depth reduction and computational overhead. Then, we examine how these optimized circuits affect the performance of the Quantum Approximate Optimization Algorithm (QAOA). Our results show that shallower circuits lead to faster convergence and reach higher energy levels compared to their non-reordered counterparts. |
| title | Hamiltonian Reordering for Shallower Trotterization Circuits |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2503.11153 |