An Introduction to Quantum Computing Algorithms

In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com puter.

An Introduction to Quantum Computing Algorithms

In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com puter. Since the difficulty of the factoring problem is crucial for the se curity of a public key encryption system, interest (and funding) in quan tum computing and quantum computation suddenly blossomed. Quan tum computing had arrived. The study of the role of quantum mechanics in the theory of computa tion seems to have begun in the early 1980s with the publications of Paul Benioff [6]' [7] who considered a quantum mechanical model of computers and the computation process. A related question was discussed shortly thereafter by Richard Feynman [35] who began from a different perspec tive by asking what kind of computer should be used to simulate physics. His analysis led him to the belief that with a suitable class of "quantum machines" one could imitate any quantum system.

More Books:

An Introduction to Quantum Computing Algorithms
Language: en
Pages: 140
Authors: Arthur O. Pittenger
Categories: Computers
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com puter. Since the difficulty of the factoring problem is crucial for the se curity
Introduction to Quantum Computation
Language: en
Pages: 168
Authors: Ioan Burda
Categories: Computers
Type: BOOK - Published: 2005 - Publisher: Universal-Publishers

"Introduction to Quantum Computation" is an introduction to a new rapidly developing theory of quantum computing. The book is a comprehensive introduction to the main ideas and techniques of quantum computation. It begins with the basics of classical theory of computation: NP-complete problems, Boolean circuits, Finite state machine, Turing machine
Introduction to Quantum Computers
Language: en
Pages: 187
Authors: Gennady P. Berman
Categories: Computers
Type: BOOK - Published: 1998 - Publisher: World Scientific

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
An Introduction to Quantum Computing
Language: en
Pages: 274
Authors: Phillip Kaye, Raymond Laflamme, Michele Mosca
Categories: Computers
Type: BOOK - Published: 2007 - Publisher: Oxford University Press

The authors provide an introduction to quantum computing. Aimed at advanced undergraduate and beginning graduate students in these disciplines, this text is illustrated with diagrams and exercises.
Introduction to Quantum Algorithms via Linear Algebra, second edition
Language: en
Pages: 280
Authors: Richard J. Lipton, Kenneth W. Regan
Categories: Science
Type: BOOK - Published: 2021-04-06 - Publisher: MIT Press

Quantum computing explained in terms of elementary linear algebra, emphasizing computation and algorithms and requiring no background in physics. This introduction to quantum algorithms is concise but comprehensive, covering many key algorithms. It is mathematically rigorous but requires minimal background and assumes no knowledge of quantum theory or quantum mechanics.