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:20230124T171519Z
LOCATION:C140-142
DTSTART;TZID=America/Chicago:20221113T142000
DTEND;TZID=America/Chicago:20221113T144000
UID:submissions.supercomputing.org_SC22_sess423_ws_qcs120@linklings.com
SUMMARY:A Q# Implementation of a Quantum Lookup Table for Quantum Arithmet
 ic Functions
DESCRIPTION:Workshop\n\nA Q# Implementation of a Quantum Lookup Table for 
 Quantum Arithmetic Functions\n\nKrishnakumar, Soeken, Roetteler, Zeng\n\nW
 e present Q# implementations for arbitrary fixed-point arithmetic operatio
 ns for a gate-based quantum computer based on lookup tables (LUT). In gene
 ral, this is an inefficient way of implementing a function since the numbe
 r of inputs can be large or even infinite. However, if the input domain ca
 n be bounded and there can be some error tolerance in the output (both of 
 which are often the case in practical use-cases), the quantum LUT implemen
 tation of certain quantum arithmetic functions can be more efficient than 
 their corresponding reversible arithmetic implementations. We discuss the 
 implementation of the LUT using Q#, show examples of how to use the LUT to
  implement quantum arithmetic functions, and compare the resources require
 d for the implementation with the current state-of-the-art bespoke impleme
 ntations of exponential and Gaussian functions.\n\nSession Format: Recorde
 d\n\nTag: Quantum Computing\n\nRegistration Category: Workshop Reg Pass
END:VEVENT
END:VCALENDAR