BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:An Improved Approximation Algorithm for Quantum Max-Cut - Robbie K
 ing\, California Institute of Technology
DTSTART:20221110T160000Z
DTEND:20221110T170000Z
UID:TALK184265@talks.cam.ac.uk
CONTACT:Sergii Strelchuk
DESCRIPTION:We give an approximation algorithm for Quantum Max-Cut which w
 orks by rounding an\nSDP relaxation to an entangled quantum state. The SDP
  is used to choose the parameters of\na variational quantum circuit. The e
 ntangled state is then represented as the quantum circuit\napplied to a pr
 oduct state. It achieves an approximation ratio of 0.582\, significantly i
 mproving on\nthe algorithms of Anshu\, Gosset\, Morenz\, 0.531\, and Parek
 h\, Thompson\, 0.533. In addition\,\nwe also study the EPR Hamiltonian\, w
 hich we argue is a natural intermediate problem which\nisolates some key q
 uantum features of local Hamiltonian problems. For the EPR Hamiltonian\, w
 e\ngive an approximation algorithm with approximation ratio 1/sqrt(2).\n\n
 Zoom link: https://maths-cam-ac-uk.zoom.us/j/92731536549?pwd=SkhEQThwVFdDY
 0h1RUJkV2JPMWZSUT09
LOCATION:Zoom
END:VEVENT
END:VCALENDAR