Lei Zou, Institute of Computer Science and Technology
Peking University
Edward Cheung, PhD candidate
David R. Cheriton School of Computer Science
The following is excerpted from an article by Simona Chiose, published in the Globe and Mail on April 16, 2018
When Joanne Atlee was an undergraduate student in computer science, more than a third of her class was made up of women. In graduate school, those ranks began to thin out, a decline that has continued through much of her career as a professor at the University of Waterloo.
“All of a sudden I am an instructor at Waterloo and 10 per cent of the class is female and it’s ‘Oh no, what happened?’”
Rafael Olaechea Velazco, PhD candidate
David R. Cheriton School of Computer Science
Software behavioural models, such as finite state machines, are used as an input to model checking tools to verify that software satisfies its requirements. As constructing such models by hand is time-consuming and error-prone, researchers have developed tools to automatically extract such models from systems’ execution traces.
Weicong Ma, Master’s candidate
David R. Cheriton School of Computer Science
Chunhao Wang, PhD candidate
David R. Cheriton School of Computer Science
We present a quantum algorithm for simulating the dynamics of Hamiltonians that are not necessarily sparse. Our algorithm is based on the assumption that the entries of the Hamiltonian are stored in a data structure that allows for the efficient preparation of states that encode the rows of the Hamiltonian. We use a linear combination of quantum walks to achieve a poly-logarithmic dependence on the precision.
Chunhao Wang, PhD candidate
David R. Cheriton School of Computer Science
We give a dissipative quantum search algorithm that is based on a novel dissipative query model. If there are $N$ items and $M$ of them are marked, this algorithm performs a fixed-point quantum search using $O(\sqrt{N/M}\log(1/\epsilon))$ queries with error bounded by $\epsilon$. In addition, we present a continuous-time version of this algorithm in terms of Lindblad evolution.
Magnus Madsen
Aalborg University, Denmark
Most software contains bugs, unintended behavior that causes the program to misbehave or crash. Developers wish to avoid bugs, but are easily led astray by the complexity of modern programming languages. How can we help them? A possible solution is to develop program analysis techniques that can automatically reason about the behavior of programs and pinpoint potential problems.
Dimitrios Skrepetos, PhD candidate
David R. Cheriton School of Computer Science