Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond

• URL: http://arxiv.org/abs/2207.06850v1
• Date: Thu, 14 Jul 2022 12:09:19 GMT
• Title: Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
• Authors: Adam Callison and Nicholas Chancellor
• Abstract summary: Hybrid quantum-classical algorithms are central to much of the current research in quantum computing. We discuss in a very broad sense what it means for an algorithm to be hybrid quantum-classical.
• Score: 1.52292571922932
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Hybrid quantum-classical algorithms are central to much of the current research in quantum computing, particularly when considering the noisy intermediate-scale quantum (NISQ) era, with a number of experimental demonstrations having already been performed. In this perspective, we discuss in a very broad sense what it means for an algorithm to be hybrid quantum-classical. We first explore this concept very directly, by building a definition based on previous work in abstraction/representation theory, arguing that what makes an algorithm hybrid is not directly how it is run (or how many classical resources it consumes), but whether classical components are crucial to an underlying model of the computation. We then take a broader view of this question, reviewing a number of hybrid algorithms and discussing what makes them hybrid, as well as the history of how they emerged, and considerations related to hardware. This leads into a natural discussion of what the future holds for these algorithms. To answer this question, we turn to the use of specialized processors in classical computing.The classical trend is not for new technology to completely replace the old, but to augment it. We argue that the evolution of quantum computing is unlikely to be different: hybrid algorithms are likely here to stay well past the NISQ era and even into full fault-tolerance, with the quantum processors augmenting the already powerful classical processors which exist by performing specialized tasks.

Related papers

• An Exponential Separation Between Quantum and Quantum-Inspired Classical Algorithms for Machine Learning [14.955338558971787]
  A provable exponential quantum speedup has been a central research goal since the seminal HHL quantum algorithm for solving linear systems. We present the first such provable exponential separation between quantum and quantum-inspired classical algorithms.
  arXiv  Detail & Related papers  (2024-11-04T13:49:26Z)
• Hybrid Quantum-Classical Machine Learning with String Diagrams [49.1574468325115]
  This paper develops a formal framework for describing hybrid algorithms in terms of string diagrams. A notable feature of our string diagrams is the use of functor boxes, which correspond to a quantum-classical interfaces.
  arXiv  Detail & Related papers  (2024-07-04T06:37:16Z)
• 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)
• Retrieving past quantum features with deep hybrid classical-quantum reservoir computing [1.8434042562191815]
  We introduce deep hybrid classical-quantum reservoir computing for temporal processing of quantum states. We find that the hybrid setup inherits the strengths of both of its constituents but is even more than just the sum of its parts. The quantum layer is within reach of state-of-the-art multimode quantum optical platforms while the classical layer can be implemented in silico.
  arXiv  Detail & Related papers  (2024-01-30T12:41:24Z)
• 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)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Classification of Hybrid Quantum-Classical Computing [0.0]
  We define two classes of hybrid quantum-classical computing: vertical and horizontal. The first is application-agnostic and concerns using quantum computers. The second is application-specific and concerns running an algorithm.
  arXiv  Detail & Related papers  (2022-10-27T10:52:37Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Retrodictive Quantum Computing [0.6445605125467572]
  We show how to exploit retrodictive quantum computing at scale. We solve instances of the quantum Deutsch-Jozsa, Bernstein-Vazirani, Simon, Grover, and Shor's algorithms.
  arXiv  Detail & Related papers  (2022-05-12T20:12:41Z)
• Quantum Computing without Quantum Computers: Database Search and Data Processing Using Classical Wave Superposition [101.18253437732933]
  We present experimental data on magnetic database search using spin wave superposition. We argue that in some cases the classical wave-based approach may provide the same speedup in database search as quantum computers.
  arXiv  Detail & Related papers  (2020-12-15T16:21:53Z)

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.