BEGIN:VCALENDAR
PRODID:BedeWork V3.5
VERSION:2.0
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
BEGIN:STANDARD
TZOFFSETFROM:-045602
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:18831118T120358
RDATE:18831118T120358
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19180331T020000
RDATE:19180331T020000
RDATE:19190330T020000
RDATE:19200328T020000
RDATE:19210424T020000
RDATE:19220430T020000
RDATE:19230429T020000
RDATE:19240427T020000
RDATE:19250426T020000
RDATE:19260425T020000
RDATE:19270424T020000
RDATE:19280429T020000
RDATE:19290428T020000
RDATE:19300427T020000
RDATE:19310426T020000
RDATE:19320424T020000
RDATE:19330430T020000
RDATE:19340429T020000
RDATE:19350428T020000
RDATE:19360426T020000
RDATE:19370425T020000
RDATE:19380424T020000
RDATE:19390430T020000
RDATE:19400428T020000
RDATE:19410427T020000
RDATE:19460428T020000
RDATE:19470427T020000
RDATE:19480425T020000
RDATE:19490424T020000
RDATE:19500430T020000
RDATE:19510429T020000
RDATE:19520427T020000
RDATE:19530426T020000
RDATE:19540425T020000
RDATE:19550424T020000
RDATE:19560429T020000
RDATE:19570428T020000
RDATE:19580427T020000
RDATE:19590426T020000
RDATE:19600424T020000
RDATE:19610430T020000
RDATE:19620429T020000
RDATE:19630428T020000
RDATE:19640426T020000
RDATE:19650425T020000
RDATE:19660424T020000
RDATE:19670430T020000
RDATE:19680428T020000
RDATE:19690427T020000
RDATE:19700426T020000
RDATE:19710425T020000
RDATE:19720430T020000
RDATE:19730429T020000
RDATE:19740106T020000
RDATE:19750223T020000
RDATE:19760425T020000
RDATE:19770424T020000
RDATE:19780430T020000
RDATE:19790429T020000
RDATE:19800427T020000
RDATE:19810426T020000
RDATE:19820425T020000
RDATE:19830424T020000
RDATE:19840429T020000
RDATE:19850428T020000
RDATE:19860427T020000
RDATE:19870405T020000
RDATE:19880403T020000
RDATE:19890402T020000
RDATE:19900401T020000
RDATE:19910407T020000
RDATE:19920405T020000
RDATE:19930404T020000
RDATE:19940403T020000
RDATE:19950402T020000
RDATE:19960407T020000
RDATE:19970406T020000
RDATE:19980405T020000
RDATE:19990404T020000
RDATE:20000402T020000
RDATE:20010401T020000
RDATE:20020407T020000
RDATE:20030406T020000
RDATE:20040404T020000
RDATE:20050403T020000
RDATE:20060402T020000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19181027T020000
RDATE:19181027T020000
RDATE:19191026T020000
RDATE:19201031T020000
RDATE:19210925T020000
RDATE:19220924T020000
RDATE:19230930T020000
RDATE:19240928T020000
RDATE:19250927T020000
RDATE:19260926T020000
RDATE:19270925T020000
RDATE:19280930T020000
RDATE:19290929T020000
RDATE:19300928T020000
RDATE:19310927T020000
RDATE:19320925T020000
RDATE:19330924T020000
RDATE:19340930T020000
RDATE:19350929T020000
RDATE:19360927T020000
RDATE:19370926T020000
RDATE:19380925T020000
RDATE:19390924T020000
RDATE:19400929T020000
RDATE:19410928T020000
RDATE:19450930T020000
RDATE:19460929T020000
RDATE:19470928T020000
RDATE:19480926T020000
RDATE:19490925T020000
RDATE:19500924T020000
RDATE:19510930T020000
RDATE:19520928T020000
RDATE:19530927T020000
RDATE:19540926T020000
RDATE:19551030T020000
RDATE:19561028T020000
RDATE:19571027T020000
RDATE:19581026T020000
RDATE:19591025T020000
RDATE:19601030T020000
RDATE:19611029T020000
RDATE:19621028T020000
RDATE:19631027T020000
RDATE:19641025T020000
RDATE:19651031T020000
RDATE:19661030T020000
RDATE:19671029T020000
RDATE:19681027T020000
RDATE:19691026T020000
RDATE:19701025T020000
RDATE:19711031T020000
RDATE:19721029T020000
RDATE:19731028T020000
RDATE:19741027T020000
RDATE:19751026T020000
RDATE:19761031T020000
RDATE:19771030T020000
RDATE:19781029T020000
RDATE:19791028T020000
RDATE:19801026T020000
RDATE:19811025T020000
RDATE:19821031T020000
RDATE:19831030T020000
RDATE:19841028T020000
RDATE:19851027T020000
RDATE:19861026T020000
RDATE:19871025T020000
RDATE:19881030T020000
RDATE:19891029T020000
RDATE:19901028T020000
RDATE:19911027T020000
RDATE:19921025T020000
RDATE:19931031T020000
RDATE:19941030T020000
RDATE:19951029T020000
RDATE:19961027T020000
RDATE:19971026T020000
RDATE:19981025T020000
RDATE:19991031T020000
RDATE:20001029T020000
RDATE:20011028T020000
RDATE:20021027T020000
RDATE:20031026T020000
RDATE:20041031T020000
RDATE:20051030T020000
RDATE:20061029T020000
END:STANDARD
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19200101T000000
RDATE:19200101T000000
RDATE:19420101T000000
RDATE:19460101T000000
RDATE:19670101T000000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EWT
DTSTART:19420209T020000
RDATE:19420209T020000
END:DAYLIGHT
BEGIN:DAYLIGHT
TZOFFSETFROM:-0400
TZOFFSETTO:-0400
TZNAME:EPT
DTSTART:19450814T190000
RDATE:19450814T190000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT

