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:2401.10622

Digital-Analog Quantum Computing and Algorithms

Martin, Ana

Published Jan 19, 2024• 4 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2401.10622

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

Digital-analog quantum algorithm for the quantum Fourier transform

Ana Martin, Lucas Lamata, E. Solano +1 more

The authors introduce an efficient digital-analog quantum algorithm to compute the quantum Fourier transform, a subroutine widely employed in several relevant quantum algorithms. The paper shows that, under sensible assumptions about noise sources, the fidelity of the quantum Fourier transformation improves considerably with this approach when compared against digital quantum computing. This suggests that hybrid protocols combining digital and analog quantum computing could be a sensible approach to reach quantum advantage in the Noisy Intermediate-Scale Quantum era.

arXiv:1906.07635•Physical Review Research•Jan 6, 2020•48 citations

Digital-analog quantum genetic algorithm using Rydberg-atom arrays

Aleix Llenas, Lucas Lamata

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.

arXiv:2407.09308•Physical Review A•Oct 3, 2024•8 citations

Enabling large-scale digital quantum simulations with superconducting qubits

Laurin E. Fischer

Quantum computing promises to revolutionize several scientific and technological domains through fundamentally new ways of processing information. Among its most compelling applications is digital quantum simulation, where quantum computers are used to replicate the behavior of other quantum systems. This could enable the study of problems that are otherwise intractable on classical computers, transforming fields such as quantum chemistry, condensed matter physics, and materials science. Despite this potential, realizations of practical quantum advantage for relevant problems are hindered by imperfections of current devices. This also affects quantum hardware based on superconducting circuits which is among the most advanced and scalable platforms. The envisaged long-term solution of fault-tolerant quantum computers that correct their own errors remains out of reach mainly due to the associated qubit number overhead. As a result, the field has developed strategies that combine quantum and classical resources, exploit hardware-native operations, and employ error mitigation techniques to extract meaningful results from noisy data. This doctoral thesis contributes to this broader effort by exploring methods for advancing quantum simulation across the full computational stack, including hardware-level innovations, refined techniques for noise modeling and error mitigation, and algorithmic improvements enabled by efficient measurement processing.

quant-pharXiv:2602.04719•Feb 5, 2026•1 citation

Digital Quantum Simulation of Many-Body Systems: Making the Most of Intermediate-Scale, Noisy Quantum Computers

Miessen, Alexander

Quantum mechanical problems are among the hardest to simulate and, in some cases, remain intractable even for the most powerful computers. Quantum computing has emerged as a new technological platform to address such challenges, with rapid advances in recent years. Yet, current quantum devices remain noisy and limited in scale. Hence, it is essential to identify classically hard problems of practical interest and tractable with existing quantum devices. Among potential applications, the real-time simulation of quantum systems is one of the most promising to deliver an early, practical quantum advantage. This doctoral thesis is therefore centered around simulating quantum dynamics on quantum devices. We first present an overview of the most relevant quantum algorithms for quantum dynamics, highlighting respective advantages and limitations. Further, we identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future. Second, we propose a method for benchmarking hardware and error mitigation algorithms that is based on well-understood theoretical results and suffers from no scaling issues. The resulting quality metric is intuitive and transferable to other applications. We successfully implement the scheme on up to 133 qubits, demonstrating coherent evolution up to a two-qubit gate depth of 28, featuring 1396 two-qubit gates, before noise becomes prevalent. Third, we propose a novel variant of probabilistic error amplification to implement open quantum dynamics, relying on characterizing and altering hardware noise to mimic the system-environment interaction under study. Lastly, we present two studies on state preparation and phase classification: first, a hybrid algorithm to prepare ground states of electron-phonon systems; second, a quantum machine learning-based approach to distinguish phases in previously prepared quantum states.

arXiv:2508.21504•Aug 29, 2025•1 citation

Quantum Advantage in the NISQ Era - Algorithms, Benchmarks, and Practical Limitations

Akella, Pathanjali Sastri,, Akelle Srinivasa Rao, V N R Sai Krishna Kari

