Quantum information processing (QIP) has recently reached a new level of maturity, marked by the ability to manufacture small yet fully functional quantum computers. Specifically, universal programmable quantum computers have been demonstrated by the researchers at UMD (trapped ions QIP) and IBM (super-conducting circuits QIP), both about a year and a half ago. Further rapid progress in scaling these platforms, as well as other relevant ones, is anticipated. Google, for instance, is openly speaking about their plans to deliver a 49-qubit quantum computer in as soon as a few to several months. 

In this talk I will discuss how to program a trapped ions quantum computer to efficiently execute arbitrary abstract quantum algorithms on it. Specifically, I will focus on the techniques and algorithms used to optimize resources (gate counts, fidelity, runtime) in the implementation of quantum algorithms. I will show experimental data, including the results of benchmarking UMD trapped ions 5-qubit computer against IBM superconducting quantum computer, as well as how to use the trapped ions quantum computer to win a game with a negative classical value.