Normal view MARC view ISBD view

Quantum algorithms via linear algebra : a primer / Richard J. Lipton and Kenneth W. Regan.

By: Lipton, Richard J [author.].
Contributor(s): Regan, Kenneth W [author.].
Material type: TextTextSeries: JSTOR eBooks.Publisher: Cambridge, Massachusetts : The MIT Press, [2014]Copyright date: ©2014Description: 1 online resource (xii, 192 pages) : illustrations.Content type: text Media type: computer Carrier type: online resourceISBN: 0262323567; 9780262323567.Subject(s): Quantum computers | Computer algorithms | Algebras, LinearAdditional physical formats: Print version:: Quantum algorithms via linear algebraDDC classification: 005.1 Online resources: Click here to view this ebook.
Contents:
Preface; Acknowledgements; 1 Introduction; 2 Numbers and Strings; 3 Basic Linear Algebra; 4 Boolean Functions, Quantum Bits, and Feasibility; 5 Special Matrices; 6 Tricks; 7 Phil's Algorithm; 8 Deutsch's Algorithm; 9 The Deutsch-Jozsa Algorithm; 10 Simon's Algorithm; 11 Shor's Algorithm; 12 Factoring Integers; 13 Grover's Algorithm; 14 Quantum Walks; 15 Quantum Walk Search Algorithms; 16 Quantum Computation and BQP; 17 Beyond; Bibliography; Index
Summary: Quantum computing explained in terms of elementary linear algebra, emphasizing computation and algorithms and requiring no background in physics.
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Call number URL Status Date due Barcode
Electronic Book UT Tyler Online
Online
QA76.889 .L57 2014 (Browse shelf) https://ezproxy.uttyler.edu/login?url=http://www.jstor.org/stable/10.2307/j.ctt17kk7rb Available ocn898214289

Includes bibliographical references and index.

Description based on print version record.

Preface; Acknowledgements; 1 Introduction; 2 Numbers and Strings; 3 Basic Linear Algebra; 4 Boolean Functions, Quantum Bits, and Feasibility; 5 Special Matrices; 6 Tricks; 7 Phil's Algorithm; 8 Deutsch's Algorithm; 9 The Deutsch-Jozsa Algorithm; 10 Simon's Algorithm; 11 Shor's Algorithm; 12 Factoring Integers; 13 Grover's Algorithm; 14 Quantum Walks; 15 Quantum Walk Search Algorithms; 16 Quantum Computation and BQP; 17 Beyond; Bibliography; Index

Quantum computing explained in terms of elementary linear algebra, emphasizing computation and algorithms and requiring no background in physics.

Reviews provided by Syndetics

CHOICE Review

Since WW II, computers have been built from vacuum tubes, transistors, and integrated circuits. The theory of computation is aligned with the on/off binary nature of these devices. Sometime in the future, there may well be computers based on quantum principles. This book by Lipton (Georgia Tech) and Regan (Univ. at Buffalo, SUNY) outlines the current state of knowledge about a theory of computation that would align with such devices. Surprisingly, the book requires no knowledge of quantum mechanics or advanced mathematics. It is based entirely on elementary linear algebra, and what is needed is briefly included in the book. However, readers do need "mathematical sophistication," the ability to understand mathematical proofs and abstract ideas. The text is very readable, giving both context and theory for quantum algorithms. The inclusion of problem sets after each chapter makes the book suitable for classroom use. It could also serve as a reference source for computer scientists. Though it does not require mathematics beyond the sophomore year, the work is best suited for upper-division and graduate students and professionals. A useful acquisition for all libraries supporting computer science degree programs. Summing Up: Recommended. Upper-division undergraduates and above. --Donald Z. Spicer, University System of Maryland

There are no comments for this item.

Log in to your account to post a comment.