PhD Seminar • Quantum Computing | Quantum Information — Factoring Semi-primes With (Quantum) SAT Solvers
Please note: This PhD seminar will be given online.
Sebastian Verschoor, PhD candidate
David R. Cheriton School of Computer Science
Sebastian Verschoor, PhD candidate
David R. Cheriton School of Computer Science
Amur Ghose, Master’s candidate
David R. Cheriton School of Computer Science
Stavros Birmpilis, PhD candidate
David R. Cheriton School of Computer Science
Jesse Elliott, Master’s candidate
David R. Cheriton School of Computer Science
Seonghu (Alex) Yun, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Jesse Hoey
Fatemeh Hassani, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Ali Mashtizadeh
Linqing Liu, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Jimmy Lin
Zahra Rezapour Siahgourabi, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Ali Mashtizadeh
Zhengkun Chen, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Eric Blais
We establish a directed analogue of Chung and Tetali’s isoperimetric inequality for graph products. We use this inequality to obtain new bounds on the query complexity for testing monotonicity of Boolean-valued functions over products of general posets.
Kilby Baron, Master’s candidate
David R. Cheriton School of Computer Science
Supervisors: Professors Mike Godfrey and Mei Nagappan