causes an enormous amount of research output1and, resulting,
survey papers. One example of this kind is [7], where a
survey of NISQ era hybrid quantum-classical machine learning
research on hybrid quantum-classical systems is given, without
explaining what is meant by hybrid quantum-classical exactly.
This is totally left to the reader. Our goal is to provide a
classification framework where authors can refer to, to make
the scope of their contribution more clear to the reader. For
this, we connect quantum research with classical computer
science and workflow terminology. So, many of the proposed
terminology in this paper exists already in computer sci-
ence, think of compilation between computer languages, and
workflow research, think of decomposition and activities. Our
contribution is bringing them together in a clear framework
for hybrid quantum-classical computing.
In this contribution we aim to describe clearly the various
contexts hybrid quantum-classical computing can have in
literature and to name these different approaches clearly and
appropriately. In Section II we give an overview of various
forms of hybrid quantum-classical computing that can be
found in literature. Next, in Section III, we distinguish a num-
ber of different types of hybrid quantum-classical computing
from this overview and provide examples for each type. We
end this paper with some conclusions and ideas for further
research.
II. LITERATURE
We consider a global situation where we have a collection
of computational tasks in which both the quantum computer
and the classical computer are used. As such, hybrid forms of
computing that allow for both discrete and continuous vari-
ables [8] and hybrid quantum-classical models of molecules
in chemical and biological studies [9] are out of scope. We
do not try to give an exhaustive overview of all research done
on this topic. Our goal here is to give an overview, based on
some examples, of the various meanings of the term hybrid
quantum-classical computing in literature. This overview will
be the basis of the proposed classification later on in this work.
Lanzagorta and Uhlmann presented one of the first hybrid
algorithms that used both classical and quantum computers [5].
Later, research appeared on computing schemes and architec-
tures to optimise the interactions between the different type
of computers when executing hybrid quantum algorithms. A
first example presents a candidate framework to analyse hybrid
computations by fully integrating the quantum and classical
resources and processes used for measurement-based quantum
computing, where the feed-forward of classical measurement
results is an integral part of the quantum design [10], [11]. A
second example proposes a quantum co-processor to accelerate
a specific subroutine of a larger task. This is most often seen
as the main reason for hybrid algorithms, for example in [12]–
[15]. The work by Li et al. [14] results in a system-level soft-
ware infrastructure for hybrid quantum–classical computing.
1Google scholar already gives 2090 results for the search on ’hybrid
quantum-classical computing’ for the period January-October 2022.
Endo [16], [17] indicates that for early quantum applications,
a large portion of the computational burden is performed on
a classical computer and hence fully coherent deep quantum
circuits are not required. As the quantum computer takes on
more computational load, noise of the quantum computer will
result in more errors, which will have more impact on the total
calculation. This in turn requires qubits of higher quality and
error mitigation routines to suppress noise.
An important type of hybrid computing appeared with
the introduction of Variational Quantum Algorithms (VQA).
VQAs use a classical optimiser to train a parameterised quan-
tum circuit and provide a framework to tackle a wide array of
tasks, as shown in the extensive overview by Cerezo et al. [18].
Examples include finding ground states and excited states of
molecules, optimisation, solving linear systems of equations
and machine learning. The first VQA, the variational quantum
eigensolver (VQE) algorithm of [19], appeared in 2014. Some
papers see this group of algorithms as “a novel class of hybrid
quantum-classical algorithms”, without explicitly diving in
other groups of algorithms [20]. Also, [21] sees this class of
algorithms as a specific example of hybrid quantum-classical
computing in a noisy environment. In [22] the main reason
given for hybrid quantum-classical computing is the size of
the problems in combination with the available hardware. They
distinguishes two types of hybrid computing: 1) Pre- or post-
processing of a quantum computation on a classical computer.
Examples are algorithms by Shor [23] and Simon [24] that use
classical post-processing. 2) Algorithms that perform multiple
iterations of quantum and classical computations. Thereby, the
output of the quantum computation is improved in each itera-
tion until the result reaches the required accuracy. An example
they give using this approach is the quantum approximate
optimisation algorithm (QAOA) [25].
In the works [20], [26], the term ‘quassical’ computing is
coined and motivated by “Classical computing and quantum
computing have obvious complementary strengths, so instead
of opposing them it might be better to combine them into
a new type of computing.” They give two reasons for the
combination: First, most quantum computing algorithms “re-
quire some preliminary classical pre-processing to shape the
problem into one the quantum computer can recognise and
then to receive the data returned by the [quantum computer]
and shape it into the answer the engineer needs.” Second,
“all the quantum computers we have heard of are designed
as cyber-physical systems, quantum mechanical systems con-
trolled by digital controllers”, meaning they are quassical in a
trivial sense. In this light, you can also think of the classical
steps needed to transform a quantum circuit to an execution
as performed for example by an openQL framework [27].
They expect that this combination will stay, also when the
quantum computer is in full maturity. The first remark is also
mentioned by [28], who indicate that “while hybrid algorithms
and platforms may just be the best first step, it is reasonable to
assume that quantum applications will always be hybrid”, for
example, by the need of a pre-processing step which prepares
data for a quantum algorithm or a post-processing step which