% IMPORTANT: The following is UTF-8 encoded. This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.
@INPROCEEDINGS{Lagemann:906575,
author = {Lagemann, Hannes},
title = {{R}eal-time simulations of the quantum approximate
optimisation algorithm with a circuit {H}amiltonian model},
reportid = {FZJ-2022-01526},
year = {2022},
abstract = {The quantum approximate optimisation algorithm (or QAOA) is
a variational algorithm. The algorithm consists of two
parts. A quantum step which evaluates a cost function and a
classical step which performs the optimisation. The hope is
that the classical optimisation step can mitigate errors
which appear in state-of-the-art quantum processors.We
investigate this idea by simulating the time evolution of
superconducting quantum processors with two and three
qubits. The model which generates the dynamics of the system
is a lumped-element circuit Hamiltonian model. We find that
in this model the classical optimisation step can mitigate
some of the gate errors which are caused by imperfect
two-qubit gates.},
month = {Jan},
date = {2022-01-18},
organization = {Jülich Quantum Computing Seminar,
Online (Germany), 18 Jan 2022 - 18 Jan
2022},
subtyp = {Other},
cin = {JSC},
cid = {I:(DE-Juel1)JSC-20090406},
pnm = {5111 - Domain-Specific Simulation $\&$ Data Life Cycle Labs
(SDLs) and Research Groups (POF4-511) / OpenSuperQ - An Open
Superconducting Quantum Computer (820363) / PhD no Grant -
Doktorand ohne besondere Förderung (PHD-NO-GRANT-20170405)},
pid = {G:(DE-HGF)POF4-5111 / G:(EU-Grant)820363 /
G:(DE-Juel1)PHD-NO-GRANT-20170405},
typ = {PUB:(DE-HGF)31},
url = {https://juser.fz-juelich.de/record/906575},
}