Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Tuesday, April 10, 2018 1:30 pm - 1:30 pm EDT (GMT -04:00)

Spatial noise filtering through error correction for quantum sensing

David Layden - Massachusetts Institute of Technology (MIT)

Sensors based on quantum effects can measure various external quantities, such as magnetic fields, with high precision. Moreover, their sensitivity can scale more favourably with their size than is allowed classically — a property analogous to quantum speedups in computing. As with quantum computers, the performance of quantum sensors is limited by decoherence. Quantum error correction (QEC) has recently emerged as a promising approach to mitigate this decoherence, and therefore, to enhance sensitivity.

Wednesday, April 11, 2018 1:00 pm - 1:00 pm EDT (GMT -04:00)

Mind the gap: Cheeger inequalities and adiabatic algorithms

Michael Jarret, Perimeter Institute for Theoretical Physics

The runtime of Adiabatic optimization algorithms are typically characterized by the size of the spectral gap of the corresponding Hamiltonian. Gap analysis nonetheless remains a challenging problem with few general approaches.

Thursday, April 12, 2018 12:00 pm - 12:00 pm EDT (GMT -04:00)

Transformative Quantum Technologies (TQT) Lunch and Learn

A Case Study in Patent Development

This presentation will delve into a practical example of a patent procedure associated to a specific quantum technology: a vectorial magnetometer. 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.

Thursday, April 19, 2018 12:00 pm - 12:00 pm EDT (GMT -04:00)

The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials

Robin Kothari, Microsoft Research (PLEASE NOTE NEW DATE AND TIME)

We use the polynomial method to prove optimal or nearly optimal lower bounds on the quantum query complexity of several problems, resolving open questions from prior work. The problems studied include k-distinctness, image size testing, k-junta testing, approximating statistical distance, approximating Shannon entropy, and surjectivity.​ Paper available at https://arxiv.org/abs/1710.09079. This is joint work with Mark Bun and Justin Thaler.

Friday, April 20, 2018 11:45 am - 11:45 am EDT (GMT -04:00)

RAC1 Journal Club/Seminar Series

Keysight's Quantum Engineering Toolkit: A commercial, customizable integrated control and test system

Presented by guest speaker Nizar Messaoudi, Keysight Technologies Application Engineer

With traditional classical complementary metal oxide semiconductor (CMOS) computing struggling to keep up with Moore’s law, interest in quantum computing has exploded and the University of Waterloo is at the centre of this technological revolution.

Eric Bittner, University of Houston

Entangled photons offer an exquisite probe to correlated dynamics within a material system. In my talk I shall discuss some recent experiments and our theoretical investigations into developing an input/output scattering theory approach that connects an incoming photon Fock state to an outgoing Fock state, treating both the internal (material) and photon dynamics on a consistent footing. As proof of concept, we show how entangled photons can probe the inner workings of a model system undergoing spontaneous symmetry breaking.

Tuesday, April 24, 2018 1:00 pm - 1:00 pm EDT (GMT -04:00)

Quantum Computing - Dissipative Quantum Search

PhD Seminar

Chunhao Wang, PhD candidate

David R. Cheriton School of Computer Science

We give a dissipative quantum search algorithm that is based on a novel dissipative query model. If there are $N$ items and $M$ of them are marked, this algorithm performs a fixed-point quantum search using $O(\sqrt{N/M}\log(1/\epsilon))$ queries with error bounded by $\epsilon$. In addition, we present a continuous-time version of this algorithm in terms of Lindblad evolution.

Tuesday, April 24, 2018 2:00 pm - 2:00 pm EDT (GMT -04:00)

Quantum Computing - A Quantum Algorithm for Simulating Non-sparse Hamiltonians

PhD Seminar

Chunhao Wang, PhD candidate

David R. Cheriton School of Computer Science

We present a quantum algorithm for simulating the dynamics of Hamiltonians that are not necessarily sparse. Our algorithm is based on the assumption that the entries of the Hamiltonian are stored in a data structure that allows for the efficient preparation of states that encode the rows of the Hamiltonian. We use a linear combination of quantum walks to achieve a poly-logarithmic dependence on the precision. 

Thursday, April 26, 2018 12:00 pm - 12:00 pm EDT (GMT -04:00)

Transformative Quantum Technologies (TQT) Lunch and Learn

Technology Investment and Mentorship

Researchers and early-stage companies may discover numerous investment options on their path to commercial success. While some mechanisms focus on a certain phase of technology development, others promise to fuel growth over a wide R,D&D spectrum, possibly independent of prior investment status. This panel covers a sampling of programs and investment strategies - from technology scouting to angel capital - for mobilizing intellectual property towards impactful deployment. 

Panel:

Thursday, April 26, 2018 7:00 pm - 7:00 pm EDT (GMT -04:00)

Entangled: The series – QUANTUM + Literature

Chad Orzel, Union College
The invention of quantum physics in the early 20th century forced scientists to reconsider many cherished ideas from classical physics, leading to revolutionary changes in our scientific and philosophical understanding of the universe. Quantum phenomena have also proven to be a rich source of metaphors and inspiration for fiction.