Lo, H. K., Spiller, T., & Popescu, S. (1998). *Introduction to quantum computation and information*. World Scientific.

This book explains to basics of quantum mechanics and of quantum computation in a easy understandable manner. Really useful if you are new to the topic and a suprisingly good read.

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Bernstein, D. J., Buchmann, J., & Dahmen, E. (Eds.). (2009). *Post-quantum cryptography*. Springer Science & Business Media.

This book explains which encryption algorithms can be cracked by quantum computation. Also it discusses which algorithms could be used instead.

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Shor, P. W. (1999). *Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer.* SIAM review, 41(2), 303-332.

This is the paper in which Shor proposed his algorithm. It is one of two very important algorithms in quantum computation, which is reflected in 5,702 citations. The algorithm can factorize integers far faster than algorithms that run on classical computers which is why quantum computers will be really good at cracking RSA encryption (and a few others).

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Grover, L. K. (1996, July). A fast quantum mechanical algorithm for database search. In *Proceedings of the twenty-eighth annual ACM symposium on Theory of computing* (pp. 212-219). ACM.

This is the paper in which Grover’s algorithm, the other really important one, was proposed. The algorithm is far faster at finding certain entries in lists or databases than any conventional algorithm.

The paper was cited 3522 times.

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Gottesman, D., & Lo, H. K. (2001). *From quantum cheating to quantum security.* arXiv preprint quant-ph/0111100.

This paper explains why both algorithms are dangerous to certain encryption techniques. It was only cited 59 times(not much in comparison to the others), but all papers by the same author I came across seem trustworthy. Also he is one of the co-authors of the book I mentioned first, which was cited 347 times and made a positive impression on me.

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

I found a few other books and papers but I barely skimmed most of them. I didn’t even finish everything I mentioned (two technical books and three longish papers take a bit of time to read), so I have much to read.

It is possible, that I will leave some of the topics covered by the papers and books above out. But I am new to this topic so everything mentioned above is interesting and could prove useful later.

Hi Norman,

thanks for this inside into quantum computation! I have the impression that you know what is important about the topic and that you chose the most important texts for quantum computation as well as for quantum computation in connection with encryption. As you wrote yourself and we had talked about today, it is still rather broad and I am looking forward to your decision on what you would like to focus.

One thing that confuses me about the choice of your papers is that they are rather “old”. As you said today, quantum computation is still at its beginnings, but then I guess there must be some progress during recent years. So, maybe some more recent papers help gain an insight into the actual state of the art concerning single aspects of quantum computing 🙂

Have a nice long weekend and see you next week!