Faculty

Kai-Min Chung, Institute of Information Science, Academia Sinica, Taiwan

With the rapid advance of quantum technology, it may become a real
threat that an adversary can take advantage of quantum side information
at hand to break security. In this talk, we consider the problem of
multi-source randomness extraction in the presence of a quantum
adversary, who collects quantum side information from several initially
independent classical random sources. The goal is then to extract almost

Christopher Chunnilall, National Physical Laboratory, United Kingdom

National Physical Laboratory (NPL) is developing a measurement infrastructure for traceably characterising the quantum optical components of Quantum Key Distribution (QKD) systems, one of the most commercially advanced quantum technologies, and among the first to directly harness the peculiar laws of quantum physics.

Introducing the next installment of the Quantum Industry Lecture Series (QuILS). Nathan Wiebe, a former IQC postdoctoral fellow who is currently working at Microsoft, will talk to us about what it's like to work in research for a technological powerhouse.

Krysta Svore, Microsoft Research

Recently it has been shown that Repeat-Until-Success (RUS) circuits can approximate a given single-qubit unitary with an expected number of T gates of about 1/3 of what is required by optimal, deterministic, ancilla-free decompositions over the Clifford+T gate set. In this work, we introduce a more general and conceptually simpler circuit decomposition method that allows for synthesis into protocols that probabilistically implement quantum circuits over several universal gate sets including, but not restricted to, the Clifford+T gate set.

Sean Hallgren, Pennsylvania State University

Computing the group of units in a field of algebraic numbers is one of the central tasks of computational algebraic number theory. It is believed to be hard classically, which is of interest for cryptography. In the quantum setting, efficient algorithms were previously known for fields of constant degree. We give a quantum algorithm that is polynomial in the degree of the field and the logarithm of its discriminant. This is achieved by combining three new results.

Nathan Wiebe, Microsoft Research

We develop a method for approximate synthesis of single--qubit rotations of the form e^{-i f(\phi_1,\ldots,\phi_k)X} that is based on the Repeat-Until-Success (RUS) framework for quantum circuit synthesis. We demonstrate how smooth computable functions, f, can be synthesized from two basic primitives. This synthesis approach constitutes a manifestly quantum form of arithmetic that differs greatly from the approaches commonly used in quantum algorithms.

Alessandro Cosentino, IQC

I will discuss some new results we have recently obtained for the
problem of quantum states discrimination by Local Operations and

Alain Aspect, Institut d'Optique

From Einstein to Wheeler: wave particle duality for a photon

Join us for the next Quantum Frontiers Distinguished Lecture Series when Dr. Alain Aspect will talk about the weirdness of wave particle duality.