BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260422T143034Z
LOCATION:B312-B313A
DTSTART;TZID=America/New_York:20241121T103000
DTEND;TZID=America/New_York:20241121T120000
UID:submissions.supercomputing.org_SC24_sess386@linklings.com
SUMMARY:Quantum and Approximate Computing III
DESCRIPTION:Realizing Quantum Kernel Models at Scale with Matrix Product S
 tate Simulation\n\nData representation in quantum state space offers an al
 ternative function space for machine learning tasks. However, benchmarking
  these algorithms at a practical scale has been limited by ineffective sim
 ulation methods. We develop a quantum kernel framework using a Matrix Prod
 uct State (MPS) simulat...\n\n\nMekena Metcalf (HSBC Holdings Plc.) and Pa
 blo Andres-Martinez and Nathan Fitzpatrick (Quantinuum)\n-----------------
 ----\nAtlas: Hierarchical Partitioning for Quantum Circuit Simulation on G
 PUs\n\nThis paper presents techniques for theoretically and practically ef
 ficient and scalable Schrödinger-style quantum circuit simulation. Our app
 roach partitions a quantum circuit into a hierarchy of subcircuits and sim
 ulates the subcircuits on multi-node GPUs, exploiting available data paral
 lelism whil...\n\n\nMingkuan Xu (Carnegie Mellon University); Shiyi Cao (U
 niversity of California, Berkeley); and Xupeng Miao, Umut A. Acar, and Zhi
 hao Jia (Carnegie Mellon University)\n---------------------\nSurpassing Sy
 camore: Achieving Energetic Superiority Through System-Level Circuit  Simu
 lation\n\nQuantum Computational Superiority boasts rapid computation and h
 igh-energy efficiency. Despite recent advances in classical algorithms aim
 ed at refuting the milestone claim of Google's Sycamore, challenges remain
  in generating uncorrelated samples of random quantum circuits.\nIn this p
 aper, we presen...\n\n\nRong Fu, Zhongling Su, Han-Sen Zhong, Xiti Zhao, a
 nd Jianyang Zhang (Shanghai Artificial Intelligence Laboratory); Feng Pan 
 (Shanghai Research Center for Quantum Science and CAS Center for Excellenc
 e in Quantum Information and Quantum Physics, University of Science and Te
 chnology of China); Pan Zhang (CAS Key Laboratory for Theoretical Physics,
  Institute of Theoretical Physics, Chinese Academy of Sciences); Xianhe Zh
 ao, Ming-Cheng Chen, Chao-Yang Lu, and Jian-Wei Pan (Hefei National Resear
 ch Center for Physical Sciences at the Microscale and School of Physical S
 ciences, University of Science and Technology of China; Shanghai Research 
 Center for Quantum Science and CAS Center for Excellence in Quantum Inform
 ation and Quantum Physics, University of Science and Technology of China);
  and Zhilin Pei, Xingcheng Zhang, and Wanli Ouyang (Shanghai Artificial In
 telligence Laboratory)\n\nTag: Post-Moore Computing, Quantum Computing\n\n
 Registration Category: Tech Program Reg Pass\n\nSession Chair: Tirthak Pat
 el (Rice University)
END:VEVENT
END:VCALENDAR