Introduction to Quantum Computers by Gennady P Berman (PDF)

Description

Quantum computing promises to solve problems which are intractable on digital computers. Highly parallel quantum algorithms can decrease the computational time for some problems by many orders of magnitude. This important book explains how quantum computers can do these amazing things. Several algorithms are illustrated: the discrete Fourier transform, Shor’s algorithm for prime factorization; algorithms for quantum logic gates; physical implementations of quantum logic gates in ion traps and in spin chains; the simplest schemes for quantum error correction; correction of errors caused by imperfect resonant pulses; correction of errors caused by the nonresonant actions of a pulse; and numerical simulations of dynamical behavior of the quantum Control-Not gate. An overview of some basic elements of computer science is presented, including the Turing machine, Boolean algebra, and logic gates. The required quantum ideas are explained.

User’s Reviews

Reviews from Amazon users which were colected at the time this book was published on the website:

⭐My professor is one of the authors. Its a decent book for how small it is. Very smart guy. Hard stuff to learn though. This is not a causal read.

⭐The book is full of great research. Complicated, so be ready!

⭐This 187-page 6″x8″ paperback book takes on the difficult topic of quantum computation in a way that is accessible to a non-expert like myself. In 29 brief chapters (each averaging 6 pages) the authors present ideas in small enough pieces that the reader is not completely overwhelmed with mathematics and jargon. Still, I found it somewhat difficult to orient myself after first picking up this book.In the end I relied on the approach that I generally adopt in studying new topics: that of finding the chapter that seemed the most interesting and reading it first. For me this was Chapter 4 “The Quantum Computer” (pp.20-30) in which two groups (i.e. registers) of quantum bits (i.e. qubits) are related by a digital Fourier transform. This approach, known as Shor’s algorithm, is able to quickly extract the period of an periodic function (e.g. cosine) encoded into one of the series of qubits corresponding to a quantum register. This algorithm is also the foundation for code breaking that involves factoring a product into prime numbers.Once I had studied Shor’s algorithm, which I found quite exciting, I was sufficiently hooked to review the introductory chapters on Boolean algebra, and go on to read about circuit diagrams for such things as NAND gates. The authors also introduce the reader to physical systems, such as ion traps, that can be used as the building blocks for qubits and quantum logic gates.This book is written at a level accessible to advanced college undergraduates majoring in science and engineering who have taken a junior level modern physics course that addresses the Schrodinger equation and its solutions. The reader also needs to be familiar with Dirac’s bra-ket notation, which is used extensively throughout this book. The reader who has successfully absorbed

⭐would certainly have the proper background for understanding this book.

⭐This book is written in fairly simple language is is not difficult to comprehend. On the other hand, it talks about very advanced technologies that use completely new medium of computer structure. It’s just extremely interesting to read. If this technology will work in the future, becoming practical rather than theoretical, our world will never be the same.

⭐

Keywords

Free Download Introduction to Quantum Computers in PDF format
Introduction to Quantum Computers PDF Free Download
Download Introduction to Quantum Computers 1998 PDF Free
Introduction to Quantum Computers 1998 PDF Free Download
Download Introduction to Quantum Computers PDF
Free Download Ebook Introduction to Quantum Computers