Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2407.09308 · Physical Review A

Digital-analog quantum genetic algorithm using Rydberg-atom arrays

Aleix Llenas, Lucas Lamata

Published Oct 3, 2024• 8 citations
arXivHTMLPDF

Abstract

Digital-analog quantum computing (DAQC) combines digital gates with analog operations, offering an alternative paradigm for universal quantum computation. This approach leverages the higher fidelities of analog operations and the flexibility of local single-qubit gates. In this paper, we propose a quantum genetic algorithm within the DAQC framework using a Rydberg-atom emulator. The algorithm employs single-qubit operations in the digital domain and a global driving interaction based on the Rydberg Hamiltonian in the analog domain. We evaluate the algorithm performance by estimating the ground-state energy of Hamiltonians, with a focus on molecules such as ${\mathrm{H}}_{2}, \mathrm{LiH}$, and ${\mathrm{BeH}}_{2}$. Our results show energy estimations with less than 1% error and state overlaps nearing 1, with computation times ranging from a few minutes for ${\mathrm{H}}_{2}$ (two-qubit circuits) to one to two days for $\mathrm{LiH}$ and ${\mathrm{BeH}}_{2}$ (six-qubit circuits). The gate fidelities of global analog operations further underscore DAQC as a promising quantum computing strategy in the noisy intermediate-scale quantum era.

DOI
10.1103/physreva.110.042603

Related papers

Digital-analog quantum computation

A. Parra-Rodriguez, Pavel Lougovski, Lucas Lamata +2 more

Digital quantum computing paradigm offers highly desirable features such as universality, scalability, and quantum error correction. However, physical resource requirements to implement useful error-corrected quantum algorithms are prohibitive in the current era of NISQ devices. As an alternative path to performing universal quantum computation, within the NISQ era limitations, we propose to merge digital single-qubit operations with analog multiqubit entangling blocks in an approach we call digital-analog quantum computing (DAQC). Along these lines, although the techniques may be extended to any resource, we propose to use unitaries generated by the ubiquitous Ising Hamiltonian for the analog entangling block and we prove its universal character. We construct explicit DAQC protocols for efficient simulations of arbitrary inhomogeneous Ising, two-body, and $M$-body spin Hamiltonian dynamics by means of single-qubit gates and a fixed homogeneous Ising Hamiltonian. Additionally, we compare a sequential approach where the interactions are switched on and off (stepwise DAQC) with an always-on multiqubit interaction interspersed by fast single-qubit pulses (banged DAQC). Finally, we perform numerical tests comparing purely digital schemes with DAQC protocols, showing a remarkably better performance of the latter. The proposed DAQC approach combines the robustness of analog quantum computing with the flexibility of digital methods.

arXiv:1812.03637•Physical Review A•Feb 6, 2020•119 citations

Tight bound for the total time in digital-analog quantum computation

Mikel Garcia-de-Andoin, Mikel Sanz

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.

quant-pharXiv:2512.11619•Physical Review Research•Dec 15, 2025•2 citations

Digital–analog quantum learning on Rydberg atom arrays

Jonathan Z. Lu, Lucy Jiao, Kristina Wolinski +6 more

Abstract We propose hybrid digital–analog (DA) learning algorithms on Rydberg atom arrays, combining the potentially practical utility and near-term realizability of quantum learning with the rapidly scaling architectures of neutral atoms. Our construction requires only single-qubit operations in the digital setting and global driving according to the Rydberg Hamiltonian in the analog setting. We perform a comprehensive numerical study of our algorithm on both classical and quantum data, given respectively by handwritten digit classification and unsupervised quantum phase boundary learning. We show in the two representative problems that DA learning is not only feasible in the near term, but also requires shorter circuit depths and is more robust to realistic error models as compared to digital learning schemes. Our results suggest that DA learning opens a promising path towards improved variational quantum learning experiments in the near term.

arXiv:2401.02940•Quantum Science and Technology•Nov 12, 2024•24 citations

Digital-Analog Quantum Computing and Algorithms

Martin, Ana

This Thesis delves into the development and implementation of quantum algorithms using the digital-analog quantum computing (DAQC) paradigm. It provides a comparative analysis of the performance of DAQC versus traditional digital approaches, particularly in the presence of noise sources from current noisy intermediate-scale quantum (NISQ) devices. The DAQC paradigm combines the strengths of digital and analog quantum computing, offering greater efficiency and precision for implementing quantum algorithms on real hardware. The Thesis focuses on the comparison of four relevant quantum algorithms using digital and digital-analog approaches, and the results show significant advantages in favor of the latter. Furthermore, the Thesis investigates the cross-resonance effect to achieve efficient and high-precision Hamiltonian simulations. The findings indicate that the digital-analog paradigm is promising for practical quantum computing applications. Its ability to deliver greater efficiency and accuracy in implementing quantum algorithms on real hardware is a significant advantage over traditional digital approaches.

arXiv:2401.10622•Jan 19, 2024•4 citations

Hamiltonian simulation with explicit formulas for Digital-Analog Quantum Computing

Mikel Garcia-de-Andoin, Thorge Müller, Gonzalo Camacho

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.

quant-pharXiv:2511.11404•Physical Review A•Nov 17, 2025•2 citations

Enhancing quantum annealing in digital–analog quantum computing

Tadashi Kadowaki

