Quantum circuit for exponentiation of Hamiltonians: an algorithmic description based on tensor products
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910819879485440 |
|---|---|
| author | Fleury, Gerard Lacomme, Philippe |
| author_facet | Fleury, Gerard Lacomme, Philippe |
| contents | Exponentiation of Hamiltonians refers to a mathematical operation to a Hamiltonian operator, typically in the form e^(-i.t.H), where H is the Hamiltonian and t is a time parameter. This operation is fundamental in quantum mechanics, particularly to evolve quantum systems over time according to the Schrodinger equation.
In quantum algorithms, such as Adiabatic methods and QAOA, exponentiation enables efficient simulation of a system dynamics.
It involves constructing quantum circuits that approximate this exponential operation. When H=\sum_(p=1)^n H_p , each H_p is defined using the Pauli operator basis, which includes the well-known X, Y, Z and Id gates, i.e., H_p=U_1\otimes U_2\otimes \otimes U_n and U_k\in{Id,X,Y,Z}. In this article, we explore the exponentiation of H_p, specifically e^(-i.t.U_1 \otimes U_2\otimes \otimes U_n ), by introducing an algorithmic approach. We demonstrate a straightforward and efficient method to construct compact circuits that are easy to implement. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_17780 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum circuit for exponentiation of Hamiltonians: an algorithmic description based on tensor products Fleury, Gerard Lacomme, Philippe Quantum Physics Combinatorics Exponentiation of Hamiltonians refers to a mathematical operation to a Hamiltonian operator, typically in the form e^(-i.t.H), where H is the Hamiltonian and t is a time parameter. This operation is fundamental in quantum mechanics, particularly to evolve quantum systems over time according to the Schrodinger equation. In quantum algorithms, such as Adiabatic methods and QAOA, exponentiation enables efficient simulation of a system dynamics. It involves constructing quantum circuits that approximate this exponential operation. When H=\sum_(p=1)^n H_p , each H_p is defined using the Pauli operator basis, which includes the well-known X, Y, Z and Id gates, i.e., H_p=U_1\otimes U_2\otimes \otimes U_n and U_k\in{Id,X,Y,Z}. In this article, we explore the exponentiation of H_p, specifically e^(-i.t.U_1 \otimes U_2\otimes \otimes U_n ), by introducing an algorithmic approach. We demonstrate a straightforward and efficient method to construct compact circuits that are easy to implement. |
| title | Quantum circuit for exponentiation of Hamiltonians: an algorithmic description based on tensor products |
| topic | Quantum Physics Combinatorics |
| url | https://arxiv.org/abs/2501.17780 |