When Quantum Meets Classical: Characterizing Hybrid Quantum-Classical Issues Discussed in Developer Forums

• URL: http://arxiv.org/abs/2411.16884v1
• Date: Mon, 25 Nov 2024 19:32:01 GMT
• Title: When Quantum Meets Classical: Characterizing Hybrid Quantum-Classical Issues Discussed in Developer Forums
• Authors: Jake Zappin, Trevor Stalnaker, Oscar Chaparro, Denys Poshyvanyk,
• Abstract summary: Hybrid quantum-classical computing has emerged as a possible compromise that achieves the best of both worlds. The study comprised a thorough analysis of 531 real-world issues faced by developers of hybrid applications. We conclude by identifying recurring obstacles for developers of hybrid applications and actionable recommendations to overcome them.
• Score: 7.856941186056147
• License:
• Abstract: Recent advances in quantum computing have sparked excitement that this new computing paradigm could solve previously intractable problems. However, due to the faulty nature of current quantum hardware and quantum-intrinsic noise, the full potential of quantum computing is still years away. Hybrid quantum-classical computing has emerged as a possible compromise that achieves the best of both worlds. In this paper, we look at hybrid quantum-classical computing from a software engineering perspective and present the first empirical study focused on characterizing and evaluating recurrent issues faced by developers of hybrid quantum-classical applications. The study comprised a thorough analysis of 531 real-world issues faced by developers -- including software faults, hardware failures, quantum library errors, and developer mistakes -- documented in discussion threads from forums dedicated to quantum computing. By qualitatively analyzing such forum threads, we derive a comprehensive taxonomy of recurring issues in hybrid quantum-classical applications that can be used by both application and platform developers to improve the reliability of hybrid applications. The study considered how these recurring issues manifest and their causes, determining that hybrid applications are crash-dominant (74\% of studied issues) and that errors were predominantly introduced by application developers (70\% of issues). We conclude by identifying recurring obstacles for developers of hybrid applications and actionable recommendations to overcome them.

Related papers

• LatentQGAN: A Hybrid QGAN with Classical Convolutional Autoencoder [7.945302052915863]
  A potential application of quantum machine learning is to harness the power of quantum computers for generating classical data. We propose LatentQGAN, a novel quantum model that uses a hybrid quantum-classical GAN coupled with an autoencoder.
  arXiv  Detail & Related papers  (2024-09-22T23:18:06Z)
• Testing and Debugging Quantum Programs: The Road to 2030 [0.29260385019352086]
  Quantum computing has re-emerged as a promising technology to solve problems that a classical computer could take hundreds of years to solve. This paper presents a roadmap for addressing these challenges, pointing out the existing gaps in the literature and suggesting research directions.
  arXiv  Detail & Related papers  (2024-05-15T08:35:48Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Machine learning on quantum experimental data toward solving quantum many-body problems [0.0]
  We demonstrate the successful implementation of classical machine learning algorithms for systems with up to 44 qubits. We extend the applicability of the hybrid approach to problems of interest in many-body physics.
  arXiv  Detail & Related papers  (2023-10-30T10:25:59Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Hybrid classical-quantum computing: are we forgetting the classical part in the binomial? [0.4972323953932129]
  This work proposes a preliminary taxonomy for classifying hybrid schemes. It brings to the fore some questions to stir up researchers minds about the real challenges regarding the application of quantum computing.
  arXiv  Detail & Related papers  (2023-08-21T06:56:50Z)
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation [5.381727213688375]
  We are still a long way from reaching the maturity of a full-fledged quantum computer. An outstanding challenge is to come up with an application that can reliably carry out a nontrivial task. Several near-term quantum computing techniques have been proposed to characterize and mitigate errors.
  arXiv  Detail & Related papers  (2022-11-16T07:53:15Z)
• 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)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

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.