BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Australia/Melbourne
X-LIC-LOCATION:Australia/Melbourne
BEGIN:DAYLIGHT
TZOFFSETFROM:+1000
TZOFFSETTO:+1100
TZNAME:AEDT
DTSTART:19721003T020000
RRULE:FREQ=YEARLY;BYMONTH=4;BYDAY=1SU
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:19721003T020000
TZOFFSETFROM:+1100
TZOFFSETTO:+1000
TZNAME:AEST
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20240214T070250Z
LOCATION:Meeting Room C4.11\, Level 4 (Convention Centre)
DTSTART;TZID=Australia/Melbourne:20231215T115500
DTEND;TZID=Australia/Melbourne:20231215T120500
UID:siggraphasia_SIGGRAPH Asia 2023_sess136_papers_281@linklings.com
SUMMARY:Quantum Ray Marching for Reformulating Light Transport Simulation
DESCRIPTION:Technical Papers\n\nLogan Mosier (University of Waterloo); Mor
 gan McGuire (Roblox, University of Waterloo); and Toshiya Hachisuka (Unive
 rsity of Waterloo)\n\nThe use of quantum computers in computer graphics ha
 s gained interest in recent years, especially for the application to rende
 ring. The current state of the art in quantum rendering relies on Grover's
  search for finding ray intersections in $O(\sqrt{M})$ for $M$ primitives.
  This quantum approach is faster than the naive approach of $O(M)$ but slo
 wer than $O(\log M)$ of modern ray tracing with an acceleration data struc
 ture. Furthermore, this quantum ray tracing method is fundamentally limite
 d to casting one ray at a time, leaving quantum rendering scales for the n
 umber of rays the same as non-quantum algorithms. We present a new quantum
  rendering method, quantum ray marching, based on the reformulation of ray
  marching as a quantum random walk. Our work is the first complete quantum
  rendering pipeline capable of light transport simulation and remains asym
 ptotically faster than non-quantum counterparts. Our quantum ray marching 
 can trace an exponential number of paths with polynomial cost, and it leve
 rages quantum numerical integration to converge in $O(1/N)$ for $N$ estima
 tes as opposed to non-quantum $O(1/\sqrt{N})$. These properties led to fir
 st quantum rendering that is asymptotically faster than non-quantum Monte 
 Carlo rendering. We numerically tested our algorithm by rendering 2D and 3
 D scenes.\n\nRegistration Category: Full Access\n\nSession Chair: Bo Ren (
 TMCC, Nankai University)
URL:https://asia.siggraph.org/2023/full-program?id=papers_281&sess=sess136
END:VEVENT
END:VCALENDAR