Limitations of optimization algorithms on noisy quantum devices



University of Edinburgh

March 2, 2022 4:00 PM

Whether current and next generation quantum computers solve relevant problems that are unachievable to our traditional devices remains an open question. A central question is whether the imperfections present in quantum computers can be overcome or it fundamentally restricts quantum computers. In this talk, I will present a way of comparing classical algorithms to quantum ones running on near-term quantum devices for a large family of problems that consist of minimizing a cost function, such as in optimization problems. I will then discuss the capability of current and next-generations quantum computer to solve relevant optimization problems.

The talk will be based on joint work with Daniel Stilck Franca
Reference:  Nature Physics 17, 1221–1227 (2021),

The purpose of the Team-Net Quantum Computing Colloquium series is to expose Polish and international researchers, as well as interested peers, to the most important recent achievements and trends in the field of quantum computing. Seminars will be taking place on a monthly basis, on Wednesdays at 16:00 CET. Topics of the colloquium include, but are not limited to:

  • Near-term quantum algorithms
  • Quantum supremacy experiments
  • Resource-theoretic approaches to quantum computing
  • Quantum machine learning
  • Practical quantum error correction and error mitigation
  • Mathematical aspects of quantum computing and many-body physics

Webpage of the project:

Kind regards,

Susane Calegari

Felix Huber
Kamil Korzekwa

Marek Kuś
Michał Oszmaniec
Zbigniew Puchała
Karol Życzkowski

Zoom meeting details

Topic: Quantum Computing Colloquium
Time: Wednesday, 02.03.2022, 16:00 Warsaw (CET)

Join Zoom Meeting

Meeting ID: 830 8179 4965
Passcode: Qcomputing

If you encounter any problems with connecting to the Zoom meeting, please email