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:20250822T115805Z
LOCATION:Room 5.2D02
DTSTART;TZID=Europe/Stockholm:20250616T125000
DTEND;TZID=Europe/Stockholm:20250616T132000
UID:submissions.pasc-conference.org_PASC25_sess123_msa152@linklings.com
SUMMARY:Comparing Performance of Variational Quantum Algorithm Simulations
  on HPC Systems
DESCRIPTION:Luigi Iapichino, De Pascale Marco, Tobias Valentin Bauer, Yakn
 an John Gambo, Mario Hernández Vera, Stefan Huber, and Burak Mete (Leibniz
  Supercomputing Centre); Amit Jamadagni Gangapuram (Leibniz Supercomputing
  Centre, current address: ORNL); and Amine Bentellis, Marita Oliv, and Jea
 nette Miriam Lorenz (Fraunhofer Institute for Cognitive Systems IKS)\n\nTh
 e variational quantum algorithms have a special importance in the research
  on quantum computing applications, for their applicability on current noi
 sy intermediate-scale quantum (NISQ) devices. The main building blocks of 
 these algorithms (e.g., the definition of the Hamiltonian and of the ansat
 z, the parameter optimization) define a relatively large parameter space, 
 making the comparison of results and performance between different softwar
 e simulators cumbersome and prone to errors. In this work, we employ a gen
 eric description of the problem, in terms of both Hamiltonian and ansatz t
 o port a problem definition consistently among different simulators. Three
  use cases of relevance for current quantum hardware (ground state calcula
 tion for H_2 molecule, MaxCut, Travelling Salesman Problem) have been run 
 on a set of HPC systems (shared-memory, multi-node, GPU-accelerated). The 
 results show that, for some of the most used QC simulation packages, simpl
 e variational workloads present performance and scaling challenges. The pr
 esented parser allows a fair comparison of the performance while ensuring 
 that problem definition and physical results stay consistent.\n\nDomain: C
 hemistry and Materials, Engineering, Physics, Computational Methods and Ap
 plied Mathematics\n\nSession Chair: Alfio Lazzaro (HPE)\n\n
END:VEVENT
END:VCALENDAR