Quantum Algorithms

Livro digital

Título:
Quantum Algorithms

Autor:
Michele Mosca

Categoria:
Tecnologia > IA

Doador:
Raffaello D. N.

Sinopse:
What can a quantum computer actually do faster than a classical one? Michele Mosca's survey answers this question by cataloguing the algorithmic machinery that separates quantum from classical computation. Beginning with Deutsch, Simon, and the early algorithms that first demonstrated quantum advantage, the text builds a taxonomy around the key primitives—quantum Fourier transforms, amplitude amplification, and the hidden subgroup framework that unifies factoring and discrete logarithms. The survey ranges into less charted territory: quantum walk algorithms for spatial search and graph traversal, adiabatic optimization and its relationship to quantum annealing, and topological algorithms that exploit braiding in anyonic systems. A dedicated section on simulating quantum mechanical systems—the original motivation Feynman gave for building quantum computers—connects the algorithmic abstractions back to physics and chemistry. Written as an encyclopedia article for a reference work, this text is dense with citations and precise definitions. It assumes familiarity with the quantum circuit model and reads best as a map of the field—showing not just what was known at the time of writing but where the open problems and future directions lay.