Skip to main content

2019 | Buch

A Primer on Quantum Computing

verfasst von: Franklin de Lima Marquezino, Dr. Renato Portugal, Prof. Dr. Carlile Lavor

Verlag: Springer International Publishing

Buchreihe : SpringerBriefs in Computer Science

insite
SUCHEN

Über dieses Buch

This book is about quantum computing and quantum algorithms. The book starts with a chapter introducing the basic rules of quantum mechanics and how they can be used to build quantum circuits and perform computations.
Further, Grover's algorithm is presented for unstructured search discussing its consequences and applications.
Next, important techniques are discussed such as Quantum Fourier Transform and quantum phase estimation. Finally, Shor's algorithm for integer factorization is explained.
At last, quantum walks are explained in detail covering both the discrete and continuous time models,and applications of this techniques are described for the design and analyses of quantum algorithms.

Inhaltsverzeichnis

Frontmatter
Chapter 1. Introduction
Abstract
Quantum computing is a growing area of research dedicated to applying the rules of quantum mechanics to the development of more efficient algorithms. In this chapter, we give historical background and discuss the main motivations to start studying quantum computing today.
Franklin de Lima Marquezino, Renato Portugal, Carlile Lavor
Chapter 2. Bits and Qubits
Abstract
Quantum computing is an interdisciplinary field of research, and it is natural that many people starting in this area should feel uncomfortable with the fundamentals of either computer science or physics. In this chapter, we briefly review the basic concepts necessary to follow the rest of the book.
Franklin de Lima Marquezino, Renato Portugal, Carlile Lavor
Chapter 3. Grover’s Algorithm for Unstructured Search
Abstract
Grover’s algorithm is used to search for an element on an unsorted list with quadratic speed-up when compared to the best possible classical algorithm. This quantum algorithm has an enormous historical importance, and is also a fundamental building block in quantum computing.
Franklin de Lima Marquezino, Renato Portugal, Carlile Lavor
Chapter 4. Shor’s Algorithm for Integer Factorization
Abstract
Shor’s algorithm is used to find the integer factors of a large number with exponential speed-up when compared to the best known classical algorithm. The idea behind this algorithm is to reduce the original problem to that of finding the order of an integer, and then to apply the Fourier transform.
Franklin de Lima Marquezino, Renato Portugal, Carlile Lavor
Chapter 5. Quantum Walks
Abstract
Quantum walks are analogous to the classical random walks, and have important applications in quantum computation and quantum information. In this chapter, we give a gentle introduction to the first model of quantum walks—known as the coined model—, presented for the first time in 1993. Then, we consider the staggered model, which is much more recent and generalizes the most important types of quantum walks.
Franklin de Lima Marquezino, Renato Portugal, Carlile Lavor
Chapter 6. Conclusion and Further Remarks
Abstract
This book covered the essential concepts and fundamental algorithms of quantum computing. The reader that followed the book until the end should be able to follow the specialized literature and keep learning more advanced topics of research. In this final chapter, we suggest topics for further studies.
Franklin de Lima Marquezino, Renato Portugal, Carlile Lavor
Backmatter
Metadaten
Titel
A Primer on Quantum Computing
verfasst von
Franklin de Lima Marquezino
Dr. Renato Portugal
Prof. Dr. Carlile Lavor
Copyright-Jahr
2019
Electronic ISBN
978-3-030-19066-8
Print ISBN
978-3-030-19065-1
DOI
https://doi.org/10.1007/978-3-030-19066-8