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:20220715T000513Z
LOCATION:3005\, Level 3
DTSTART;TZID=America/Los_Angeles:20220713T103000
DTEND;TZID=America/Los_Angeles:20220713T120000
UID:dac_DAC 2022_sess152@linklings.com
SUMMARY:Robust Quantum Computing: Wild Goose Chase?
DESCRIPTION:Research Manuscript\n\nIn this session, we have 4 papers cover
ing various aspects of robust quantum computing flow. There are two presen
tations that address scalable verification approaches by equivalence check
ing and BDD-based unitary operator manipulation, respectively. Another pap
er presents the case of handling non-unitaries in equivalence checking of
quantum circuits. The last paper of the session proposes a compression tec
hnique for reducing resource requirements for topological quantum error co
rrection circuits.\n\nA Bridge-based Algorithm for Simultaneous Primal and
Dual Defects Compression on Topologically Quantum-error-corrected Circuit
s\n\nTseng, Chang\n\nThe required resource of a topological quantum error
correction (TQEC) circuit can be modeled as a space-time volume by describ
ing the defect movement along the time axis. It is crucial to minimize the
space-time volume with a reasonable physical qubit number and computation
time. Existing automated...\n\n---------------------\nAccurate BDD-based
Unitary Operator Manipulation for Scalable and Robust Quantum Circuit Veri
fication\n\nWei, Tsai, Jhang, Jiang\n\nQuantum circuit verification is ess
ential, ensuring that quantum program compilation yields a sequence of pri
mitive unitary operators executable correctly and reliably on a quantum pr
ocessor. Most prior quantum circuit equivalence checking methods rely on e
dge-weighted decision diagrams and suffer f...\n\n---------------------\nH
andling Non-Unitaries in Quantum Circuit Equivalence Checking\n\nBurgholze
r, Wille\n\nQuantum computers are reaching a level where interactions betw
een classical and quantum computations can happen in real-time. This marks
the advent of dynamic quantum circuits. They offer a broader range of ava
ilable computing primitives that lead to new challenges for simulation, co
mpilation, and v...\n\n---------------------\nEquivalence Checking Paradig
ms in Quantum Circuit Design: A Case Study\n\nPeham, Burgholzer, Wille\n\n
As state-of-the-art quantum computers are capable of running increasingly
complex algorithms, the need for automated\nmethods to design and test pot
ential applications rises. Equivalence checking of quantum circuits is an
important, yet\nhardly automated, task in the development of the quantum s
oftwar...\n\n\nTopic: Design\n\nKeyword: Quantum Computing
END:VEVENT
END:VCALENDAR