Description

Book Synopsis
Quantum 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 ofwhich 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. Table of Contents: Introduction / Quantum Mechanics / Theory of Computation / Classical Random Walks / Quantum Walks / Computer Science and Quantum Walks / Conclusions

Table of Contents
Introduction.- Quantum Mechanics.- Theory of Computation.- Classical Random Walks.- Quantum Walks.- Computer Science and Quantum Walks.- Conclusions.

Quantum Walks for Computer Scientists

Product form

£25.19

Includes FREE delivery

RRP £27.99 – you save £2.80 (10%)

Order before 4pm tomorrow for delivery by Fri 16 Jan 2026.

A Paperback by Salvador Venegas-Andraca

Out of stock


    View other formats and editions of Quantum Walks for Computer Scientists by Salvador Venegas-Andraca

    Publisher: Springer International Publishing AG
    Publication Date: 15/09/2008
    ISBN13: 9783031013836, 978-3031013836
    ISBN10: 3031013832

    Description

    Book Synopsis
    Quantum 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 ofwhich 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. Table of Contents: Introduction / Quantum Mechanics / Theory of Computation / Classical Random Walks / Quantum Walks / Computer Science and Quantum Walks / Conclusions

    Table of Contents
    Introduction.- Quantum Mechanics.- Theory of Computation.- Classical Random Walks.- Quantum Walks.- Computer Science and Quantum Walks.- Conclusions.

    Recently viewed products

    © 2026 Book Curl

      • American Express
      • Apple Pay
      • Diners Club
      • Discover
      • Google Pay
      • Maestro
      • Mastercard
      • PayPal
      • Shop Pay
      • Union Pay
      • Visa

      Login

      Forgot your password?

      Don't have an account yet?
      Create account