Tag Archive for 'quantum algorithms'

Slides from TQC 2008

Last year, I gave a talk at TQC on “Quantum Algorithms for Evaluating Min-Max Trees”[1], co-authored by Dr. Richard Cleve, Dr. Dmitry Gavinsky, and myself.

In the talk, I presented an algorithm which combines the Nand tree evaluation quantum algorithm of Farhi, Goldstone, and Gutmann[2] with Grover’s search in a clever way (if I do say so myself) to evaluate Min-Max trees, with the same asymptotic cost in queries as for Nand trees.

I’ve uploaded the slides to SlideShare, and also embedded them in this post below… » [Expand post] [Permalink]

No related posts.

0 Comments

My depression in Waterloo, part 9: exposed

One of the main difficulties in coping with abusive parents is that it is often impossible to explain your motivations to others. I expressed to Dr. Cleve that I wanted to look for a research topic connected with engineering, and he was glad to assist me with this. But I never fully explained to him all of the restrictions that I was under, and I guess he must have been frustrated that I wasn’t as enthusiastic about many of his suggestions as I would have been if I didn’t have my parents’ reaction to them to consider.

Because I couldn’t find a way to disguise my research or to connect it to a topic that was acceptable to my parents, I was under a lot of stress while I carried it out. It’s very difficult to conduct scientific research unless one is excited about a topic, and it’s very difficult to be excited about a topic that causes one to experience physical and psychological pain. (I think even a masochist enjoys physical pain only because it gives him psychological pleasure.) My life in the Ph.D. program as a quantum computing researcher consisted of exactly the activities that my father had punished me so severely for in high school: … » [Expand post] [Permalink]

0 Comments