000			04013nam a22004215i 4500
999			_c386885 _d386885
001			386885
003			ES-MaUEC
005			20230131190736.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2008 sz | s |||| 0|eng d
020			_a9783031025129
024	7		_a10.1007/978-3-031-02512-9 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.889 _b2008 EB
100	1		_aLanzagorta, Marco _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686400
245	1	0	_aQuantum Computer Science _cby Marco Lanzagorta, Jeffrey Uhlmann
250			_a1st edition 2008
264		1	_aCham _bSpringer International Publishing _c2008
300			_a1 recurso en línea (XVI, 121 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_aSynthesis Lectures on Quantum Computing _x1945-9734
505	0		_aIntroduction -- The Algorithmic Structure of Quantum Computing -- Advantages and Limitations of Quantum Computing -- Amplitude Amplification -- Case Study: Computational Geometry -- The Quantum Fourier Transform -- Case Study: The Hidden Subgroup -- Circuit Complexity Analysis of Quantum Algorithms -- Conclusions -- Bibliography.
520			_aIn this text we present a technical overview of the emerging field of quantum computation along with new research results by the authors. What distinguishes our presentation from that of others is our focus on the relationship between quantum computation and computer science. Specifically, our emphasis is on the computational model of quantum computingrather than on the engineering issues associated with its physical implementation. We adopt this approach for the same reason that a book on computer programming doesn't cover the theory and physical realization of semiconductors. Another distinguishing feature of this text is our detailed discussion of the circuit complexity of quantum algorithms. To the extent possible we have presented the material in a form that is accessible to the computer scientist, but in many cases we retain the conventional physics notation so that the reader will also be able to consult the relevant quantum computing literature. Although we expect the reader to have a solid understanding of linear algebra, we do not assume a background in physics. This text is based on lectures given as short courses and invited presentations around the world, and it has been used as the primary text for a graduatecourse at George Mason University. In all these cases our challenge has been the same: how to present to a generalaudience a concise introduction to the algorithmic structure and applications of quantum computing on an extremely short period of time. The feedback from these courses and presentations has greatly aided in making our exposition of challenging concepts more accessible to a general audience. Table of Contents: Introduction / The Algorithmic Structure of Quantum Computing / Advantages and Limitations of Quantum Computing / Amplitude Amplification / Case Study: Computational Geometry / The Quantum Fourier Transform / Case Study: The Hidden Subgroup / Circuit Complexity Analysis of Quantum Algorithms / Conclusions / Bibliography.
988			_aSynthesis Collection of Technology_2008
650		7	_2embne _9166087 _aOrdenadores cuánticos
650		7	_2embne _9151819 _aAlgoritmos computacionales
700	1		_aUhlmann, Jeffrey K. _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686401
776	0	8	_iPrinted edition: _z9783031013843
776	0	8	_iPrinted edition: _z9783031036408
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-02512-9 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b01/2023 _dz _esc _zSI