Skip to content
ISBN: 3639057988
ISBN13: 9783639057980

Quantum Algorithms for Graph and Algebra Problems

$79.20List Price: $124.62
Save $45.42!
ISBN: 3639057988
ISBN13: 9783639057980
Formats

Conditions

A brand-new, unused copy in perfect condition.

Formats

Conditions

A brand-new, unused copy in perfect condition.

See all 1 editionsfrom $79.20

Book Overview

Quantum computing is an exciting new area between computer science and quantum physics. The computation is based on quantum mechanics. Quantum computing has the potential to demonstrate that for some problems quantum computation is more efficient than classical computation. Sebastian Dorn presents new quantum algorithms for basic problems from graph and algebra theory. First of all, he introduces several quantum search procedures, like Grover search and quantum walks. Then he presents an overview of recent quantum graph algorithms, for example shortest path and maximum flow algorithms. In the main part of this book, Sebastian Dorn gives new quantum algorithms for matching problems, graph traversal problems and independent set problems. Furthermore quantum complexity bounds for group testing problems and for problems from linear algebra are presented. All quantum algorithms are faster than the best known classical algorithms for the corresponding problems. This book will be of interest to graduate students and researchers in physics, computer science and mathematics with an interest in quantum computing, and may be used in courses on quantum algorithms." This description may be from another edition of this product.
Format:
Paperback
Language:
English
ISBN:
3639057988
ISBN13:
9783639057980
Release Date:
July 2008
Publisher:
VDM Verlag Dr. Mueller E.K.
Length:
220 Pages
Weight:
0.66 lbs.
Dimensions:
0.5″ × 6.0″ × 9.0″
MathMathematicsScience & Math

Customer Reviews

0 customer ratings | 0 reviews
Write a Review

There are currently no reviews. Be the first to review this work.