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:20240626T180002Z
LOCATION:3004\, 3rd Floor
DTSTART;TZID=America/Los_Angeles:20240626T103000
DTEND;TZID=America/Los_Angeles:20240626T120000
UID:dac_DAC 2024_sess132@linklings.com
SUMMARY:Quantum Real Problem Solver
DESCRIPTION:Research Manuscript\n\nThis session will exemplify application
  of quantum computers and Ising machines to solve various scientific probl
 ems such as geophysical analysis, ground energy estimation of molecules, s
 ubset-sum problem, Boolean pattern matching problem and combinatorial opti
 mization problems.\n\nQuGeo: An End-to-end Quantum Learning Framework for 
 Geoscience --- A Case Study on Full-Waveform Inversion\n\nThe rapid advanc
 ement of quantum computing has generated considerable anticipation for its
  transformative potential. However, harnessing its full potential relies o
 n identifying "killer applications". In this regard, QuGeo emerges as a gr
 oundbreaking quantum learning framework, poised to become a ke...\n\n\nWei
 wen Jiang (George Mason University) and Youzuo Lin (University of North Ca
 rolina, Chapel Hill)\n---------------------\nA High-Performance Stochastic
  Simulated Bifurcation Ising Machine\n\nIsing model-based computers have r
 ecently emerged as high-performance solvers for combinatorial optimization
  problems (COPs). For Ising model, a simulated bifurcation (SB) algorithm 
 searches for the solution by solving pairs of differential equations. The 
 SB machine benefits from massive parallelism...\n\n\nTingting Zhang (Unive
 rsity of Alberta); Hongqiao Zhang, Zhengkun Yu, and Siting Liu (Shanghai T
 ech University); and Jie Han (University of Alberta)\n--------------------
 -\nBoolean Matching Reversible Circuits: Algorithm and Complexity\n\nBoole
 an matching is an important problem in logic synthesis and verification. D
 espite being well-studied for conventional Boolean circuits, its treatment
  for reversible logic circuits remains largely, if not completely, missing
 . This work provides the first such study. Given two (black-box) reversib.
 ..\n\n\nTian-Fu Chen and Jie-Hong Roland Jiang (National Taiwan University
 )\n---------------------\nDesign of a Quantum Walk Circuit to Solve the Su
 bset-Sum Problem\n\nSearch algorithms based on quantum walks have emerged 
 as a promising approach to solve computational problems across various dom
 ains, including combinatorial optimization and cryptography. Stating a gen
 eric search problem in terms of a (quantum) search over a graph makes the 
 efficiency of the algori...\n\n\nGiacomo Lancellotti, Simone Perriello, Al
 essandro Barenghi, and Gerardo Pelosi (Politecnico di Milano)\n-----------
 ----------\nCombining Parameterized Pulses and Contextual Subspace for Mor
 e Practical VQE\n\nWe explore the integration of parameterized quantum pul
 ses with the contextual subspace method. The advent of parameterized quant
 um pulses marks a transition from quantum gates to a more efficient approa
 ch. Working with pulses allows us to potentially access areas of the Hilbe
 rt space that are inacc...\n\n\nZhiding Liang (University of Notre Dame); 
 Zhixin Song (Georgia Institute of Technology); Jinglei Cheng (Purdue Unive
 rsity); Hang Ren (University of California, Berkeley); Tianyi Hao (Univers
 ity of Wisconsin, Madison); Rui Yang (Peking University); Yiyu Shi (Univer
 sity of Notre Dame); and Tongyang Li (Peking University)\n\nTopic: Design\
 n\nKeyword: Quantum Computing\n\nSession Chair: Kanad Basu (The University
  of Texas)
END:VEVENT
END:VCALENDAR