Digital-Analog Quantum Computation with Arbitrary Two-Body Hamiltonians
Mikel Garcia-de-Andoin, \'Alvaro Saiz, Pedro P\'erez-Fern\'andez,, Lucas Lamata, Izaskun Oregi, Mikel Sanz

TL;DR
This paper introduces a flexible digital-analog quantum computing scheme using arbitrary two-body Hamiltonians, enabling broader experimental implementation and offering polynomial efficiency improvements over previous methods.
Contribution
It extends digital-analog quantum computing to arbitrary two-body Hamiltonians, providing a scalable simulation scheme and a hybrid classical optimization strategy for enhanced performance.
Findings
Simulation of arbitrary two-body Hamiltonians requires O(n^2) analog blocks.
The proposed classical optimization improves performance by approximately 55%.
The scheme is applicable to most quantum platforms.
Abstract
Digital-analog quantum computing is a computational paradigm which employs an analog Hamiltonian resource together with single-qubit gates to reach universality. Here, we design a new scheme which employs an arbitrary two-body source Hamiltonian, extending the experimental applicability of this computational paradigm to most quantum platforms. We show that the simulation of an arbitrary two-body target Hamiltonian of qubits requires analog blocks with guaranteed positive times, providing a polynomial advantage compared to the previous scheme. Additionally, we propose a classical strategy which combines a Bayesian optimization with a gradient descent method, improving the performance by for small systems measured in the Frobenius norm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Parallel Computing and Optimization Techniques
