Staff

Wednesday, December 16, 2015 1:00 pm - 1:00 pm EST (GMT -05:00)

Seminar: Edward Chen

Nitrogen-vacancy (NV) centers in diamond nanophotonic structures for quantum networking

Edward Chen, Massachusetts Institute of Technology

The exceptional optical and spin properties of the negatively charged nitrogen-vacancy (NV) center in diamond have led to a wide range of hallmark demonstrations ranging from super-resolution imaging to quantum entanglement, teleportation, and sensing. The solid-state environment of the NV allows us to engineer nano-structures that can enhance the properties of the NV and improve the readout and initialization fidelities of the spin.

Monday, December 14, 2015 12:00 pm - 12:00 pm EST (GMT -05:00)

Seminar: Xingshan Cui

Quantum Max-flow/Min-cut

Xingshan Cui, University of California, Santa Barbara

The classical max-flow min-cut theorem describes transport through certain idealized classical networks. We consider the quantum analog for tensor networks. By associating a tensor to each node in an integral flow network, we can also interpret it as a tensor network, and more specifically, as a linear map.

Researchers in Canada, the United States and Europe led by the National Institute of Standards and Technology in Boulder, Colorado and Institute for Quantum Computing alumnus Krister Shalm have ruled out classical theories of correlation with remarkably high precision. A group including Institute for Quantum Computing members Evan Meyer-Scott, Yanbao Zhang, Thomas Jennewein, and alumnus Deny Hamel built and performed an experiment that shows the world is not governed by local realism.

Tuesday, November 10, 2015 1:00 pm - 1:00 pm EST (GMT -05:00)

Seminar: Nai-Hui Chia

How hard is deciding trivial versus non-trivial in the dihedral coset problem

Nai-Hui Chia, Pennsylvania State University

The dihedral coset problem (DCP) is an important open problem in quantum algorithms and has been studied since the early days of quantum computing. This problem attracts attention even from experts in cryptography due to its application to the lattice-based cryptosystems. It has been shown by Oded Regev in 2005 that the DCP has deep connections to the unique shortest vector problem and the random subset sum problem.

Thursday, October 15, 2015 10:00 am - Friday, March 11, 2016 4:00 pm EDT (GMT -04:00)

LIGHT Illuminated at THEMUSEUM

Celebrating light and light-based technologies

LIGHT Illuminated celebrates the United Nation's International Year of Light. In this interactive exhibition at THEMUSEUM you can learn about the value and importance of light-based technologies by exploring a black-light room, playing with colour mixing stations, and trying to get through a laser maze.

Four professors from the University of Waterloo are among the new fellows of the Royal Society of Canada (RSC) announced today, peer-elected as the best in their field.

The fellowship of the RSC consists of individuals who have made outstanding contributions in the arts, the humanities, science, and Canadian public life.