Please use this identifier to cite or link to this item:
Authors: Kirmayer, Asi
Keywords: Computer Science
Issue Date: 1-Jun-1995
Abstract: Recent investigations into a new model of computation, the quantum Turing Machine, suggest that this model exhibits characteristics that may admit an efficient computation of functions conjectured to be hard otherwise. This report contains a detailed discussion of the quantum Turing Machine and its relationship to the classical Turing Machines. A result by Daniel Simon highlighting the potential promise of the quantum Turing Machine is presented, followed by algorithms for efficiently solving the Discrete Log and Integer Factorization problems on the new model. Lastly, we consider some of the limitations inherent in the quantum Turing Machine.
Appears in Collections:Technical Reports

Files in This Item:
File Description SizeFormat 
1995-571-23.pdf8.3 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.