activity
20192023
most citedImproved success probability with greater circuit depth for the quantum approximate optimization algorithm

82 citations · 103 across the 5 of their papers we have counts for

collaborators

5 papers

quant-ph2023★ 6 cited

Lecture notes on quantum computing

Anton Frisk Kockum, Ariadna Soro, Laura García-Álvarez +4

These are the lecture notes of the master's course "Quantum Computing", taught at Chalmers University of Technology every fall since 2020, with participation of students from RWTH…

quant-ph2023★ 4 cited

Quantum Approximate Optimization Algorithm with Cat Qubits

Pontus Vikstål, Laura García-Álvarez, Shruti Puri +1

The Quantum Approximate Optimization Algorithm (QAOA) -- one of the leading algorithms for applications on intermediate-scale quantum processors -- is designed to provide approxima…

quant-ph2022★ 9 cited

The Quantum Approximate Optimization Algorithm performance with low entanglement and high circuit depth

Rishi Sreedhar, Pontus Vikstål, Marika Svensson +3

Variational quantum algorithms constitute one of the most widespread methods for using current noisy quantum computers. However, it is unknown if these heuristic algorithms provide…

quant-ph2021★ 2 cited

A Hybrid Quantum-Classical Heuristic to solve large-scale Integer Linear Programs

Marika Svensson, Martin Andersson, Mattias Grönkvist +4

We present a method that integrates any quantum algorithm capable of finding solutions to integer linear programs into the Branch-and-Price algorithm, which is regularly used to so…

quant-ph2019★ 82 cited

Improved success probability with greater circuit depth for the quantum approximate optimization algorithm

Andreas Bengtsson, Pontus Vikstål, Christopher Warren +12

Present-day, noisy, small or intermediate-scale quantum processors---although far from fault-tolerant---support the execution of heuristic quantum algorithms, which might enable a…