Quantum Algorithms via Linear Algebra: A Primer

Quantum Algorithms via Linear Algebra: A Primer

Richard J. Lipton, Kenneth W. Regan

This creation to quantum algorithms is concise yet entire, masking many key algorithms. it truly is mathematically rigorous yet calls for minimum historical past and assumes no wisdom of quantum idea or quantum mechanics. The e-book explains quantum computation by way of uncomplicated linear algebra; it assumes the reader can have a few familiarity with vectors, matrices, and their uncomplicated homes, yet bargains a evaluate of the entire suitable fabric from linear algebra. through emphasizing computation and algorithms instead of physics, this primer makes quantum algorithms obtainable to scholars and researchers in laptop technological know-how with no the problems of quantum mechanical notation, actual thoughts, and philosophical issues.

After explaining the improvement of quantum operations and computations in keeping with linear algebra, the e-book offers the main quantum algorithms, from seminal algorithms through Deutsch, Jozsa, and Simon via Shor's and Grover's algorithms to contemporary quantum walks. It covers quantum gates, computational complexity, and a few graph thought. Mathematical proofs are typically brief and simple; quantum circuits and gates are used to light up linear algebra; and the dialogue of complexity is anchored in computational difficulties instead of desktop models.

Quantum Algorithms through Linear Algebra is acceptable for school room use or as a reference for computing device scientists and mathematicians.

Show sample text content

Download sample