Hamiltonian simulation with explicit formulas for Digital-Analog Quantum Computing
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917326882865152 |
|---|---|
| author | Garcia-de-Andoin, Mikel Müller, Thorge Camacho, Gonzalo |
| author_facet | Garcia-de-Andoin, Mikel Müller, Thorge Camacho, Gonzalo |
| contents | Digital-analog is a quantum computational paradigm that employs the natural interaction Hamiltonian of a system as the entangling resource, combined with single qubit gates, to implement universal quantum operations. As in the case of its digital gate-based counterpart, designing digital-analog circuits that employ optimal quantum resources often requires an exceedingly large classical computational time. In this work we find a suboptimal solution to this exponentially large problem, showing that it can be solved within polynomial computational time. In particular, we provide an exact solution for the problem of expressing arbitrary two-body Hamiltonians as the sum of local unitary transformations of an arbitrary Ising Hamiltonian, with the total number of required terms being at most quadratic in system size. This allows us to design a digital-analog simulation protocol that avoids employing numerical optimization over a large parameter space at the preprocessing stage, minimizing computational resources and allowing for further scaling. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_11404 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Hamiltonian simulation with explicit formulas for Digital-Analog Quantum Computing Garcia-de-Andoin, Mikel Müller, Thorge Camacho, Gonzalo Quantum Physics Mathematical Physics Digital-analog is a quantum computational paradigm that employs the natural interaction Hamiltonian of a system as the entangling resource, combined with single qubit gates, to implement universal quantum operations. As in the case of its digital gate-based counterpart, designing digital-analog circuits that employ optimal quantum resources often requires an exceedingly large classical computational time. In this work we find a suboptimal solution to this exponentially large problem, showing that it can be solved within polynomial computational time. In particular, we provide an exact solution for the problem of expressing arbitrary two-body Hamiltonians as the sum of local unitary transformations of an arbitrary Ising Hamiltonian, with the total number of required terms being at most quadratic in system size. This allows us to design a digital-analog simulation protocol that avoids employing numerical optimization over a large parameter space at the preprocessing stage, minimizing computational resources and allowing for further scaling. |
| title | Hamiltonian simulation with explicit formulas for Digital-Analog Quantum Computing |
| topic | Quantum Physics Mathematical Physics |
| url | https://arxiv.org/abs/2511.11404 |