BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Europe/Stockholm
X-LIC-LOCATION:Europe/Stockholm
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20191206T142522Z
LOCATION:Panorama 1
DTSTART;TZID=Europe/Stockholm:20180627T110000
DTEND;TZID=Europe/Stockholm:20180627T123000
UID:isc_hpc_ISC High Performance 2018_sess172@linklings.com
SUMMARY:Quantum Computing Applications
DESCRIPTION:Focus Session\n\nNowadays, various types of quantum computing 
 devices with largely varying numbers of qubits are available for pioneer u
 sers. These pioneers have cloud-based access to several gate-based quantum
  computers (IBM, Google, Riggetti Computing, Alibaba, …) with up to 20 qub
 its and to a quantum annealer of D-Wave Systems with more than 2000 qubits
 , the latter system also being available for purchase.\n\nApart from acade
 mic interest in quantum computing to simulate quantum many-body systems in
  physics, materials science and chemistry there is also interest shown by 
 aerospace, automotive, oil and gas, financial, chemical and pharmaceutical
  industries in this new computing platform. For these industries, among ot
 hers, fault tree analysis, risk mitigation, optimization, scheduling, and 
 machine learning play an important role. \n\nIn this session, apart from a
 n introduction to the difference between programming a gate-based quantum 
 computer and a quantum annealer, prototype applications of these new compu
 ting technologies in science and industry will be discussed.\n\nFlight Gat
 e Assignment with a Quantum Annealer\n\nLobe\n\nWe report on our efforts t
 o solve a problem from airport planning with a D-Wave quantum annealer. Th
 e flight gate assignment is related to the quadratic assignment problem th
 at is known to be a very hard combinatorial optimization problem. We prese
 nt a detailed analysis of the problem and compare qu...\n\n---------------
 ------\nMaterial Simulation on current Quantum Computers\n\nStreif\n\nSimu
 lating electronic properties of molecules is an important task for differe
 nt areas of both research\nand industry. Due to the exponential scaling of
  the problem space, solving such problems exactly\nbecomes rapidly unfeasi
 ble on classical computers. As electronic structure problems are quantum\n
 mec...\n\n---------------------\nThe Difference between Programming a Gate
 -Based Quantum Computer and a Quantum Annealer\n\nMichielsen\n\nA gate-bas
 ed quantum computer is the quantum equivalent of the classical circuit-mod
 el computer. It works with qubits, the quantum equivalent of bits, on whic
 h sequences of quantum circuit operations (gates) are performed. These gat
 e sequences are so-called quantum algorithms that can be designed to...\n\
 n---------------------\nLeveraging Adiabatic Quantum Computation for Elect
 ion Forecasting\n\nHenderson\n\nAccurate, reliable sampling from fully-con
 nected graphs with arbitrary correlations is a difficult problem. Such sam
 pling requires knowledge of the probabilities of observing every possible 
 state of a graph. As graph size grows, the number of model states becomes 
 intractably large and efficient comp...\n\n\nPasses: Conference Pass
END:VEVENT
END:VCALENDAR