Warm-Starting and Quantum Computing: A Systematic Mapping Study

• URL: http://arxiv.org/abs/2303.06133v3
• Date: Thu, 28 Mar 2024 13:15:57 GMT
• Title: Warm-Starting and Quantum Computing: A Systematic Mapping Study
• Authors: Felix Truger, Johanna Barzen, Marvin Bechtold, Martin Beisel, Frank Leymann, Alexander Mandl, Vladimir Yussupov,
• Abstract summary: We collect and analyze scientific literature on warm-starting techniques in the quantum computing domain. We aim to help quantum software engineers to categorize warm-starting techniques and apply them in practice.
• Score: 35.19840943615427
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Due to low numbers of qubits and their error-proneness, Noisy Intermediate-Scale Quantum (NISQ) computers impose constraints on the size of quantum algorithms they can successfully execute. State-of-the-art research introduces various techniques addressing these limitations by utilizing known or inexpensively generated approximations, solutions, or models as a starting point to approach a task instead of starting from scratch. These so-called warm-starting techniques aim to reduce quantum resource consumption, thus facilitating the design of algorithms suiting the capabilities of NISQ computers. In this work, we collect and analyze scientific literature on warm-starting techniques in the quantum computing domain. In particular, we (i) create a systematic map of state-of-the-art research on warm-starting techniques using established guidelines for systematic mapping studies, (ii) identify relevant properties of such techniques, and (iii) based on these properties classify the techniques identified in the literature in an extensible classification scheme. Our results provide insights into the research field and aim to help quantum software engineers to categorize warm-starting techniques and apply them in practice. Moreover, our contributions may serve as a starting point for further research on the warm-starting topic since they provide an overview of existing work and facilitate the identification of research gaps.

Related papers

• Learning complexity gradually in quantum machine learning models [0.29998889086656577]
  We propose a framework that prioritizes informative data points over the entire training set. By selectively focusing on informative samples, we aim to steer the optimization process toward more favorable regions of the parameter space. Our findings indicate that this strategy could be a valuable approach for improving the performance of quantum machine learning models.
  arXiv  Detail & Related papers  (2024-11-18T19:00:01Z)
• Quantum Linear System Solvers: A Survey of Algorithms and Applications [2.9648284018500033]
  We summarize and analyze the main ideas behind some of the algorithms for the quantum linear systems problem in the literature. We focus on the post-HHL enhancements which have paved the way towards optimal lower bounds with respect to error tolerance and condition number. We discuss the potential applications of these algorithms in differential equations, quantum machine learning, and many-body physics.
  arXiv  Detail & Related papers  (2024-11-04T19:03:25Z)
• A typology of quantum algorithms [1.967426628955258]
  We draw the current landscape of quantum algorithms, by classifying about 130 quantum algorithms. The primary objectives include revealing trends of algorithms, identifying promising fields for implementations in the NISQ era, and identifying the key algorithmic primitives that power quantum advantage.
  arXiv  Detail & Related papers  (2024-07-06T20:41:05Z)
• Neural auto-designer for enhanced quantum kernels [59.616404192966016]
  We present a data-driven approach that automates the design of problem-specific quantum feature maps. Our work highlights the substantial role of deep learning in advancing quantum machine learning.
  arXiv  Detail & Related papers  (2024-01-20T03:11:59Z)
• Approximate Computing Survey, Part II: Application-Specific & Architectural Approximation Techniques and Applications [14.450131342802631]
  Approximate Computing allows to tune the quality of results in the design of a system in order to improve the energy efficiency and/or performance. This radical paradigm shift has attracted interest from both academia and industry. We conduct a two-part survey to cover key aspects (e.g., terminology and applications) and review the state-of-the art approximation techniques.
  arXiv  Detail & Related papers  (2023-07-20T15:54:33Z)
• Adiabatic based Algorithm for SAT: a comprehensive algorithmic description [2.2688530041645856]
  Quantum approximates take advantage of alternation between a Hamiltonian defining the problem to solve and a mixing Hamiltonian. The adiabatic theorem initially defined in quantum physic allows to compute a solution for the Schr"odinger equation.
  arXiv  Detail & Related papers  (2022-07-20T15:42:06Z)
• Advantages and Bottlenecks of Quantum Machine Learning for Remote Sensing [63.69764116066747]
  This concept paper aims to provide a brief outline of quantum computers, explore existing methods of quantum image classification techniques, and discuss the bottlenecks of performing these algorithms on currently available open source platforms. Next steps include expanding the size of the quantum hidden layer and increasing the variety of output image options.
  arXiv  Detail & Related papers  (2021-01-26T09:31:46Z)
• A Review of Uncertainty Quantification in Deep Learning: Techniques, Applications and Challenges [76.20963684020145]
  Uncertainty quantification (UQ) plays a pivotal role in reduction of uncertainties during both optimization and decision making processes. Bizarre approximation and ensemble learning techniques are two most widely-used UQ methods in the literature. This study reviews recent advances in UQ methods used in deep learning and investigates the application of these methods in reinforcement learning.
  arXiv  Detail & Related papers  (2020-11-12T06:41:05Z)
• Quantum Geometric Machine Learning for Quantum Circuits and Control [78.50747042819503]
  We review and extend the application of deep learning to quantum geometric control problems. We demonstrate enhancements in time-optimal control in the context of quantum circuit synthesis problems. Our results are of interest to researchers in quantum control and quantum information theory seeking to combine machine learning and geometric techniques for time-optimal control problems.
  arXiv  Detail & Related papers  (2020-06-19T19:12:14Z)
• Spiking Neural Networks Hardware Implementations and Challenges: a Survey [53.429871539789445]
  Spiking Neural Networks are cognitive algorithms mimicking neuron and synapse operational principles. We present the state of the art of hardware implementations of spiking neural networks. We discuss the strategies employed to leverage the characteristics of these event-driven algorithms at the hardware level.
  arXiv  Detail & Related papers  (2020-05-04T13:24:00Z)

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.