000			03520nam a22004815i 4500
001			978-1-4614-6336-8
003			DE-He213
005			20140220082824.0
007			cr nn 008mamaa
008			130217s2013 xxu| s |||| 0|eng d
020			_a9781461463368 _9978-1-4614-6336-8
024	7		_a10.1007/978-1-4614-6336-8 _2doi
050		4	_aQC173.96-174.52
072		7	_aPHQ _2bicssc
072		7	_aSCI057000 _2bisacsh
082	0	4	_a530.12 _223
100	1		_aPortugal, Renato. _eauthor.
245	1	0	_aQuantum Walks and Search Algorithms _h[electronic resource] / _cby Renato Portugal.
264		1	_aNew York, NY : _bSpringer New York : _bImprint: Springer, _c2013.
300			_aXII, 222 p. 37 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aQuantum Science and Technology
505	0		_aIntroduction -- The Postulates of Quantum Mechanics -- Introduction to Quantum Walks -- Grover's Algorithm and its Generalization -- Quantum Walks on Infinite Graphs -- Quantum Walks on Finite Graphs -- Limiting Distribution and Mixing Time -- Spatial Algorithms -- Hitting Time -- Appendix: Linear Algebra for Quantum Computation.
520			_aThis book addresses an interesting area of quantum computation called quantum walks, which play an important role in building quantum algorithms, in particular search algorithms. Quantum walks are the quantum analogue of classical random walks. It is known that quantum computers have great power for searching unsorted databases. This power extends to many kinds of searches, particularly to the problem of finding a specific location in a spatial layout, which can be modeled by a graph. The goal is to find a specific node knowing that the particle uses the edges to jump from one node to the next. This book is self-contained with main topics that include: Grover's algorithm, describing its geometrical interpretation and evolution by means of the spectral decomposition of the evolution operater Analytical solutions of quantum walks on important graphs like line, cycles, two-dimensional lattices, and hypercubes using Fourier transforms Quantum walks on generic graphs, describing methods to calculate the limiting distribution and mixing time Spatial search algorithms, with emphasis on the abstract search algorithm (the two-dimensional lattice is used as an example) Szedgedy's quantum-walk model and a natural definition of quantum hitting time (the complete graph is used as an example) The reader will benefit from the pedagogical aspects of the book, learning faster and with more ease than would be possible from the primary research literature. Exercises and references further deepen the reader's understanding, and guidelines for the use of computer programs to simulate the evolution of quantum walks are also provided.
650		0	_aPhysics.
650		0	_aInformation theory.
650		0	_aQuantum theory.
650	1	4	_aPhysics.
650	2	4	_aQuantum Physics.
650	2	4	_aQuantum Computing.
650	2	4	_aTheory of Computation.
650	2	4	_aQuantum Information Technology, Spintronics.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9781461463351
830		0	_aQuantum Science and Technology
856	4	0	_uhttp://dx.doi.org/10.1007/978-1-4614-6336-8
912			_aZDB-2-PHA
999			_c95646 _d95646