Digital–analog quantum computing (DAQC) offers a promising approach to addressing the challenges of building a practical quantum computer. By efficiently allocating resources between digital and analog quantum circuits, DAQC paves the way for achieving optimal performance. We propose an algorithm designed to enhance the performance of quantum annealing. This method employs a quantum gate to estimate the goodness of the final annealing state and find the ground state of combinatorial optimization problems. We explore two strategies for integrating the quantum annealing circuit into the DAQC framework: (1) state preparation, and (2) embedding within the quantum gate. While the former strategy does not yield performance improvements, we discover that the latter enhances performance within a specific range of annealing time. Algorithms demonstrating enhanced performance utilize the imaginary part of the inner product of two states from different quantum annealing settings. This measure reflects not only the energy of the classical cost function but also the trajectory of the quantum dynamics. This study provides an example of how processing quantum data using a quantum circuit can outperform classical data processing, which discards quantum information.

arXiv:2306.02059•APL Quantum•Apr 2, 2024•4 citations
Digital-analog quantum computing (DAQC) combines digital gates with analog operations, offering an alternative paradigm for universal quantum computation. This approach leverages the higher fidelities of analog operations and the flexibility of local single-qubit gates. In this paper, we propose a quantum genetic algorithm within the DAQC framework using a Rydberg-atom emulator. The algorithm employs single-qubit operations in the digital domain and a global driving interaction based on the Rydberg Hamiltonian in the analog domain. We evaluate the algorithm performance by estimating the ground-state energy of Hamiltonians, with a focus on molecules such as H2,LiH{\mathrm{H}}_{2}, \mathrm{LiH}H2​,LiH, and BeH2{\mathrm{BeH}}_{2}BeH2​. Our results show energy estimations with less than 1% error and state overlaps nearing 1, with computation times ranging from a few minutes for H2{\mathrm{H}}_{2}H2​ (two-qubit circuits) to one to two days for LiH\mathrm{LiH}LiH and BeH2{\mathrm{BeH}}_{2}BeH2​ (six-qubit circuits). The gate fidelities of global analog operations further underscore DAQC as a promising quantum computing strategy in the noisy intermediate-scale quantum era.
Digital quantum computing paradigm offers highly desirable features such as universality, scalability, and quantum error correction. However, physical resource requirements to implement useful error-corrected quantum algorithms are prohibitive in the current era of NISQ devices. As an alternative path to performing universal quantum computation, within the NISQ era limitations, we propose to merge digital single-qubit operations with analog multiqubit entangling blocks in an approach we call digital-analog quantum computing (DAQC). Along these lines, although the techniques may be extended to any resource, we propose to use unitaries generated by the ubiquitous Ising Hamiltonian for the analog entangling block and we prove its universal character. We construct explicit DAQC protocols for efficient simulations of arbitrary inhomogeneous Ising, two-body, and MMM-body spin Hamiltonian dynamics by means of single-qubit gates and a fixed homogeneous Ising Hamiltonian. Additionally, we compare a sequential approach where the interactions are switched on and off (stepwise DAQC) with an always-on multiqubit interaction interspersed by fast single-qubit pulses (banged DAQC). Finally, we perform numerical tests comparing purely digital schemes with DAQC protocols, showing a remarkably better performance of the latter. The proposed DAQC approach combines the robustness of analog quantum computing with the flexibility of digital methods.
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.
Abstract We propose hybrid digital–analog (DA) learning algorithms on Rydberg atom arrays, combining the potentially practical utility and near-term realizability of quantum learning with the rapidly scaling architectures of neutral atoms. Our construction requires only single-qubit operations in the digital setting and global driving according to the Rydberg Hamiltonian in the analog setting. We perform a comprehensive numerical study of our algorithm on both classical and quantum data, given respectively by handwritten digit classification and unsupervised quantum phase boundary learning. We show in the two representative problems that DA learning is not only feasible in the near term, but also requires shorter circuit depths and is more robust to realistic error models as compared to digital learning schemes. Our results suggest that DA learning opens a promising path towards improved variational quantum learning experiments in the near term.
This Thesis delves into the development and implementation of quantum algorithms using the digital-analog quantum computing (DAQC) paradigm. It provides a comparative analysis of the performance of DAQC versus traditional digital approaches, particularly in the presence of noise sources from current noisy intermediate-scale quantum (NISQ) devices. The DAQC paradigm combines the strengths of digital and analog quantum computing, offering greater efficiency and precision for implementing quantum algorithms on real hardware. The Thesis focuses on the comparison of four relevant quantum algorithms using digital and digital-analog approaches, and the results show significant advantages in favor of the latter. Furthermore, the Thesis investigates the cross-resonance effect to achieve efficient and high-precision Hamiltonian simulations. The findings indicate that the digital-analog paradigm is promising for practical quantum computing applications. Its ability to deliver greater efficiency and accuracy in implementing quantum algorithms on real hardware is a significant advantage over traditional digital approaches.
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.
Digital–analog quantum computing (DAQC) offers a promising approach to addressing the challenges of building a practical quantum computer. By efficiently allocating resources between digital and analog quantum circuits, DAQC paves the way for achieving optimal performance. We propose an algorithm designed to enhance the performance of quantum annealing. This method employs a quantum gate to estimate the goodness of the final annealing state and find the ground state of combinatorial optimization problems. We explore two strategies for integrating the quantum annealing circuit into the DAQC framework: (1) state preparation, and (2) embedding within the quantum gate. While the former strategy does not yield performance improvements, we discover that the latter enhances performance within a specific range of annealing time. Algorithms demonstrating enhanced performance utilize the imaginary part of the inner product of two states from different quantum annealing settings. This measure reflects not only the energy of the classical cost function but also the trajectory of the quantum dynamics. This study provides an example of how processing quantum data using a quantum circuit can outperform classical data processing, which discards quantum information.