CATEGORIES:Engineering
CATEGORIES:Lectures/Conferences
CATEGORIES:Utilities
CATEGORIES:Panel/Seminar/Colloquium
CATEGORIES:Main
CONTACT;X-BEDEWORK-UID=8a0870ee-48a75713-0148-a8c93d00-000067e1:Ginsberg\,
  Margo
CREATED:20231114T165829Z
DESCRIPTION:Details to follow.
DURATION:PT1H
DTSTAMP:20240412T123231Z
DTSTART;TZID=America/New_York:20240112T140000
LAST-MODIFIED:20240412T123231Z
LOCATION;X-BEDEWORK-UID=8a039360-81409ef1-0182-124440ea-000060f6:4700 Ches
 terfield\, 701 W Main Street
STATUS:CONFIRMED
SUMMARY:Triangle Quantum Computing Seminar
UID:CAL-8a018ccf-8b87f80e-018b-cec52ab0-0000792ademobedework@mysite.edu
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Main:/user/public-user/Utili
 ties/Main
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Panel_Seminar_Colloquium:/us
 er/public-user/Lectures_Conferences/Panel_Seminar_Colloquium
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Engineering:/user/public-use
 r/Topics/Engineering
X-BEDEWORK-SUBMITTEDBY:mfg20 for Duke Quantum Center (agrp_DQC)
X-BEDEWORK-CS;X-BEDEWORK-PARAM-DESCRIPTION="/principals/users/agrp__Artsan
 dSciences_Physics,/principals/users/agrp_PrattSchool,":Physics\,Pratt Sch
 ool of Engineering
RRULE:FREQ=WEEKLY;INTERVAL=1;UNTIL=20240419T040000Z
END:VEVENT
BEGIN:VEVENT

RECURRENCE-ID;TZID=America/New_York:20240126T140000
CATEGORIES:Engineering
CATEGORIES:Natural Sciences
CATEGORIES:Lectures/Conferences
CATEGORIES:Utilities
CATEGORIES:Panel/Seminar/Colloquium
CATEGORIES:Main
CONTACT;X-BEDEWORK-UID=8a0870ee-48a75713-0148-a8c93d00-000067e1:Ginsberg\,
  Margo
CREATED:20231114T165829Z
DESCRIPTION:Abstract: Efficiently calculating the low-lying eigenvalues of
  Hamiltonians is a fundamental challenge in quantum computing. While vari
 ous methods have been proposed to reduce the complexity of quantum circui
 ts for this task\, there remains room for further improvement. In this ta
 lk\, I will introduce a framework for constructing shorter and more effic
 ient Hamiltonian-based quantum circuits. Additionally\, I will share resu
 lts from various numerical simulations to demonstrate the effectiveness o
 f our method in accurately determining the ground state energy of differe
 nt quantum chemistry Hamiltonians.\n\nAbhinav Anand is a postdoctoral res
 earcher at the Duke quantum center working with Prof. Kenneth R. Brown. P
 reviously\, he completed his PhD at the University of Toronto under the s
 upervision of Prof. Alán Aspuru-Guzik. His research interests lie at the 
 intersection of quantum algorithms design\, error correction\, quantum ch
 emistry\, machine learning\, and software development.
