Tight bound for the total time in digital-analog quantum computation
arXiv:2512.11619 · doi:10.1103/pkz9-vjkh
Abstract
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.
7 pages, 3 figures
References in corpus (23)
- Quantum Simulation
- Effective quantum spin systems with ion traps
- Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries
- Digital-Analog Quantum Computation
- Digital-Analog Quantum Simulations with Superconducting Circuits
- Hamiltonian simulation with random inputs
- Randomizing multi-product formulas for Hamiltonian simulation
- First-Order Trotter Error from a Second-Order Perspective
- Digital-analog quantum algorithm for the quantum Fourier transform
- Quantum Neuronal Sensing of Quantum Many-Body States on a 61-Qubit Programmable Superconducting Processor
- Hybrid digital-analog simulation of many-body dynamics with superconducting qubits
- Digital-Analog Quantum Simulations Using The Cross-Resonance Effect
- Enhanced connectivity of quantum hardware with digital-analog control
- Digital-Analog Quantum Computation with Arbitrary Two-Body Hamiltonians
- Mitigating noise in digital and digital-analog quantum computation
- Digital-analog co-design of the Harrow-Hassidim-Lloyd algorithm
- Realization of programmable Ising models in a trapped-ion quantum simulator
- Digital-analog quantum convolutional neural networks for image classification
- Digital-Analog Counterdiabatic Quantum Optimization with Trapped Ions
- Digital-analog quantum genetic algorithm using Rydberg-atom arrays
- General, efficient, and robust Hamiltonian engineering
- Time-optimal multi-qubit gates: Complexity, efficient heuristic and gate-time bounds
- Benchmarking Digital-Analog Quantum Computation