BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Denver
X-LIC-LOCATION:America/Denver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0700
TZOFFSETTO:-0600
TZNAME:MDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0600
TZOFFSETTO:-0700
TZNAME:MST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260422T000711Z
LOCATION:603
DTSTART;TZID=America/Denver:20231113T111000
DTEND;TZID=America/Denver:20231113T113000
UID:submissions.supercomputing.org_SC23_sess446_ws_qcs114@linklings.com
SUMMARY:BGLS:  A Python Package for the Gate-by-Gate Sampling Algorithm to
  Simulate Quantum Circuits
DESCRIPTION:Alex Shapiro (Swiss Federal Institute of Technology Lausanne (
 EPFL)) and Ryan LaRose (Michigan State University)\n\nThe classical simula
 tion of quantum computers is in general a computationally hard problem. To
  emulate the behavior of realistic devices, it is sufficient to sample bit
 strings from circuits. Recently, Ref. [ 5] introduced the so-called gate-b
 y-gate sampling algorithm to sample bitstrings and showed it to be computa
 tionally favorable in many cases. Here we present bgls, a Python package w
 hich implements this sampling algorithm. bgls has native support for sever
 al states and is highly flexible for use with additional states.  We show 
 how to install and use bgls, discuss optimizations in the algorithm, and d
 emonstrate its utility on several problems.\n\nTag: Quantum Computing, Sof
 tware Engineering\n\nRegistration Category: Workshop Reg Pass\n\nSession C
 hairs: Yuri Alexeev (NVIDIA Corporation); Bert de Jong (Lawrence Berkeley 
 National Laboratory (LBNL)); Travis Humble (Oak Ridge National Laboratory 
 (ORNL), Quantum Science Centre); Dmitry Liakh (NVIDIA Corporation); Hausi 
 Muller (University of Victoria, British Columbia; IEEE Quantum Week); and 
 Ojas Parekh (Sandia National Laboratories)\n\n
END:VEVENT
END:VCALENDAR