Tight Binding Hamiltonians and Quantum Turing Machines

Simple item page
dc.creatorBenioff, Paul
dc.date1996-10-17
dc.date.accessioned2026-07-07T12:33:21Z
dc.date.available2026-07-07T12:33:21Z
dc.descriptionThis paper extends work done to date on quantum computation by associating potentials with different types of computation steps. Quantum Turing machine Hamiltonians, generalized to include potentials, correspond to sums over tight binding Hamiltonians each with a different potential distribution. Which distribution applies is determined by the initial state. An example, which enumerates the integers in succession as binary strings, is analyzed. It is seen that for some initial states the potential distributions have quasicrystalline properties and are similar to a substitution sequence.
dc.description4 pages Latex, 2 postscript figures, submitted to Phys Rev Letters
dc.identifierhttps://arxiv.org/abs/quant-ph/9610026
dc.identifierhttp://arxiv.org/abs/quant-ph/9610026
dc.identifierPhys.Rev.Lett.78:590-593,1997
dc.identifierdoi:10.1103/PhysRevLett.78.590
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/217093
dc.subjectQuantum Physics
dc.subjectCondensed Matter
dc.titleTight Binding Hamiltonians and Quantum Turing Machines
dc.typetext

Files

Collections

arXiv