Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
A quantum computation workbook
Choi M., Springer International Publishing, Cham, Switzerland, 2022. 446 pp. Type: Book (978-3-030912-13-0)
Date Reviewed: Jan 30 2023

Quantum computing is a complex and highly interdisciplinary field that assumes deep knowledge of particle physics, quantum mechanics theory, mathematics, and information theory, to name the most important disciplines outside the also essential fields of technology. This thorough and compact volume focuses almost exclusively on quantum mechanics assumptions, theorems with their proofs, and a range of specific codes in relation to a range of generic quantum mechanics algorithms.

Chapter 1 reviews a set of postulates and basic formalisms, such as state vectors, Schmidt decomposition, mixed states, and formal entanglement, with some brief explanations on the links between the principles behind the measurement of the state vector and their probabilistic interpretation. On that basis, chapter 2 gives some basic specifications for several types of quantum gates, including NOT, AND, and OR, in Dirac bra-ket or operator notations. Logically, chapter 3 looks at quantum bit specifications, CNOT, and toy models with measurement schemes, but does not address (as its title claims) any realization or technology needed in quantum computing.

Some established quantum algorithms are formalized in chapter 4: teleportation, parallelism, quantum Fourier transform, quantum phase estimation, and factorization. Going into further depth on those, chapter 6 focuses on quantum error correction and stabilizers via different approaches. This follows chapter 5’s coverage of quantum decoherence and Kraus operations and the distance between quantum states, which would have benefitted from being placed first in the chapter sequence. Finally, the interesting chapter 7 is a good attempt at bridging information theory with quantum mechanics in that it discusses the essential concept of using quantum entanglement entropy as a physical resource. Subsequently, three appendices summarize key notions in mathematics and one appendix gives solutions to selected problems formulated at the end of each chapter.

Essential companion contributions to this volume are a Mathematica software application named Q3, which allows users to conduct symbolic calculations and some simulations, and a “quantum workbook” that is a set of Wolfram notebook files providing full proofs of the quantum mechanics results in the book itself (readers can also amend these for new results). The book provides an extensive bibliography and index. The style of the exposé is to mix some explanations with detailed formal Dirac specifications or gate structures; as this approach is used from the very beginning, the book does not offer a better pedagogical progression than [1] and thus has more the character of a dense compilation. When combined with its two software companions, this volume is well suited for a advanced graduate or first-year PhD course in quantum mechanics, with ample time available for self-study. It would benefit from some clearly explained elements in particle physics and technology to illustrate the difficulties in quantum computing.

Reviewer:  L.-F. Pau Review #: CR147543 (2304-0038)
1) Kurgalin, S.; and Borzunov, S. Concise guide to quantum computing: algorithms, exercises, and implementations. Springer, Cham, Switzerland, 2021.
Bookmark and Share
  Reviewer Selected
 
 
Models Of Computation (F.1.1 )
 
 
General (G.2.0 )
 
Would you recommend this review?
yes
no
Other reviews under "Models Of Computation": Date
Brains, machines, and mathematics (2nd ed.)
Arbib M., Springer-Verlag New York, Inc., New York, NY, 1987. Type: Book (9789780387965390)
Sep 1 1988
Communication and concurrency
Milner R., Prentice-Hall, Inc., Upper Saddle River, NJ, 1989. Type: Book (9780131150072)
Jan 1 1990
The social metaphor for distributed processing
Stark W., Kotin L. Journal of Parallel and Distributed Computing 7(1): 125-147, 1989. Type: Article
Dec 1 1990
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2023 ThinkLoud®
Terms of Use
| Privacy Policy