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:2002.12215 · Physical Review A

Approximating the quantum approximate optimization algorithm with digital-analog interactions

David Headley, Thorge Müller, Ana Martin, E. Solano, Mikel Sanz, Frank K. Wilhelm

Published Oct 28, 2022• 35 citations
arXivHTMLPDF

Abstract

The quantum approximate optimization algorithm was proposed as a heuristic method for solving combinatorial optimization problems on near-term quantum computers and may be among the first algorithms to perform useful computations in the postsupremacy, noisy, intermediate-scale era of quantum computing. In this work we exploit the recently proposed digital-analog quantum computation paradigm, in which the versatility of programmable universal quantum computers and the error resilience of quantum simulators are combined to improve platforms for quantum computation. We show that the digital-analog paradigm is suited to the quantum approximate optimization algorithm due to the algorithm's variational resilience against the coherent errors introduced by the scheme. By performing large-scale simulations and providing analytical bounds for its performance in devices with finite single-qubit operation time we observe regimes of single-qubit operation speed in which the considered variational algorithm provides a significant improvement over nonvariational counterparts in the digital-analog scheme.

DOI
10.1103/physreva.106.042446

Related papers

Digital-Analog Quantum Simulation and Computing: A Perspective on Past and Future Developments

Lucas Lamata

Quantum simulation and computing traditionally has been based on two main paradigms, namely, digital and analog. In the digital paradigm, usually single and two-qubit gates (where qubit is an acronym for quantum bit) are employed as building blocks for scalable, universal quantum computing, although errors add up fast and error correction will be ultimately needed for scaling up. In the analog paradigm, large analog blocks are normally employed for a unitary dynamics that carries out the computation, enabling quantum operations on many qubits with reduced errors, but with the drawback of a limited choice of evolutions and lack of universality. In the past decade, a new paradigm has emerged, showing interesting possibilities for quantum simulation and computing in the near and mid term. This is the paradigm of digital-analog quantum technologies, which proposes to combine the best of both paradigms: large analog blocks, provided by native interactions of the employed quantum platform, enabling scalability, combined with digital gates, allowing for more versatility and, ultimately, universality. In this Perspective, I give an overview of the evolution of the field along the past decade, and an outlook for its future possibilities.

quant-pharXiv:2604.04438•Advanced Computing•Apr 7, 2026•1 citation

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

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

Mitigating noise in digital and digital–analog quantum computation

Paula García-Molina, Ana Martin, Mikel Garcia de Andoin +1 more

Abstract Noisy Intermediate-Scale Quantum (NISQ) devices lack error correction, limiting scalability for quantum algorithms. In this context, digital-analog quantum computing (DAQC) offers a more resilient alternative quantum computing paradigm that outperforms digital quantum computation by combining the flexibility of single-qubit gates with the robustness of analog simulations. This work explores the impact of noise on both digital and DAQC paradigms and demonstrates DAQC’s effectiveness in error mitigation. We compare the quantum Fourier transform and quantum phase estimation algorithms under a wide range of single and two-qubit noise sources in superconducting processors. DAQC consistently surpasses digital approaches in fidelity, particularly as processor size increases. Moreover, zero-noise extrapolation further enhances DAQC by mitigating decoherence and intrinsic errors, achieving fidelities above 0.95 for 8 qubits, and reducing computation errors to the order of 10 −3 . These results establish DAQC as a viable alternative for quantum computing in the NISQ era.

arXiv:2107.12969•Communications Physics•Oct 6, 2024•33 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 computation with arbitrary two-body Hamiltonians

Mikel Garcia de Andoin, Álvaro Sáiz, P. Pérez-Fernández +3 more

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 $n$ qubits requires $\mathcal{O}({n}^{2})$ 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 $\ensuremath{\sim}55%$ for small systems measured in the Frobenius norm.

arXiv:2307.00966•Physical Review Research•Mar 14, 2024•21 citations
The quantum approximate optimization algorithm was proposed as a heuristic method for solving combinatorial optimization problems on near-term quantum computers and may be among the first algorithms to perform useful computations in the postsupremacy, noisy, intermediate-scale era of quantum computing. In this work we exploit the recently proposed digital-analog quantum computation paradigm, in which the versatility of programmable universal quantum computers and the error resilience of quantum simulators are combined to improve platforms for quantum computation. We show that the digital-analog paradigm is suited to the quantum approximate optimization algorithm due to the algorithm's variational resilience against the coherent errors introduced by the scheme. By performing large-scale simulations and providing analytical bounds for its performance in devices with finite single-qubit operation time we observe regimes of single-qubit operation speed in which the considered variational algorithm provides a significant improvement over nonvariational counterparts in the digital-analog scheme.
Quantum simulation and computing traditionally has been based on two main paradigms, namely, digital and analog. In the digital paradigm, usually single and two-qubit gates (where qubit is an acronym for quantum bit) are employed as building blocks for scalable, universal quantum computing, although errors add up fast and error correction will be ultimately needed for scaling up. In the analog paradigm, large analog blocks are normally employed for a unitary dynamics that carries out the computation, enabling quantum operations on many qubits with reduced errors, but with the drawback of a limited choice of evolutions and lack of universality. In the past decade, a new paradigm has emerged, showing interesting possibilities for quantum simulation and computing in the near and mid term. This is the paradigm of digital-analog quantum technologies, which proposes to combine the best of both paradigms: large analog blocks, provided by native interactions of the employed quantum platform, enabling scalability, combined with digital gates, allowing for more versatility and, ultimately, universality. In this Perspective, I give an overview of the evolution of the field along the past decade, and an outlook for its future possibilities.
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 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.
Abstract Noisy Intermediate-Scale Quantum (NISQ) devices lack error correction, limiting scalability for quantum algorithms. In this context, digital-analog quantum computing (DAQC) offers a more resilient alternative quantum computing paradigm that outperforms digital quantum computation by combining the flexibility of single-qubit gates with the robustness of analog simulations. This work explores the impact of noise on both digital and DAQC paradigms and demonstrates DAQC’s effectiveness in error mitigation. We compare the quantum Fourier transform and quantum phase estimation algorithms under a wide range of single and two-qubit noise sources in superconducting processors. DAQC consistently surpasses digital approaches in fidelity, particularly as processor size increases. Moreover, zero-noise extrapolation further enhances DAQC by mitigating decoherence and intrinsic errors, achieving fidelities above 0.95 for 8 qubits, and reducing computation errors to the order of 10 −3 . These results establish DAQC as a viable alternative for quantum computing in the NISQ era.
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.
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 nnn qubits requires O(n2)\mathcal{O}({n}^{2})O(n2) 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 $\ensuremath{\sim}55%$ for small systems measured in the Frobenius norm.