Predict and Conquer: Navigating Algorithm Trade-offs with Quantum Design Automation

• URL: http://arxiv.org/abs/2507.06758v1
• Date: Wed, 09 Jul 2025 11:36:13 GMT
• Title: Predict and Conquer: Navigating Algorithm Trade-offs with Quantum Design Automation
• Authors: Simon Thelen, Wolfgang Mauerer,
• Abstract summary: We present a methodology to perform algorithm selection based on desirable non-functional requirements.<n>Based on the source code level, our framework traces key characteristics of quantum-classical algorithms.<n>We develop statistical models to quantify the influence of various factors on non-functional properties.
• Score: 3.0189109720302207
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Combining quantum computers with classical compute power has become a standard means for developing algorithms that are eventually supposed to beat any purely classical alternatives. While in-principle advantages for solution quality or runtime are expected for many approaches, substantial challenges remain: Non-functional properties like runtime or solution quality of many approaches are not fully understood, and need to be explored empirically. This makes it unclear which approach is best suited for a given problem. Accurately predicting behaviour of quantum-classical algorithms opens possibilities for software abstraction layers, which can automate decision-making for algorithm selection and parametrisation. While such techniques find frequent use in classical high-performance computing, they are still mostly absent from quantum toolchains. We present a methodology to perform algorithm selection based on desirable non-functional requirements. This simplifies decision-making processes for users. Based on annotations at the source code level, our framework traces key characteristics of quantum-classical algorithms, and uses this information to predict the most suitable approach and its parameters for given computational challenges and their non-functional requirements. As combinatorial optimisation is a very extensively studied aspect of quantum-classical systems, we perform a comprehensive case study based on numerical simulations of algorithmic approaches to implement and validate our ideas. We develop statistical models to quantify the influence of various factors on non-functional properties, and establish predictions for optimal algorithmic choices without manual effort. We argue that our methodology generalises to problems beyond combinatorial optimisation, such as Hamiltonian simulation, and lays a foundation for integrated software layers for quantum design automation.

Related papers

• Performance Benchmarking of Quantum Algorithms for Hard Combinatorial Optimization Problems: A Comparative Study of non-FTQC Approaches [0.0]
  This study systematically benchmarks several non-fault-tolerant quantum computing algorithms across four distinct optimization problems. Our benchmark includes noisy intermediate-scale quantum (NISQ) algorithms, such as the variational quantum eigensolver. Our findings reveal that no single non-FTQC algorithm performs optimally across all problem types, underscoring the need for tailored algorithmic strategies.
  arXiv  Detail & Related papers  (2024-10-30T08:41:29Z)
• Sum-of-Squares inspired Quantum Metaheuristic for Polynomial Optimization with the Hadamard Test and Approximate Amplitude Constraints [76.53316706600717]
  Recently proposed quantum algorithm arXiv:2206.14999 is based on semidefinite programming (SDP) We generalize the SDP-inspired quantum algorithm to sum-of-squares. Our results show that our algorithm is suitable for large problems and approximate the best known classicals.
  arXiv  Detail & Related papers  (2024-08-14T19:04:13Z)
• Integrating Quantum Algorithms Into Classical Frameworks: A Predictor-corrector Approach Using HHL [0.562479170374811]
  We adapt a well-known algorithm for linear systems of equations, originally proposed by Harrow, Hassidim and Lloyd (HHL), by adapting it into a predictor-corrector instead of a direct solver. This strategy enables the intelligent omission of computationally costly steps commonly found in many classical algorithms, while simultaneously mitigating the notorious readout problems associated with extracting a quantum state. The versatility of the approach is illustrated through applications in various fields such as smoothed particle hydrodynamics, plasma simulations, and reactive flow configurations.
  arXiv  Detail & Related papers  (2024-06-28T15:31:10Z)
• Towards Robust Benchmarking of Quantum Optimization Algorithms [3.9456729020535013]
  A key problem in existing benchmarking frameworks is the lack of equal effort in optimizing for the best quantum and, respectively, classical approaches. This paper presents a comprehensive set of guidelines comprising universal steps towards fair benchmarks.
  arXiv  Detail & Related papers  (2024-05-13T10:35:23Z)
• A Review on Quantum Approximate Optimization Algorithm and its Variants [47.89542334125886]
  The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising variational quantum algorithm that aims to solve intractable optimization problems. This comprehensive review offers an overview of the current state of QAOA, encompassing its performance analysis in diverse scenarios. We conduct a comparative study of selected QAOA extensions and variants, while exploring future prospects and directions for the algorithm.
  arXiv  Detail & Related papers  (2023-06-15T15:28:12Z)
• Socio-cognitive Optimization of Time-delay Control Problems using Evolutionary Metaheuristics [89.24951036534168]
  Metaheuristics are universal optimization algorithms which should be used for solving difficult problems, unsolvable by classic approaches. In this paper we aim at constructing novel socio-cognitive metaheuristic based on castes, and apply several versions of this algorithm to optimization of time-delay system model.
  arXiv  Detail & Related papers  (2022-10-23T22:21:10Z)
• Variational quantum algorithm for unconstrained black box binary optimization: Application to feature selection [1.9182522142368683]
  We introduce a variational quantum algorithm to solve unconstrained black box binary problems. This is in contrast to the typical setting of quantum algorithms for optimization. We show that the quantum method produces competitive and in certain aspects even better performance than traditional feature selection techniques.
  arXiv  Detail & Related papers  (2022-05-06T07:02:15Z)
• Neural Combinatorial Optimization: a New Player in the Field [69.23334811890919]
  This paper presents a critical analysis on the incorporation of algorithms based on neural networks into the classical optimization framework. A comprehensive study is carried out to analyse the fundamental aspects of such algorithms, including performance, transferability, computational cost and to larger-sized instances.
  arXiv  Detail & Related papers  (2022-05-03T07:54:56Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)
• To quantum or not to quantum: towards algorithm selection in near-term quantum optimization [0.0]
  We study the problem of detecting problem instances of where QAOA is most likely to yield an advantage over a conventional algorithm. We achieve cross-validated accuracy well over 96%, which would yield a substantial practical advantage.
  arXiv  Detail & Related papers  (2020-01-22T20:42:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.