TY  - CONF
AU  - Lagemann, Hannes
TI  - Real-time simulations of the quantum approximate optimisation algorithm with a circuit Hamiltonian model
M1  - FZJ-2022-01526
PY  - 2022
AB  - 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.
T2  - Jülich Quantum Computing Seminar
CY  - 18 Jan 2022 - 18 Jan 2022, Online (Germany)
Y2  - 18 Jan 2022 - 18 Jan 2022
M2  - Online, Germany
LB  - PUB:(DE-HGF)31
UR  - https://juser.fz-juelich.de/record/906575
ER  -