The current stage of quantum computing development is defined by Noisy Intermediate-Scale Quantum (NISQ) devices, which operate with a moderate number of qubits that are inherently susceptible to noise and decoherence. Despite the absence of full error correction, NISQ systems have demonstrated the ability to perform computational tasks that challenge classical simulation under certain conditions. This paper explores the concept of quantum advantage in the NISQ era by analysing prominent algorithmic approaches, benchmarking methodologies, and the practical constraints imposed by contemporary hardware. Hybrid quantum–classical algorithms, sampling-based experiments, and performance metrics are examined to assess the extent to which near-term quantum devices can outperform classical systems. The study finds that while progress toward quantum advantage is evident, significant technical and algorithmic limitations prevent its widespread realization. The paper concludes by identifying key research directions required to bridge the gap between experimental demonstrations and practical quantum computing applications.

Journal of Analytical and Applied Computer Sciences•Dec 31, 2025•0 citations
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 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.
The authors introduce an efficient digital-analog quantum algorithm to compute the quantum Fourier transform, a subroutine widely employed in several relevant quantum algorithms. The paper shows that, under sensible assumptions about noise sources, the fidelity of the quantum Fourier transformation improves considerably with this approach when compared against digital quantum computing. This suggests that hybrid protocols combining digital and analog quantum computing could be a sensible approach to reach quantum advantage in the Noisy Intermediate-Scale Quantum era.
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.
Quantum computing promises to revolutionize several scientific and technological domains through fundamentally new ways of processing information. Among its most compelling applications is digital quantum simulation, where quantum computers are used to replicate the behavior of other quantum systems. This could enable the study of problems that are otherwise intractable on classical computers, transforming fields such as quantum chemistry, condensed matter physics, and materials science. Despite this potential, realizations of practical quantum advantage for relevant problems are hindered by imperfections of current devices. This also affects quantum hardware based on superconducting circuits which is among the most advanced and scalable platforms. The envisaged long-term solution of fault-tolerant quantum computers that correct their own errors remains out of reach mainly due to the associated qubit number overhead. As a result, the field has developed strategies that combine quantum and classical resources, exploit hardware-native operations, and employ error mitigation techniques to extract meaningful results from noisy data. This doctoral thesis contributes to this broader effort by exploring methods for advancing quantum simulation across the full computational stack, including hardware-level innovations, refined techniques for noise modeling and error mitigation, and algorithmic improvements enabled by efficient measurement processing.
Quantum mechanical problems are among the hardest to simulate and, in some cases, remain intractable even for the most powerful computers. Quantum computing has emerged as a new technological platform to address such challenges, with rapid advances in recent years. Yet, current quantum devices remain noisy and limited in scale. Hence, it is essential to identify classically hard problems of practical interest and tractable with existing quantum devices. Among potential applications, the real-time simulation of quantum systems is one of the most promising to deliver an early, practical quantum advantage. This doctoral thesis is therefore centered around simulating quantum dynamics on quantum devices. We first present an overview of the most relevant quantum algorithms for quantum dynamics, highlighting respective advantages and limitations. Further, we identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future. Second, we propose a method for benchmarking hardware and error mitigation algorithms that is based on well-understood theoretical results and suffers from no scaling issues. The resulting quality metric is intuitive and transferable to other applications. We successfully implement the scheme on up to 133 qubits, demonstrating coherent evolution up to a two-qubit gate depth of 28, featuring 1396 two-qubit gates, before noise becomes prevalent. Third, we propose a novel variant of probabilistic error amplification to implement open quantum dynamics, relying on characterizing and altering hardware noise to mimic the system-environment interaction under study. Lastly, we present two studies on state preparation and phase classification: first, a hybrid algorithm to prepare ground states of electron-phonon systems; second, a quantum machine learning-based approach to distinguish phases in previously prepared quantum states.
The current stage of quantum computing development is defined by Noisy Intermediate-Scale Quantum (NISQ) devices, which operate with a moderate number of qubits that are inherently susceptible to noise and decoherence. Despite the absence of full error correction, NISQ systems have demonstrated the ability to perform computational tasks that challenge classical simulation under certain conditions. This paper explores the concept of quantum advantage in the NISQ era by analysing prominent algorithmic approaches, benchmarking methodologies, and the practical constraints imposed by contemporary hardware. Hybrid quantum–classical algorithms, sampling-based experiments, and performance metrics are examined to assess the extent to which near-term quantum devices can outperform classical systems. The study finds that while progress toward quantum advantage is evident, significant technical and algorithmic limitations prevent its widespread realization. The paper concludes by identifying key research directions required to bridge the gap between experimental demonstrations and practical quantum computing applications.