Short Introduction to Quantum Computation

Short Introduction to Quantum Computation
YQ_vjwEACAAJ
6
By:

Published on 1996 by

These qubits will likely be spin-1/2 objects. To date, only one important algorithm is known whose efficiency is based on quantum interference and entanglement: Shors' prime number factoring algorithm.

READ NOW

This paper presents a quantum lattice gas method useful for nano-scale computing and quantum computing. There are several important issues that arise when one considers fabricating nano-scale computing devices, and these issues are different depending on the type of computing one expects to do at this scale. The first type of computing, introduced by Ed Fredkin, Tom Toffoli, and Norm Margolus would be classical computing where Boolean bits that have a definite value of either 0 or 1 are still employed and where all logical gate operations are represented by unitary permutation operators causing neither any quantum mechanical superposition nor any quantum entanglement. This kind of computing may best be termed nano-scale computing. A second type of computing, introduced by Richard Feynman has been termed quantum computing where two-level quantum objects, such as spin-1/2 particles, are used to represent quantum bits or \

This Book was ranked 26 by Google Books for keyword Introduction to Quantum Computing.

The book is written in enfor NOT_MATURE

Read Ebook Now
false
false

Printed Version of this book available in
BOOK

Availability of Ebook version is falsein falseor false

Public Domain Status false

Rating by

NONE

false