Seminar

Sangwook Lee, Ewha Womans University

In this presentation, physical properties and possible applications of carbon based nano electro-mechanical devices (NEMS) will be introduced. Our research started from carbon nanotube based nano electro-mechanical relay structure and expanded to graphene based xylophone and drum like devices. Micro contact transfer method is applied to realize the suspended nano structures with various electrodes under the nano materials.

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.

Academic Writing Workshop #2

Elisabeth van Stam (UW Writing and Communication Centre)

The best scientific writing is clear, concise and easily comprehended by its intended audience. Learn skills for writing in the sciences, including identifying and correcting common errors to write with precision and fluidity.

Academic Writing Workshop #1

Elisabeth van Stam (UW Writing and Communication Center)

Learning to effectively communicate your research is an essential skill necessary for success within academia. Join Elisabeth van Stam (STEM Specialist) as she introduces you to the Writing and Communication Centre (WCC) services and resources that will help you successfully accomplish your research milestones.

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.

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.

Candidate: Guofei Long

Supervisors: David Cory and Guo-Xing Miao

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.

Journal club presentation:

"Experimental superposition of orders of quantum gates" by Procopio et. al.

(Nature Comms 6, 7913 (2015)

Arash Ahmadi, Institute for Quantum Computing

Quantum computers achieve a speed-up by placing quantum bits (qubits) in superpositions of different states. However, it has recently been appreciated that quantum mechanics also allows one to ‘superimpose different operations’.