BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20181221T160906Z
LOCATION:C156
DTSTART;TZID=America/Chicago:20181112T083000
DTEND;TZID=America/Chicago:20181112T170000
UID:submissions.supercomputing.org_SC18_sess258_tut133@linklings.com
SUMMARY:Quantum Computing for Scientific Applications
DESCRIPTION:Tutorial\nProgramming Systems, Quantum Computing, Tools, Tutor
 ial Reg Pass\n\nQuantum Computing for Scientific Applications\n\nIancu, de
  Jong, Lougovski, Parekh, McClean...\n\nQuantum computing is an emerging t
 echnology which promises to revolutionize many computational tasks. Howeve
 r, for a non-specialist it may appear that it is surrounded by a shroud of
  hype and misconception. The main goal of this tutorial is to de-mystify p
 ractical quantum computing and all its vital algorithmic aspects to a gene
 ral audience of computer scientists with little to none prior knowledge of
  the subject. We plan to achieve this through a combination of lecture mat
 erials, demonstrations, and hands on exercises delivered by quantum comput
 ing experts with extensive experience of public speaking and teaching from
  the government research laboratories (DOE, NASA), industry (IBM, Google, 
 Rigetti), and academia. In particular, we aim to elucidate quantum computi
 ng use for scientific applications, covering the following areas: 1) quant
 um algorithm design; 2) quantum programming toolkits; and 3) practical err
 or mitigation for quantum algorithms. We will focus on the design and impl
 ementation of hybrid quantum-classical computational strategies including 
 variational quantum eigensolver (VQE) and quantum approximate optimization
  algorithms in the context of quantum chemistry, nuclear structure, and qu
 antum field theory problems. We will discuss multiple practical ways to mi
 tigate systematic coherent errors in the nascent quantum hardware, includi
 ng general techniques such as randomized compilation.
URL:https://sc18.supercomputing.org/presentation/?id=tut133&sess=sess258
END:VEVENT
END:VCALENDAR

