Ken Andersen, Neutron Instruments Division, European Spallation Source ERIC
Formal Methods in Quantum Circuit Design
PhD Candidate: Matthew Amy
Supervisor: Michele Mosca
Oral defence in QNC B204.
The design and compilation of correct, efficient quantum circuits is integral to the future operation of quantum computers. This thesis makes contributions to the problems of optimizing and verifying quantum circuits, with an emphasis on the development of formal models for such purposes. We also present software implementations of these methods, which together form a full stack of tools for the design of optimized, formally verified quantum oracles.
Speaker: Heather Hoff
Abstract: Software is a key asset of any new business. How do you protect the results of weeks or months of hard labour? Who owns the software and how do I mange its development to ensure its inherent value is maintained? Should I use Open Source, or even contribute to Open Source? What are the benefits and how does this measure up against the risks?
Spontaneous Raman emission in cold atoms inside a hollow-core waveguide
Taehyun Yoon, Institute for Quantum Computing
Cold atoms confined inside hollow-core waveguides enable strong-matter interactions, thus offer a unique platform for studies of quantum and non-linear optics. We developed an experimental system that traps cesium atoms in a magneto optical trap (MOT) and loads these atoms into a hollow core photonic crystal fiber using a dipole trap at cesium magic wavelength (935 nm), which removes the AC-Stark shift of the optical transition and suppresses the inhomogeneous broadening.
Frederic Magniez, Université Paris Diderot
Giovanni Fanchini, Western University
In this talk, we will review the use of thin films of organic polyradicals – organic polymers with one unpaired electron per monomer  – for memory devices and other applications. Although memory devices based on radical polymers have been often proposed, their stability was frequently limited to a few writing cycles, despite the excellent quality of the active layer.
Alexander Belovs, University of Latvia
This talk reflects on recent research in progress with Andras Gilyen. Over the years, there have been a number of papers dealing with quantum algorithms testing some properties of classical probability distributions. Our goal is to understand what is the right way for quantum algorithms to access the distribution. There is a number of possible models, and we analyse their mutual strength.
Speaker: Neil Henderson
Abstract: The patent system provides a monopoly in return for disclosure of new technology. The disclosures (patent applications) are published and classified by technology to provide an extensive global resource available on line. Want to know how many patent applications Apple has for quantum cryptography? Who else is working in your area ? Does anyone hold a dominant position or are the rights widely distributed?
Impacts of relativity on localizability and vacuum entanglement
Master's Candidate: Maria Papageorgiou
Much of the structure of quantum field theory (QFT) is predicated on the principle of locality. Adherence to locality is pursuant to convictions deduced from relativity, and is achieved in QFT by the association of regions of spacetime with algebras of observables. Although, by construction, the observables of QFT are local objects, one may also consider characterizing the spatial or spacetime features of a state.
Stefan Frick, University of Bristol, UK
Rangefinding has many applications in navigation, civil engineer, construction, military, surveillance and security. Most commonly rangefinders estimate the distance to an object by measuring the time of flight of light for the journey to and returning from the target. Conventional techniques use lasers for illumination in state of the art rangefinding systems. However, the particular state of light lasers produce makes them easy to detect.
Seminar - Cunlu Zhou, University of Notre Dame
Quantum (von Neumann) entropy optimization problems constitute an important class of quantum relative entropy optimization and have applications in various areas including quantum state tomography, statistical physics and machine learning. The optimization involves a nonlinear convex objective function $Tr(XlnX)$ and equality constraints on positive definite matrix $X$. In this talk I will present a long-step interior-point algorithm for the quantum entropy optimization (joint work with my co-advisor).