Events

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.

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.

Duality Quantum Computing: Computing with Linear Combinations of Unitaries

Gui-Lu Long, APS and IoP Fellow

Usually, a quantum algorithm uses products of unitaries to complete a task. Lack of technique and intuition in algorithm design has hindered the development of quantum algorithm.

“Quantum physics” has taken its position with “rocket science” in pop culture as a shorthand for frighteningly complicated science. Quantum physics has also taken on a sort of magical connotation in fiction, with features like entanglement, superposition, and tunneling, spurring imagination. But where does the science draw the line? How much is joyful speculation, and how much is disregard for reality? And if it’s always seen as either magical or scary, how does that affect the perception of quantum science?

This presentation will delve into a practical example of a patent procedure associated to a specific quantum technology: quantum random number generator. We will explore the specifics of the technology and its applications, review previously existing approaches and define the inventive step, explore the phrasing of the claims, and revisit the prior patents from the freedom-to-operate point of view.

Byoung Ham, Gwangju Institute of Science and Technology

Quantum coherence control in an inhomogeneously broadened lambda-type solid state ensemble has been studied for quantum memories over decades. Unlike akali atoms, the optically excited spin coherence in a rare-earth doped solid is sufferred from a serious spin dephasing problem due to spin inhomogeneity. Thus, solid state quantum memory protocols such as AFC and gradient echo have been effctively demonstrated only for optical transitions, whose coherence time is far shorter than ms.

The event will feature a panel of four speakers who will share how their agency or organization supports start-ups and commercialization of IP, including funding sources and services available to faculty and start-ups. Each panelist will provide a brief presentation and respond to a set of questions followed by a Q&A session. Informal networking will take place between 1:00pm and 1:30pm.

Moderator:

Tarra Weber