Future students

Douglas Stebila, University of Waterloo

QNC building, 200 University Ave. Room 1201, Waterloo 

This workshop will provide an introduction to the Tamarin prover, which is a security protocol verification tool that analyzes cryptographic protocols in a symbolic model and can automatically identify attacks or conclude that certain classes of attacks do not exist. The workshop will include a hands-on exercise using the Tamarin prover.

To attend this program please email us at cryptoworks21@uwaterloo.ca by July 16, 2024.

Weight estimation for optical detection setups

QNC building, 200 University Ave. Room 1201, Waterloo 

Realistic models of optical detection setups are crucial for numerous quantum information tasks. For instance, squashing maps allow for more realistic descriptions of the detection setups by accounting for multiphoton detections. To apply squashing maps, one requires a population estimation of multiphoton subspaces of the input to the detection setup. So far, there has been no universal method for those subspace estimations for arbitrary detection setups.

We introduce a generic subspace estimation technique applicable to any passive linear optical setup, accounting for losses and dark counts. The resulting bounds are relevant for adversarial tasks such as QKD or entanglement verification. Additionally, this method enables a generic passive detection setup characterization, providing the necessary measurement POVM for e.g. QKD security proofs.

IQC Colloquium - Dr. Chae-Yeun Park, Xanadu

QNC building, 200 University Ave. Room QNC 1201 Waterloo 

Understanding the dynamics of quantum many-body systems is one of the fundamental objectives of physics. The existence of an efficient quantum algorithm for simulating these dynamics with reasonable resource requirements suggests that this problem might be among the first practically relevant tasks quantum computers can tackle. Although an efficient classical algorithm for simulating such dynamics is not generally expected, the classical hardness of many-body dynamics has been rigorously proven only for certain commuting Hamiltonians. In this talk, I will show that computing the output distribution of quantum many-body dynamics is classically difficult, classified as #P-hard, also for a large class of non-commuting many-body spin Hamiltonians. Our proof leverages the robust polynomial estimation technique and the #P-hardness of computing the permanent of a matrix. By combining this with the anticoncentration conjecture of the output distribution, I will argue that sampling from the output distribution generated by the dynamics of a large class of spin Hamiltonians is classically infeasible. Our findings can significantly reduce the number of qubits required to demonstrate quantum advantage using analog quantum simulators.