BEGIN:VCALENDAR
VERSION:2.0
CALSCALE:GREGORIAN
PRODID:UW-Madison-Physics-Events
BEGIN:VEVENT
SEQUENCE:0
UID:UW-Physics-Event-9219
DTSTART:20250507T200000Z
DTEND:20250507T220000Z
DTSTAMP:20260413T135756Z
LAST-MODIFIED:20250429T154141Z
LOCATION:5280 CH
SUMMARY:IMPLEMENTATION OF QUANTUM ALGORITHMS WITH NEUTRAL ATOM ARRAYS\
 , Thesis Defense\, Cody Poole\, Physics PhD Student
DESCRIPTION:Quantum computers promise to eventually provide significan
 t algorithmic advantage over classical computers for a variety of prob
 lems. Executing algorithms on a physical device requires compiling cir
 cuits to the native gate set of your device. We are in the Noisy Inter
 mediate Scale Quantum (NISQ) era of quantum computers where circuit ex
 ecution depths are severely limited by qubit decoherence and gate erro
 rs. Large defect-free atom arrays can be produced by initially loading
  into traps with ~50% success and rearranging the trapped atoms into a
  desired pattern to enable enhanced data rates for calibrating control
  operations and running circuits. We present on our implementation of 
 defect-free array generation using the Hungarian matching algorithm an
 d on a partially parallelized rearrangement algorithm. Quantum compute
 rs based on a register of neutral Cs atoms have demonstrated significa
 nt improvements in gate fidelities in recent years. We present the fir
 st implementation of quantum algorithms on an array of neutral Cs atom
 s. Algorithms executed include Greenberger-Horne-Zeilinger state prepa
 ration\, Quantum Phase Estimation of the ground state energy of the Hy
 drogen molecule\, the Quantum Approximate Optimization Algorithm (QAOA
 ) applied to the MAXCUT problem\, and the Variational Quantum Eigensol
 ver algorithm applied to finding the ground state energy of the Lipkin
  model. Looking to the future\, high performance quantum error correct
 ion (QEC) codes will eventually be necessary to run very deep circuits
  that promise to eventually provide quantum advantage. We present on a
  qubit allocation scheme and Rydberg gate protocol that would allow fo
 r the implementation of a recently characterized class of quantum QEC 
 codes known as Bivariate Bicycle codes on a 2D array of Cs qubits.
URL:https://www.physics.wisc.edu/events/?id=9219
END:VEVENT
END:VCALENDAR