DURATION:PT1H
DTSTAMP:20240124T155016Z
DTSTART;TZID=America/New_York:20240126T140000
LAST-MODIFIED:20240124T155016Z
LOCATION;X-BEDEWORK-UID=8a039360-81409ef1-0182-124440ea-000060f6:4700 Ches
 terfield\, 701 W Main Street
STATUS:CONFIRMED
SUMMARY:Hamiltonians\, groups\, states and circuits
UID:CAL-8a018ccf-8b87f80e-018b-cec52ab0-0000792ademobedework@mysite.edu
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Main:/user/public-user/Utili
 ties/Main
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Panel_Seminar_Colloquium:/us
 er/public-user/Lectures_Conferences/Panel_Seminar_Colloquium
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Engineering:/user/public-use
 r/Topics/Engineering
X-BEDEWORK-CS;X-BEDEWORK-PARAM-DESCRIPTION="/principals/users/agrp__Artsan
 dSciences_Physics,/principals/users/agrp_PrattSchool,":Physics\,Pratt Sch
 ool of Engineering
X-BEDEWORK-SUBMITTEDBY:mfg20 for Duke Quantum Center (agrp_DQC)
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Natural Sciences:/user/publi
 c-user/Topics/Natural Sciences
X-BEDEWORK-SPEAKER:Abhinav Anand
X-BEDEWORK-DUKE-SERIES:Triangle Quantum Computing Seminar
X-BEDEWORK-DUKE-WEBCAST:https://duke.zoom.us/j/96112390048?pwd=enJHZVNMTGF
 lbVduQ3RUcjMrWlo4Zz09
END:VEVENT
BEGIN:VEVENT

RECURRENCE-ID;TZID=America/New_York:20240202T140000
CATEGORIES:Engineering
CATEGORIES:Lectures/Conferences
CATEGORIES:Utilities
CATEGORIES:Panel/Seminar/Colloquium
CATEGORIES:Main
CONTACT;X-BEDEWORK-UID=8a0870ee-48a75713-0148-a8c93d00-000067e1:Ginsberg\,
  Margo
CREATED:20231114T165829Z
DESCRIPTION:Quantum machine learning (QML) is a cross-disciplinary subject
  made up of two of the most exciting research areas: quantum computing an
 d classical machine learning (ML)\, with ML and artificial intelligence (
 AI) being projected as the first fields that will be impacted by the rise
  of quantum machines. Quantum computers are being used today in drug disc
 overy\, security\, sensor data classification\, material & molecular mode
 lling and finance. In this work\, we discuss some upcoming active new res
 earch areas in application of quantum machine learning (QML) in finance. 
 We discuss certain QML models that has become areas of active interest in
  the financial world for various applications. We use real world financia
 l dataset and compare models such as qGAN (quantum generative adversarial
  networks) and QCBM (quantum circuit Born machine) among others\, using s
 imulated environments. For the qGAN\, we define quantum circuits for disc
 riminators and generators and finally discuss impacts of more quantitativ
 e metrics of success. Finally\, we discuss the aspects of marrying QML wi
 th the financial world and the possible way to obtain certain quantum adv
 antage at present via "quantum inspired" computing leveraging HPC (High p
 erformance Computing).
DURATION:PT1H
DTSTAMP:20240202T143633Z
DTSTART;TZID=America/New_York:20240202T140000
LAST-MODIFIED:20240202T143633Z
LOCATION;X-BEDEWORK-UID=2c918085-71ed832f-0172-098647fa-0000767f:Virtual
STATUS:CONFIRMED
SUMMARY:Triangle Quantum Computing Seminar
UID:CAL-8a018ccf-8b87f80e-018b-cec52ab0-0000792ademobedework@mysite.edu
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Main:/user/public-user/Utili
 ties/Main
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Panel_Seminar_Colloquium:/us
 er/public-user/Lectures_Conferences/Panel_Seminar_Colloquium
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Engineering:/user/public-use
 r/Topics/Engineering
X-BEDEWORK-CS;X-BEDEWORK-PARAM-DESCRIPTION="/principals/users/agrp__Artsan
 dSciences_Physics,/principals/users/agrp_PrattSchool,":Physics\,Pratt Sch
 ool of Engineering
X-BEDEWORK-SUBMITTEDBY:mfg20 for Duke Quantum Center (agrp_DQC)
X-BEDEWORK-SPEAKER:Santanu Ganguly
X-BEDEWORK-DUKE-SERIES:Triangle Quantum Computing Seminar Series
END:VEVENT
BEGIN:VEVENT

