BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
X-LIC-LOCATION:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20240626T180033Z
LOCATION:3004\, 3rd Floor
DTSTART;TZID=America/Los_Angeles:20240626T110600
DTEND;TZID=America/Los_Angeles:20240626T112400
UID:dac_DAC 2024_sess132_RESEARCH1676@linklings.com
SUMMARY:Design of a Quantum Walk Circuit to Solve the Subset-Sum Problem
DESCRIPTION:Research Manuscript\n\nGiacomo Lancellotti, Simone Perriello, 
 Alessandro Barenghi, and Gerardo Pelosi (Politecnico di Milano)\n\nSearch 
 algorithms based on quantum walks have emerged as a promising approach to 
 solve computational problems across various domains, including combinatori
 al optimization and cryptography. Stating a generic search problem in term
 s of a (quantum) search over a graph makes the efficiency of the algorithm
 ic method depend on the structure of the graph itself. In this work, we pr
 opose a complete implementation of a quantum walk search on Johnson graphs
 , speeding up the solution of the subset-sum problem. We provide a detaile
 d design of each sub-circuit, quantifying their cost in terms of gate numb
 er, depth, and width. We additionally compare our solution against a Grove
 r quantum search approach, showing a reduction of the T-depth cost compare
 d to it. The proposed design provides a building block for the constructio
 n of efficient quantum search algorithms that can be modeled on Johnson gr
 aphs, filling the gap with the existing theoretical complexity analyses.\n
 \nTopic: Design\n\nKeyword: Quantum Computing\n\nSession Chair: Kanad Basu
  (The University of Texas)
END:VEVENT
END:VCALENDAR