Events

Chinmay Nirkhe, University of California, Berkeley

We study approximate quantum low-density parity-check (QLDPC) codes, which are approximate quantum error-correcting codes specified as the ground space of a frustration-free local Hamiltonian, whose terms do not necessarily commute. Such codes generalize stabilizer QLDPC codes, which are exact quantum error-correcting codes with sparse, low-weight stabilizer generators (i.e. each stabilizergenerator acts on a few qubits, and each qubit participates in a few stabilizer generators).

Speaker: Jacqueline Armstrong Gates

Nicole Yunger Halpern, Harvard University Department of Physics

Thermodynamics has shed light on engines, efficiency, and time’s arrow since the Industrial Revolution. But the steam engines that powered the Industrial Revolution were large and classical. Much of today’s technology and experiments are small-scale, quantum, and out-of-equilibrium. Nineteenth-century thermodynamics requires updating for the 21st century. Guidance has come from the mathematical toolkit of quantum information theory.

Nicole Yunger Halpern, Harvard-Smithsonian Institute for Theoretical Atomic, Molecular, and Optical Physics

Join us in QNC 1201 for a Meet and Greet with Nicole Yunger Halpern, Postdoctoral Fellow at the Harvard-Smithsonian Institute for Theoretical Atomic, Molecular, and Optical Physics (ITAMP). All are welcome. Snacks and refreshments will be provided.

Supartha Podder, University of Ottawa

In 2011 Harry Buhrman, Serge Fehr, Christian Schaffner and Florian Speelman proposed a new measure of complexity for finite Boolean functions, called "The Garden-hose complexity". This measure can be viewed as a type of distributed space complexity where two players with private inputs compute a Boolean function co-operatively. While its motivation mainly came from the applications to position based quantum cryptography, the playful definition of the model is quite appealing in itself.

Martin Savage, Institute for Nuclear Theory 

Recently, Silas Beane, David Kaplan, Natalie Klco and I considered the entanglement power of the S-­‐matrix describing low-­‐energy hadronic interactions, and the implications of particular limits. We found that vanishing entanglement power occurs at points of emergent global symmetries, which are seen to be consistent with nature and also recent lattice quantum chromodynamics (QCD) calculations. I will discuss aspects of these results.

Anand Natarajan, Caltech

A long-standing puzzle in quantum complexity theory is to understand the power of the class MIP* of multiprover interactive proofs with shared entanglement. This question is closely related to the study of entanglement through non-local games, which dates back to the pioneering work of Bell.

Speaker: Viona M. Duncan

Abstract: We all want to be the nice guy, but we do not want to finish last. How should we respect the IP of others, particularly confidential information and what should we expect of others when we provide confidential information to them? Simple steps that can be taken to meet obligations and preserve confidentiality will be discussed. You may also have obligations to funding agencies and the University. The UW IP policy will be discussed along with issues of ownership and employee confidentiality.

Optimization Algorithms for Quantum Deep Learning

PhD Candidate: Guillaume Verdon-Akzam

A polar decomposition for quantum channels: insightful tools to navigate through noisy quantum circuits

Arnaud Carignan-Dugas, Institute for Quantum Computing

Inevitably, assessing the overall performance of a quantum computer must rely on characterizing some of its elementary constituents and, from this information, formulate a broader statement concerning more complex constructions thereof.