Quantum computing (Q5915347): Difference between revisions

Quantum computing was invented in early 80's and it is a computing model inspired by quantum physics. The quantum computing model is not just another exotic and obscure computing model. It is a computing model which is getting a lot of attention because some particular problems known as intractable on classic Von Newman model could be solved in polynomial time on quantum model. Famous examples are the simulation of quantum systems and integer factoring. Only, if we had a quantum computer. No quantum computer was ever build, so, no Turing machine was build neither. Meantime, the fundamental research on the quantum computing continues to develop. This book is an introductory textbook in quantum computing. It focuses more on quantum computing algorithms. The book is divided in 8 chapters. The first chapter, the introductory chapter presents the basics of quantum mechanics and probabilistic systems. This part is completed by Chapters 7,8 which are appendixes dedicated to mathematical background and quantum physics. The second chapter is dedicated to computing models. It presents the classic Turing machine and probabilistic Turing machine. Then the Turing probabilistic machine is generalized to the Quantum Turing machine. Similarly, the boolean circuits are extended Quantum circuits. The next three chapters are committed to quantum algorithms. Quantum Fourier Transform, quantum factorization of numbers, quantum search are he main topics of this part. The Chapter 6 deals with Quantum Circuits complexity. Due to extensive presentations of mathematics and physics backgrounds, the book is almost self contained. It is addressed to the professionals in computing and physics which could be interested for an introduction in quantum computing.