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:
Thursday, November 29, 2018 1:30 pm - 1:30 pm EST (GMT -05:00)

Using macroscopic quantum systems as detectors

Swati Singh, University of Delaware

When properly engineered, simple quantum systems such as harmonic oscillators or spins can be excellent detectors of feeble forces and fields. Following a general introduction to this fast growing area of research I will focus on two simple and experimentally realizable examples: a nitrogen vacancy (NV) center in diamond interacting with its many-body environment, and acoustic modes of superfluid helium interacting with gravitational waves.

Dhinakaran Vinayagamurthy

Trusted-execution environments (TEE) like Intel SGX provide a promise for practical secure computations on users' sensitive data in untrusted computing environments like cloud and blockchains. TEEs are designed using a combination of hardware enforced access controls and cryptography. While there is extensive research on attacking and hardening the access control mechanisms, the advent of quantum computers also requires hardening the cryptography used by TEEs for their long-term security against quantum adversaries.

Thursday, November 29, 2018 5:30 pm - 5:30 pm EST (GMT -05:00)

FemPhys mentoring night

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.

Friday, November 30, 2018 11:00 am - 11:00 am EST (GMT -05:00)

Estimating outcome probabilities of quantum circuits using quasiprobabilities

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.

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. 

Friday, December 7, 2018 2:00 pm - 2:00 pm EST (GMT -05:00)

Quantum Advantage in Learning Parity with Noise

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).