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...