Raul Garcia Patron (University of Edinburgh): Limitations of optimization algorithms on noisy quantum devices
Team-Net Quantum Computing Colloquium
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), https://arxiv.org/abs/2009.05532
Other seminars
Giulio Chiribella (University of Hong Kong): Optimal programming of quantum gates - Duplicate27-06-2022
Marco Tomamichel (National University of Singapore): Quantum advantage with noisy shallow circuits17-05-2022
Marcel Hinsche (FU Berlin): Learnability of the output distributions of local quantum circuits25.05.2022
Julio de Vicente: Genuine multipartite entanglement and nonlocality in pair-entangled network states20.04.2022
Beata Zjawin (ICTQT): Inequality Constraints in Directed Acyclic Graphs with Hidden Variables02.02.2022
Laura Mancinska (QMATH, Copenhagen): Fixed-size schemes for certification of large quantum systems17-11-2021
Yelena Guyanova (IQOQI, Vienna): Ideal Projective Measurements Have Infinite Resource Costs10-11-2021
Hamed Mohammady (ULdB): Measurement disturbance and conservation laws in quantum mechanics03-11-2021
Contact
Aleja Lotników 32/46
02-668 Warszawa
Poland
Phone: +48 22 847 09 20
Email: nisq@cft.edu.pl
© 2021 Near-term Quantum Computers Project