Minha sacola

    CLASSICAL AND QUANTUM COMPUTATION

    Favoritar
    Ref:
    864856

    Calcule o frete:

    Para envios internacionais, simule o frete no carrinho de compras.

    Editora
    ISBN
    Páginas
    Idioma
    Peso
    Acabamento

    Sinopse

    This book is an introduction to a new rapidly developing theory of quantum computing. It begins with the basics of classical theory of computation: Turing machines, Boolean circuits, parallel algorithms, probabilistic computation, NP-complete problems, and the idea of complexity of an algorithm. The second part of the book provides an exposition of quantum computation theory. It starts with the introduction of general quantum formalism (pure states, density matrices, and superoperators), universal gate sets and approximation theorems. Then the authors study various quantum computation algorithms: Grover's algorithm, Shor's factoring algorithm, and the Abelian hidden subgroup problem. In concluding sections, several related topics are discussed (parallel quantum computation, a quantum analog of NP-completeness, and quantum error-correcting codes).
    Rapid development of quantum computing started in 1994 with a stunning suggestion by Peter Shor to use quantum computation for factoring large numbers--an extremely difficult and time-consuming problem when using a conventional computer. Shor's result spawned a burst of activity in designing new algorithms and in attempting to actually build quantum computers. Currently, the progress is much more significant in the former: A sound theoretical basis of quantum computing is under development and many algorithms have been suggested.

    In this concise text, the authors provide solid foundations to the theory--in particular, a careful analysis of the quantum circuit model--and cover selected topics in depth. Included are a complete proof of the Solovay-Kitaev theorem with accurate algorithm complexity bounds, approximation of unitary operators by circuits of doubly logarithmic depth. Among other interesting topics are toric codes and their relation to the anyon approach to quantum computing.

    Ficha Técnica

    Especificações

    ISBN9780821832295
    Pré vendaNão
    Peso300g
    Autor para link
    Livro disponível - pronta entregaNão
    Dimensões23 x 16 x 1.2
    IdiomaInglês
    Tipo itemLIVRO IMPORTADO ADQ MERC INTERNO
    Número de páginas272
    Número da edição1ª EDIÇÃO - 2002
    Código Interno864856
    Código de barras9780821832295
    AcabamentoPAPERBACK
    AutorKITAEV, A. YU. | SHEN, A. H. | VYALYI, M. N.
    EditoraAMERICAN MATHEMATICAL SOCIETY
    Sob encomendaNão

    Conheça outros títulos da coleção

      Este livro é vendido

      SOB ENCOMENDA

      Prazo estimado para disponibilidade em estoque: dias úteis

      (Sujeito aos estoques de nossos fornecedores)

      +

      Prazo do frete selecionado.

      (Veja o prazo total na sacola de compras)

      Comprar