BEGIN:VCALENDAR
CALSCALE:GREGORIAN
VERSION:2.0
METHOD:PUBLISH
PRODID:-//Drupal iCal API//EN
X-WR-TIMEZONE:America/New_York
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
DTSTART:20070311T020000
TZNAME:EDT
TZOFFSETTO:-0400
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
DTSTART:20071104T020000
TZNAME:EST
TZOFFSETTO:-0500
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SEQUENCE:1
X-APPLE-TRAVEL-ADVISORY-BEHAVIOR:AUTOMATIC
235151
20260423T150509Z
DTSTART;TZID=America/New_York:20260428T140000
DTEND;TZID=America/New_York:2
 0260428T150000
URL;TYPE=URI:https://www.wpi.edu/news/calendar/events/compu
 ter-science-department-ms-thesis-presentation-amulya-mohan-discrete-quantu
 m-walks-marked
Computer Science Department , MS Thesis Presentation , Amulya Mohan "  Discrete Quantum Walks with Marked Vertices and Their Average Vertex Mixing Matrices"
Amulya Mohan\nMS/PhD student\nWPI – Computer Science Department\nTuesday, April 28th, 2026\nTime:
  2:00 PM to 3:00 PM\nLocation: Fuller Labs 141\n\nAdvisor: Hanmeng Zhan\nR
 eader: Bahman Moraffah\nAbstract:\nWe study the discrete quantum walk on r
 egular graphs that assigns negative identity coins to marked vertices and 
 Grover coins to unmarked ones. We find combinatorial bases for the eigensp
 aces of the transtion matrix, and derive a formula for the average vertex 
 mixing matrix M̂.\nWe then find bounds for entries in M̂, and study when
  these bounds are tight.\nIn particular, the average probabilities between
  marked vertices are lower and upper bounded by matrices determined by the
  induced subgraph A(X)[S], the vertex-deleted subgraph A(X)[S], and the ed
 ge deleted subgraph A(X-E(X)). These bounds are tight when the neighborhoo
 ds of marked\nvertices satisfy the walk-equitability condition.\n
END:VEVENT
END:VCALENDAR