Events

FemPhys' annual mentoring night is back! And this time we are co-hosting it with the Perimeter Institute. 

Come meet and mingle with tons of STEM mentors from all over the world. Free food will be provided by Perimeter's amazing Black Hole Bistro.

Hakop Pashayan, The University of Sydney

We present a method for estimating the probabilities of outcomes of a quantum circuit using Monte Carlo sampling techniques applied to a quasiprobability representation. Our estimate converges to the true quantum probability at a rate determined by the total negativity in the circuit, using a measure of negativity based on the 1-norm of the quasiprobability. If the negativity grows at most polynomially in the size of the circuit, our estimator converges efficiently.

Nadine Stritzelberger

In this seminar I will discuss my research, which is concerned with three different topics in the related fields of Quantum Theory, General Relativity and Cosmology.

Methods for parallel quantum circuit synthesis, fault-tolerant quantum RAM, and quantum state tomography

PhD Candidate: Olivia Di Matteo
Supervisor: Michele Mosca

Thesis available from the Science graduate office, PHY 2013.

Oral defence in QNC B204.

What does it mean to ask feminist questions of the worlds we study?

Join Aryn Martin from York University in a talk about addressing this question and whether having more women in science is the same as having more feminism in science.

Li Liu

Following my previous seminar talk on embezzlement of entanglement, this talk introduces a more general version of the problem — self-embezzlement. Instead of embezzling a pair of entangled state from a catalyst, self-embezzlement aims to create two copies of the catalyst state using only local operators. 

Shape and cutoff in superconducting qubits, work fluctuations in correlation creation, and critical commentary

Master's Candidate: Emma McKay

Daniel Kyungdeock Park, Korea Advanced Institute of Science and Technology

Machine learning is an interesting family of problems for which near-term quantum devices can provide considerable advantages. In particular, exponential quantum speedup is recently demonstrated in learning a Boolean function that calculates the parity of a randomly chosen input bit string and a hidden bit string in the presence of noise, the problem known as learning parity with noise (LPN).

Justin Thaler, Georgetown University

The quantum query complexity of a function f measures how many bits of the input a quantum computer must look at in order to compute f. 

Neil Turok, Perimeter Institute

Observations reveal the cosmos to be astonishingly simple, and yet deeply puzzling, on the largest accessible scales. Why is it so nearly symmetrical? Why is there a cosmological constant (or dark energy) and what fixes its value? How did everything we see emerge from a singular “point” in the past?