Warm-Starting and Quantum Computing: A Systematic Mapping Study

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.

29 pages, 8 figures, 5 tables, This is the authors' version of the work. It is posted here for your personal use. Not for redistribution. The definitive version was published in ACM Computing Surveys, https://doi.org/10.1145/3652510

References in corpus (20)

• Quantum Computing in the NISQ era and beyond
• Variational Quantum Algorithms
• Transfer learning in hybrid classical-quantum neural networks
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Mitigating measurement errors in multi-qubit experiments
• Layerwise learning for quantum neural networks
• Warm-starting quantum optimization
• The Bitter Truth About Quantum Algorithms in the NISQ Era
• Verification of quantum computation: An overview of existing approaches
• Resource Efficient Zero Noise Extrapolation with Identity Insertions
• Overview and Comparison of Gate Level Quantum Software Platforms
• A quantum-classical cloud platform optimized for variational hybrid algorithms
• On Warm-Starting Neural Network Training
• Mitigating Cold Starts in Serverless Platforms: A Pool-Based Approach
• Investigating the effect of circuit cutting in QAOA for the MaxCut problem on NISQ devices
• Is Fault-Tolerant Quantum Computation Really Possible?
• Quantum subspace alignment for domain adaptation
• Bridging Classical and Quantum with SDP initialized warm-starts for QAOA
• The fixed angle conjecture for QAOA on regular MaxCut graphs
• Efficient Incorporation of Multiple Latency Targets in the Once-For-All Network

Cited by in corpus (9)

• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Architectural Vision for Quantum Computing in the Edge-Cloud Continuum
• Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization
• Quantum Computing and Tensor Networks for Laminate Design: A Novel Approach to Stacking Sequence Retrieval
• Bias-field digitized counterdiabatic quantum optimization
• Exponential Qubit Reduction in Optimization for Financial Transaction Settlement
• Quantum-inspired clustering with light
• A Monte Carlo Tree Search approach to QAOA: finding a needle in the haystack
• Comparing Quantum Service Offerings