Future graduate students

Mark Howard & Earl T. Campbell

Motivated by their necessity for most fault-tolerant quantum computation schemes, we formulate a resource theory for magic states. We first show that robustness of magic is a well-behaved magic monotone that operationally quantifies the classical simulation overhead for a Gottesman-Knill type scheme using ancillary magic states. Our framework subsequently finds immediate application in the task of synthesizing non-Clifford gates using magic states.

Hsi-Sheng Goan - Department of Physics and Center for Quantum Science and Engineering, National Taiwan University, Taipei

An essential prerequisite for quantum information processing is precise coherent control of the dynamics of quantum systems or quantum bits (qubits). Most of the control sequences implemented in quantum experiments are developed and designed based on the assumption of having ideal (closed) quantum coherent systems.

Chris Ferrie: Quantum Physics for Babies 

WIN/IQC Joint Distinguished Lecture

Philip Kim is an experimental condensed matter physicist. The focus of Kim’s group’s research is the mesoscopic investigation of various physical phenomena in low dimensional and nanostructured materials.

Dimensionality-driven orthorhombic MoTe₂ at room temperature.

Joey Zhong

Colloquium featuring Heejeong Jeong - Hong Kong University of Science and Technology

Optical precursors are transient electromagnetic wave packets propagating precisely at the speed of light in vacuum through a dispersive and absorptive dielectric. Even though its existence was conjectured by Sommerfeld and Brillouin 100 years ago, the detection seemed to be impossible due to its exceedingly small amplitude and femtosecond time scale in ordinary linear dispersive media. 

Characterizing drift qubits

Timothy Proctor, Sandia National Laboratories

It is essential to benchmark and characterize real-world qubits in order to understand whether they are of sufficient quality for quantum information tasks, and if they are not, so that they can be debugged. Many techniques are designed for qubits that stay constant in time, but in reality almost all qubits suffer from some form of time-dependence.

Efficient quantum memory in naturally trapped Rare-Earth ions

Mahmood Sabooni, IQC

The ability to map, store quantum states of light (e. g. single photon) to matter and later retrieve is one of the important building blocks of quantum information processing. Such a device is called a quantum memory for light.

Complexity of quantum impurity models

Sergey Bravyi, IBM Research

I will discuss classical and quantum algorithms for simulation of quantum impurity models. Such models describe a bath of free fermions coupled to a small interacting subsystem called an impurity. Hamiltonians of this form were famously studied by Anderson, Kondo, Wilson and others in 1960s.

Constraint Propagation Games

Zhengfeng Ji, University of Technology, Sydney

Constraint propagation games are simple extended nonlocal games that are motivated by the propagation checking of quantum computation and have found powerful applications in the study of quantum proof systems recently. In this talk, we will introduce their definitions and basic properties, demonstrate their uses in larger games as building blocks, and illustrate the method that turns them into nonlocal games.