Meet Itay Hen, Senior Researcher at NASA working on theory of quantum computing. Itay will talk about the performance of quantum adiabatic algorithms that have known counterparts in the gate model. He will present results that support the conjecture that the complexity of adiabatic quantum computation is equivalent to the circuit-based computational model in a stronger sense than the well-known, proven polynomial equivalence between the two paradigms. He will also briefly discuss the practical importance of these algorithms, and his earlier work on solving graph isomorphism with quantum annealer.
This talk will present speaker's new research. To get up to speed, see