RECURRENCE-ID;TZID=America/New_York:20240209T140000
CATEGORIES:Engineering
CATEGORIES:Lectures/Conferences
CATEGORIES:Utilities
CATEGORIES:Panel/Seminar/Colloquium
CATEGORIES:Main
CONTACT;X-BEDEWORK-UID=8a0870ee-48a75713-0148-a8c93d00-000067e1:Ginsberg\,
  Margo
CREATED:20231114T165829Z
DESCRIPTION:The quantum approximate optimization algorithm (QAOA) is a lea
 ding candidate algorithm for solving optimization problems on quantum com
 puters. However\, the potential of QAOA to tackle classically intractable
  problems remains unclear. In this paper\, we perform an extensive numeri
 cal investigation of QAOA on the Low Autocorrelation Binary Sequences (LA
 BS) problem. The rapid growth of the problem's complexity with the number
  of spins N makes it classically intractable even for moderately sized in
 stances\, with the best-known heuristics observed to fail to find a good 
 solution for problems with N⪆200. We perform noiseless simulations with u
 p to 40 qubits and observe that out to this system size\, the runtime of 
 QAOA with fixed parameters and a constant number of layers scales better 
 than branch-and-bound solvers\, which are the state-of-the-art exact solv
 ers for LABS. The combination of QAOA with quantum minimum-finding on an 
 idealized quantum computer gives the best empirical scaling of any algori
 thm for the LABS problem. We demonstrate experimental progress in compili
 ng and executing QAOA for the LABS problem using an algorithm-specific er
 ror detection scheme on Quantinuum trapped-ion processors.\n\nRuslan Shay
 dulin is a quantum algorithms researcher at the Global Technology Applied
  Research center at JPMorgan Chase. Ruslan's research centers on applying
  quantum algorithms to classical problems\, with a focus on optimization 
 and machine learning. Prior to joining JPMorgan Chase\, Ruslan was a Mari
 a Goeppert Mayer fellow at Argonne National Laboratory.
DURATION:PT1H
DTSTAMP:20240207T171422Z
DTSTART;TZID=America/New_York:20240209T140000
LAST-MODIFIED:20240207T171422Z
LOCATION;X-BEDEWORK-UID=2c918085-71ed832f-0172-098647fa-0000767f:Virtual
STATUS:CONFIRMED
SUMMARY:Evidence of  Scaling Advantage for the Quantum Approximate Optimiz
 ation Algorithm on a Classically Intractable Problem
UID:CAL-8a018ccf-8b87f80e-018b-cec52ab0-0000792ademobedework@mysite.edu
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Main:/user/public-user/Utili
 ties/Main
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Panel_Seminar_Colloquium:/us
 er/public-user/Lectures_Conferences/Panel_Seminar_Colloquium
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Engineering:/user/public-use
 r/Topics/Engineering
X-BEDEWORK-CS;X-BEDEWORK-PARAM-DESCRIPTION="/principals/users/agrp__Artsan
 dSciences_Physics,/principals/users/agrp_PrattSchool,":Physics\,Pratt Sch
 ool of Engineering
X-BEDEWORK-SUBMITTEDBY:mfg20 for Duke Quantum Center (agrp_DQC)
X-BEDEWORK-SPEAKER:Ruslan Shaydulin
X-BEDEWORK-DUKE-SERIES:Triangle Quantum Computing Seminar Series
END:VEVENT
BEGIN:VEVENT

RECURRENCE-ID;TZID=America/New_York:20240216T140000
CATEGORIES:Engineering
CATEGORIES:Lectures/Conferences
CATEGORIES:Utilities
CATEGORIES:Panel/Seminar/Colloquium
CATEGORIES:Main
CONTACT;X-BEDEWORK-UID=8a0870ee-48a75713-0148-a8c93d00-000067e1:Ginsberg\,
  Margo
