Tight bound for the total time in digital-analog quantum computation
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918246620332032 |
|---|---|
| author | Garcia-de-Andoin, Mikel Sanz, Mikel |
| author_facet | Garcia-de-Andoin, Mikel Sanz, Mikel |
| contents | Digital-analog quantum computing (DAQC) is a universal computational paradigm that combines the evolution under an entangling Hamiltonian with the application of single-qubit gates. Since any unitary operation can be decomposed into a sequence of evolutions generated by two-body Hamiltonians, DAQC is inherently well-suited for realizing such operations. Suboptimal upper bounds for the total time required to perform these evolutions have been previously proposed. Here, we improve these limits by providing a tight bound for this crucial parameter, which shows a linear dependence with the number of couplings. This result enables a precise estimation of the time resources needed for quantum simulations and quantum algorithms implemented within the DAQC framework, facilitating a rigorous comparison with other approaches. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_11619 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Tight bound for the total time in digital-analog quantum computation Garcia-de-Andoin, Mikel Sanz, Mikel Quantum Physics Digital-analog quantum computing (DAQC) is a universal computational paradigm that combines the evolution under an entangling Hamiltonian with the application of single-qubit gates. Since any unitary operation can be decomposed into a sequence of evolutions generated by two-body Hamiltonians, DAQC is inherently well-suited for realizing such operations. Suboptimal upper bounds for the total time required to perform these evolutions have been previously proposed. Here, we improve these limits by providing a tight bound for this crucial parameter, which shows a linear dependence with the number of couplings. This result enables a precise estimation of the time resources needed for quantum simulations and quantum algorithms implemented within the DAQC framework, facilitating a rigorous comparison with other approaches. |
| title | Tight bound for the total time in digital-analog quantum computation |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2512.11619 |