000 04175nam a22005175i 4500
001 978-3-031-02512-9
003 DE-He213
005 20240730163500.0
007 cr nn 008mamaa
008 220601s2008 sz | s |||| 0|eng d
020 _a9783031025129
_9978-3-031-02512-9
024 7 _a10.1007/978-3-031-02512-9
_2doi
050 4 _aQA1-939
072 7 _aPB
_2bicssc
072 7 _aMAT000000
_2bisacsh
072 7 _aPB
_2thema
082 0 4 _a510
_223
100 1 _aLanzagorta, Marco.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_978803
245 1 0 _aQuantum Computer Science
_h[electronic resource] /
_cby Marco Lanzagorta, Jeffrey Uhlmann.
250 _a1st ed. 2008.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2008.
300 _aXVI, 121 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _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 tohave 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.
650 0 _aMathematics.
_911584
650 0 _aQuantum computers.
_93985
650 0 _aQuantum physics.
_978804
650 1 4 _aMathematics.
_911584
650 2 4 _aQuantum Computing.
_910080
650 2 4 _aQuantum Physics.
_978805
700 1 _aUhlmann, Jeffrey.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_978806
710 2 _aSpringerLink (Online service)
_978807
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031013843
776 0 8 _iPrinted edition:
_z9783031036408
830 0 _aSynthesis Lectures on Quantum Computing,
_x1945-9734
_978808
856 4 0 _uhttps://doi.org/10.1007/978-3-031-02512-9
912 _aZDB-2-SXSC
942 _cEBK
999 _c84661
_d84661