000			04112nam a2200553 i 4500
001			6812670
003			IEEE
005			20200413152851.0
006			m eo d
007			cr cn |||m|||a
008			081015s2008 caua foab 000 0 eng d
020			_a9781598296570 (electronic bk.)
020			_a9781598296563 (pbk.)
024	7		_a10.2200/S00144ED1V01Y200808QMC001 _2doi
035			_a(CaBNVSL)gtp00531469
035			_a(OCoLC)269420514
040			_aCaBNVSL _cCaBNVSL _dCaBNVSL
050		4	_aQA274.73 _b.V457 2008
082	0	4	_a519.282 _222
100	1		_aVenegas-Andraca, Salvador Elías.
245	1	0	_aQuantum walks for computer scientists _h[electronic resource] / _cSalvador Elías Venegas-Andraca.
260			_aSan Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : _bMorgan & Claypool Publishers, _cc2008.
300			_a1 electronic text (xiv, 119 p. : ill.) : _bdigital file.
490	1		_aSynthesis lectures on quantum computing ; _v#1
538			_aMode of access: World Wide Web.
538			_aSystem requirements: Adobe Acrobat Reader.
500			_aPart of: Synthesis digital library of engineering and computer science.
500			_aSeries from website.
504			_aIncludes bibliographical references (p. 105-118).
505	0		_aIntroduction -- Quantum mechanics -- Mathematical preliminaries -- Postulates of quantum mechanics -- Entanglement -- Theory of computation -- What is the theory of computation -- The birth of the theory of computation: Alan Turing and his machines -- Deterministic and nondeterministic computation -- A quick tour on algorithmic complexity and NP-completeness -- Physics and the theory of computation -- Classical random walks -- Probability theory and stochastic processes -- Classical discrete random walks: results and applications -- Stochastic algorithms based on classical discrete random walks -- Classical continuous random walks -- Quantum walks -- Quantum walk on a line -- Quantum walks on graphs -- More considerations on classical and quantum walks -- Continuous quantum walks -- Whether discrete or continuous: is it quantum random walks or just quantum walks -- How are continuous and discrete quantum walks connected -- Computer science and quantum walks -- Algorithmic applications of quantum walks -- Universality of quantum walks.
506	1		_aAbstract freely available; full-text restricted to subscribers or individual document purchasers.
510	0		_aCompendex
510	0		_aINSPEC
510	0		_aGoogle scholar
510	0		_aGoogle book search
520			_aQuantum computation, one of the latest joint ventures between physics and the theory of computation, is a scientific field whose main goals include the development of hardware and algorithms based on the quantum mechanical properties of those physical systems used to implement such algorithms. Solving difficult tasks (for example, the Satisfiability Problem and other NP-complete problems) requires the development of sophisticated algorithms, many of which employ stochastic processes as their mathematical basis. Discrete random walks are a popular choice among those stochastic processes. Inspired on the success of discrete random walks in algorithm development, quantum walks, an emerging field of quantum computation, is a generalization of random walks into the quantum mechanical world. The purpose of this lecture is to provide a concise yet comprehensive introduction to quantum walks.
530			_aAlso available in print.
588			_aTitle from PDF t.p. (viewed on October 15, 2008).
650		0	_aQuantum groups.
650		0	_aRandom walks (Mathematics)
690			_aQuantum walks.
690			_aQuantum algorithms.
690			_aQuantum information science.
690			_aQuantum computation.
690			_aUnconventional models of computation.
730	0		_aSynthesis digital library of engineering and computer science.
830		0	_aSynthesis lectures on quantum computing ; _v#1.
856	4	2	_3Abstract with links to resource _uhttp://ieeexplore.ieee.org/servlet/opac?bknumber=6812670
999			_c561620 _d561620