CREATED:20231114T165829Z
DESCRIPTION:Quantum amplitude estimation (QAE) is a pivotal quantum algori
 thm to estimate the squared amplitude α of the target basis state in a qu
 antum state |Φ⟩. Various improvements on the original version of QAE have
  been proposed for resource reduction. One of such improved versions is i
 terative quantum amplitude estimation (IQAE)\, which outputs an estimate 
 â of α through the iterated rounds of the measurements on the quantum sta
 tes like Gk|Φ⟩\, with the number k of operations of the Grover operator G
  (the Grover number) and the shot number determined adaptively. This stud
 y investigates the bias in IQAE. Through the numerical experiments to sim
 ulate IQAE\, we reveal that the estimate by IQAE is biased and the bias i
 s enhanced for some specific values of α. We see that the termination cri
 terion in IQAE that the estimated accuracy of â falls below the threshold
  is a source of the bias. Besides\, we observe that kfin\, the Grover num
 ber in the final round\, and ffin\, a quantity affecting the probability 
 distribution of measurement outcomes in the final round\, are the key fac
 tors to determine the bias\, and the bias enhancement for specific values
  of α is due to the skewed distribution of (kfin\, ffin). We also present
  a bias mitigation method: just re-executing the final round with the Gro
 ver number and the shot number fixed.\n\nKoichi Miyamoto is a specially a
 ppointed associate professor at the Center for Quantum Information and Qu
 antum Biology of Osaka University\, Japan.\n\nPre-registration is require
 d. Sign up here (https://ncsu.zoom.us/meeting/register/tJIvd-2srDIjG9wyxG
 cuSKxV7FH-oUoWrxC6#/registration).
DURATION:PT1H
DTSTAMP:20240216T162857Z
DTSTART;TZID=America/New_York:20240216T140000
LAST-MODIFIED:20240216T162857Z
LOCATION;X-BEDEWORK-UID=2c918085-71ed832f-0172-098647fa-0000767f:Virtual
STATUS:CONFIRMED
SUMMARY:On The Bias In Iterative Quantum Amplitude Estimation
UID:CAL-8a018ccf-8b87f80e-018b-cec52ab0-0000792ademobedework@mysite.edu
URL:https://ncsu.zoom.us/meeting/register/tJIvd-2srDIjG9wyxGcuSKxV7FH-oUoW
 rxC6#/registration
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Main:/user/public-user/Utili
 ties/Main
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Panel_Seminar_Colloquium:/us
 er/public-user/Lectures_Conferences/Panel_Seminar_Colloquium
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Engineering:/user/public-use
 r/Topics/Engineering
X-BEDEWORK-CS;X-BEDEWORK-PARAM-DESCRIPTION="/principals/users/agrp__Artsan
 dSciences_Physics,/principals/users/agrp_PrattSchool,":Physics\,Pratt Sch
 ool of Engineering
X-BEDEWORK-SUBMITTEDBY:mfg20 for Duke Quantum Center (agrp_DQC)
X-BEDEWORK-SPEAKER:Koichi Miyamoto
X-BEDEWORK-DUKE-SERIES:Triangle Quantum Computing Seminar Series
END:VEVENT
BEGIN:VEVENT

RECURRENCE-ID;TZID=America/New_York:20240223T140000
CATEGORIES:Engineering
CATEGORIES:Lectures/Conferences
CATEGORIES:Utilities
CATEGORIES:Panel/Seminar/Colloquium
CATEGORIES:Main
CONTACT;X-BEDEWORK-UID=8a0870ee-48a75713-0148-a8c93d00-000067e1:Ginsberg\,
  Margo
CREATED:20231114T165829Z
DESCRIPTION:Superconducting quantum processors have recently made signific
 ant improvements in both quality and scale. Concurrent progress in error 
 mitigation techniques has now enabled the application of these to quantum
  circuits at scales where exact\, brute-force classical solutions are not
  always accessible. In this talk\, I will first discuss experimental chal
 lenges for large fixed-frequency superconducting processors\, and present
  strategies to tailor the noise for error mitigation. I will then discuss
  our experimental implementations of zero noise extrapolation on a 127-qu
 bit processor for simulations of spin-model dynamics.
DURATION:PT1H
DTSTAMP:20240219T192540Z
DTSTART;TZID=America/New_York:20240223T140000
LAST-MODIFIED:20240219T192540Z
LOCATION;X-BEDEWORK-UID=8a039360-81409ef1-0182-124440ea-000060f6:4700 Ches
 terfield\, 701 W Main Street
STATUS:CONFIRMED
SUMMARY:Extending the reach of today's noisy quantum computers
UID:CAL-8a018ccf-8b87f80e-018b-cec52ab0-0000792ademobedework@mysite.edu
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Main:/user/public-user/Utili
 ties/Main
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Panel_Seminar_Colloquium:/us
 er/public-user/Lectures_Conferences/Panel_Seminar_Colloquium
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Engineering:/user/public-use
 r/Topics/Engineering
X-BEDEWORK-CS;X-BEDEWORK-PARAM-DESCRIPTION="/principals/users/agrp__Artsan
 dSciences_Physics,/principals/users/agrp_PrattSchool,":Physics\,Pratt Sch
 ool of Engineering
X-BEDEWORK-SUBMITTEDBY:mfg20 for Duke Quantum Center (agrp_DQC)
X-BEDEWORK-SPEAKER:Andrew Eddins
X-BEDEWORK-DUKE-SERIES:Triangle Quantum Computing Seminar Series
END:VEVENT
BEGIN:VEVENT

RECURRENCE-ID;TZID=America/New_York:20240308T140000
CATEGORIES:Engineering
CATEGORIES:Lectures/Conferences
CATEGORIES:Utilities
CATEGORIES:Panel/Seminar/Colloquium
CATEGORIES:Main
CONTACT;X-BEDEWORK-UID=8a0870ee-48a75713-0148-a8c93d00-000067e1:Ginsberg\,
  Margo
CREATED:20231114T165829Z
DESCRIPTION:Teleportation is another facet where quantum measurements can 
 act as a powerful resource in quantum physics\, as local measurements all
 ow to steer quantum information in a non-local way. While this has long b
 een established for Bell pairs\, the teleportation of a fault-tolerant lo
 gical qubit presents a fundamentally different challenge as it requires t
 he teleportation of a many-qubit wavefunction. \n\nIn this talk\, I will 
 discuss a protocol for teleporting a long-range entangled surface code st
 ate\, concerning its stability under tunable coherent errors. A topologic
 al phase diagram with continuously varying optimal threshold is charted\,
  by a combination of analytic statistical model analysis and numerical te
 nsor network calculation. The underlying anyon condensation mechanism and
  the role of duality will be touched. I'll address how it can be readily 
 implemented and decoded in certain NISQ platforms. \n \nGuo-Yi Zhu obtain
 ed his PhD degree in Physics from Tsinghua University in 2019. He works a
 s post-doctoral fellow for the Max-Planck-Institute for the Physics of Co
 mplex Systems (Germany) from 2019 to 2021\, and for the Institute for The
 oretical Physics in University of Cologne from 2021 till now. He will joi
 n Hong-Kong University of Science and Technology (Guangzhou) as an assist
 ant professor from Fall 2024. Coming from a background of quantum many-bo
 dy physics\, he's currently fascinated by various questions at the interf
 ace between condensed matter and quantum information.
DURATION:PT1H
DTSTAMP:20240305T183756Z
DTSTART;TZID=America/New_York:20240308T140000
LAST-MODIFIED:20240305T183756Z
LOCATION;X-BEDEWORK-UID=2c918085-71ed832f-0172-098647fa-0000767f:Virtual
STATUS:CONFIRMED
SUMMARY:Robust Teleportation of a Topological Surface Code Under Coherent 
 Error
UID:CAL-8a018ccf-8b87f80e-018b-cec52ab0-0000792ademobedework@mysite.edu
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Main:/user/public-user/Utili
 ties/Main
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Panel_Seminar_Colloquium:/us
 er/public-user/Lectures_Conferences/Panel_Seminar_Colloquium
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Engineering:/user/public-use
 r/Topics/Engineering
X-BEDEWORK-CS;X-BEDEWORK-PARAM-DESCRIPTION="/principals/users/agrp__Artsan
 dSciences_Physics,/principals/users/agrp_PrattSchool,":Physics\,Pratt Sch
 ool of Engineering
X-BEDEWORK-SUBMITTEDBY:mfg20 for Duke Quantum Center (agrp_DQC)
X-BEDEWORK-SPEAKER:Guo-Yi Zhu
X-BEDEWORK-DUKE-SERIES:Triangle Quantum Computing Seminar Series
END:VEVENT
BEGIN:VEVENT

RECURRENCE-ID;TZID=America/New_York:20240322T140000
CATEGORIES:Engineering
CATEGORIES:Lectures/Conferences
CATEGORIES:Utilities
CATEGORIES:Panel/Seminar/Colloquium
CATEGORIES:Main
CONTACT;X-BEDEWORK-UID=8a0870ee-48a75713-0148-a8c93d00-000067e1:Ginsberg\,
  Margo
CREATED:20231114T165829Z
DESCRIPTION:In this presentation I will quickly introduce Quantinuum's har
 dware\, based on moving trapped-ions\, and discuss key features that make
  it very attractive for demonstrating quantum error correction (QEC) prot
 ocols. I will briefly describe two of those demonstrations: real-time fau
 lt-tolerant quantum error correction with the Steane code\, and a logical
  CNOT between two code blocks. Moving beyond QEC primitives\, I will pres
 ent the fault-tolerant implementation of a small one-qubit addition algor
 ithm. The rest of the presentation will consist on a deep dive into a par
 tially fault-tolerant technique to protect very expressive quantum circui
 ts with a minimal-overhead quantum error detection code. Finally\, the op
 portunities and scalability limits of this approach will be discussed\, a
 nd I will outline the development plans for the next generation of Quanti
 nuum's quantum hardware.
DURATION:PT1H
DTSTAMP:20240319T193605Z
DTSTART;TZID=America/New_York:20240322T140000
LAST-MODIFIED:20240319T193605Z
LOCATION;X-BEDEWORK-UID=2c918085-71ed832f-0172-098647fa-0000767f:Virtual
STATUS:CONFIRMED
SUMMARY:Quantum Error Correction and Detection at Quantinuum
UID:CAL-8a018ccf-8b87f80e-018b-cec52ab0-0000792ademobedework@mysite.edu
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Main:/user/public-user/Utili
 ties/Main
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Panel_Seminar_Colloquium:/us
 er/public-user/Lectures_Conferences/Panel_Seminar_Colloquium
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Engineering:/user/public-use
 r/Topics/Engineering
X-BEDEWORK-CS;X-BEDEWORK-PARAM-DESCRIPTION="/principals/users/agrp__Artsan
 dSciences_Physics,/principals/users/agrp_PrattSchool,":Physics\,Pratt Sch
 ool of Engineering
X-BEDEWORK-SUBMITTEDBY:mfg20 for Duke Quantum Center (agrp_DQC)
X-BEDEWORK-SPEAKER:David Amaro
X-BEDEWORK-DUKE-SERIES:Triangle Quantum Computing Seminar Series
END:VEVENT
BEGIN:VEVENT

RECURRENCE-ID;TZID=America/New_York:20240329T140000
CATEGORIES:Engineering
CATEGORIES:Lectures/Conferences
CATEGORIES:Utilities
CATEGORIES:Panel/Seminar/Colloquium
CATEGORIES:Main
CONTACT;X-BEDEWORK-UID=8a0870ee-48a75713-0148-a8c93d00-000067e1:Ginsberg\,
  Margo
CREATED:20231114T165829Z
DESCRIPTION:I will review the concept of Floquet quantum error-correcting 
 codes\, and more generally\, dynamic codes. These codes are defined throu
 gh sequences of low-weight measurements that "evolve" the instantaneous c
 ode in time. I will explain how varying the measurement pattern can lead 
 to the implementation of logical gates. Thus\, in dynamic codes\, the low
 -weight measurements varying in time can be used to generate the code\, i
 mplement logical gates\, and detect errors. Time permitting\, I will also
  discuss preliminary results on completing the universal gate set in pure
 ly two dimensions in copies of toric/surface code\, which involves transi
 ent fault-tolerant switching to a non-abelian quantum double model.\n\nMa
 rgarita is currently a graduate student at MIT advised by Liang Fu\, and 
 will join Caltech as a Walter Burke postdoctoral fellow in fall 2023. She
  works in both condensed matter theory and quantum information. Within qu
 antum information\, her interests include dynamic quantum error correctio
 n and physics-inspired approaches to quantum computation with qLDPC codes
 \, as well as applications of quantum information tools to quantum many-b
 ody systems.
DURATION:PT1H
DTSTAMP:20240322T143809Z
DTSTART;TZID=America/New_York:20240329T140000
LAST-MODIFIED:20240322T143809Z
LOCATION;X-BEDEWORK-UID=2c918085-71ed832f-0172-098647fa-0000767f:Virtual
STATUS:CONFIRMED
SUMMARY:Dynamic codes and quantum computation
UID:CAL-8a018ccf-8b87f80e-018b-cec52ab0-0000792ademobedework@mysite.edu
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Main:/user/public-user/Utili
 ties/Main
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Panel_Seminar_Colloquium:/us
 er/public-user/Lectures_Conferences/Panel_Seminar_Colloquium
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Engineering:/user/public-use
 r/Topics/Engineering
X-BEDEWORK-CS;X-BEDEWORK-PARAM-DESCRIPTION="/principals/users/agrp__Artsan
 dSciences_Physics,/principals/users/agrp_PrattSchool,":Physics\,Pratt Sch
 ool of Engineering
X-BEDEWORK-SUBMITTEDBY:mfg20 for Duke Quantum Center (agrp_DQC)
X-BEDEWORK-SPEAKER:Margarita Davydova
X-BEDEWORK-DUKE-SERIES:Triangle Quantum Computing Seminar Series
END:VEVENT
BEGIN:VEVENT

RECURRENCE-ID;TZID=America/New_York:20240412T140000
CATEGORIES:Engineering
CATEGORIES:Lectures/Conferences
CATEGORIES:Utilities
CATEGORIES:Panel/Seminar/Colloquium
CATEGORIES:Main
CONTACT;X-BEDEWORK-UID=8a0870ee-48a75713-0148-a8c93d00-000067e1:Ginsberg\,
  Margo
CREATED:20231114T165829Z
DESCRIPTION:Quantum computers (QCs) have the potential to tackle certain p
 roblems beyond the capabilities of classical supercomputers\; however\, t
 hey face two major challenges: the inherent noisiness of quantum hardware
  significantly reduces their reliability\, and privacy concerns arise fro
 m executing quantum programs on potentially untrusted quantum cloud provi
 ders. In this talk\, I will discuss my contributions to enhancing the fid
 elity and security of QCs\, highlighting the significant potential of des
 igning software policies at the application layer in unlocking the full p
 otential of near-term QCs. I will first discuss FrozenQubits\, a software
  policy that substantially boosts the fidelity of Quantum Approximate Opt
 imization Algorithm (QAOA) applications by identifying and removing hotsp
 ot qubits\, which are key contributors to noise in quantum programs\, the
 reby achieving higher fidelity in noisy QCs. Next\, I will discuss Enigma
 \, a suite of Secure Quantum Computing (SQC) schemes specifically designe
 d for QAOA. Unlike previous SQC techniques that obfuscate quantum circuit
 s\, Enigma encrypts the input problem of QAOA\, such that the resulting c
 ircuit and the outcomes are unintelligible to the server. Enigma is disti
 nguished as the first and the only SQC protocol ready for deployment on c
 urrent and near-term QCs. \n\nDr. Ramin Ayanzadeh is a postdoctoral resea
 rcher at Georgia Tech and is honored to be one of the 59 Computing Innova
 tions Fellows awarded by the NSF/CRA. He received his PhD from the Univer
 sity of Maryland\, Baltimore County. His primary research area is the sys
 tem and architecture of quantum computers and emerging accelerators\, and
  he is also engaged in quantum machine learning and applying quantum comp
 uters to complex real-world problems. He has made contributions to venues
  such as ASPLOS\, QCE\, CAL\, and Nature Scientific Reports. His work on 
 "reinforced quantum annealing" and "multi-qubit correction" has been reco
 gnized as the "top 100 papers in physics" and the "editor's choice for qu
 antum computing" by Nature's Scientific Reports\, respectively. Ramin is 
 a recipient of the NIH/Meyerhoff Graduate Fellowship and the Google Lime 
 Scholarship\, and has earned second place in the ACM Student Research Com
 petition.
DURATION:PT1H
DTSTAMP:20240412T123231Z
DTSTART;TZID=America/New_York:20240412T140000
LAST-MODIFIED:20240412T123231Z
LOCATION;X-BEDEWORK-UID=2c918085-71ed832f-0172-098647fa-0000767f:Virtual
STATUS:CONFIRMED
SUMMARY:Trustworthy Quantum Computing: Improving the Reliability and Secur
 ity of Quantum Computers
UID:CAL-8a018ccf-8b87f80e-018b-cec52ab0-0000792ademobedework@mysite.edu
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Main:/user/public-user/Utili
 ties/Main
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Panel_Seminar_Colloquium:/us
 er/public-user/Lectures_Conferences/Panel_Seminar_Colloquium
X-BEDEWORK-ALIAS;X-BEDEWORK-PARAM-DISPLAYNAME=Engineering:/user/public-use
 r/Topics/Engineering
X-BEDEWORK-CS;X-BEDEWORK-PARAM-DESCRIPTION="/principals/users/agrp__Artsan
 dSciences_Physics,/principals/users/agrp_PrattSchool,":Physics\,Pratt Sch
 ool of Engineering
X-BEDEWORK-SUBMITTEDBY:mfg20 for Duke Quantum Center (agrp_DQC)
X-BEDEWORK-SPEAKER:Dr. Ramin Ayanzadeh
X-BEDEWORK-DUKE-SERIES:Triangle Quantum Computing Seminar Series
END:VEVENT
END:VCALENDAR