Comparison and conclusion The overlap between these three books is quite large. All three are explicitly oriented towards computer science, devoting most of their pages to the quantum circuit model and the main quantum algorithms. The contents of the Pittenger and Hirvensalo books in particular are very close. The main di erences are that Pittenger has a chapter on error-correction and his style of writing is somewhat more informal and intuitive, while Hirvensalo has a chapter on lower bounds and some more mathematical background (such as continued fractions). The KSV book o ers more than the other two books. This includes a succinct but very nice introduction to a lot of classical complexity theory, a more in-depth discussion of the quantum circuit model, and topics like quantum NP-completeness and toric codes that are not readily available in any other books. On the downside, I found its quantum part more demanding and harder to read at times than the other two books. All three books are precise and reasonably succinct introductions to the algorithmic aspects of the eld of quantum computation. As such they will be most useful to computer scientists and mathematicians who want to learn about the
/lp/association-for-computing-machinery/review-of-introduction-to-lattices-and-order-by-b-a-davey-and-h-a-05xBXBGzwW