21.Classical optimization: MaxCut problem

preview_player
Показать описание
Рекомендации по теме
Комментарии
Автор

Can't thank you enough! This is an excellent introduction to the quantum mechanical equivalent to the MaxCut problem.

prathamhullamballi
Автор

I wish I would have seen this explanation of the mapping years ago. Thank you for your insightful instruction : )✅

eatyourspinachtomperez
Автор

Its a very awesome explanation of MaxCut and how its mapped to the Hamiltonian. Thank you for this explanation. Hope you could create a video on explaining how QAOA works and solves this problem.

suvarnadhiraj
Автор

Very well explained, Thank you professor

AbhishekKumar-osbe
Автор

Hi Professor, a random CS person passing here. Absolutely no background on Quantum computing. This sounds like a quantum version of Goemans-williamson SDP relaxation in classical computing (Relaxing z from {-1, 1} to S^n/ or multiple qubits). Does it beat this bound?

PaPa-kryt