Tight Binding Hamiltonians and Quantum Turing Machines

Phys. Rev. Lett. 78, 590 – Published 27 January 1997
Paul Benioff


This paper extends work done to date on quantum computation by association of potentials with different types of 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.

DOI: http://dx.doi.org/10.1103/PhysRevLett.78.590

  • Received 20 June 1996
  • Published in the issue dated 27 January 1997

© 1997 The American Physical Society

Authors & Affiliations

Paul Benioff

  • Physics Division, Argonne National Laboratory, Argonne, Illinois 60439

References (Subscription Required)

Authorization Required


Download & Share

PDF Export Citing Articles (6)



Log In



Article Lookup
Paste a citation or DOI

Enter a citation
  1. Enter a citation to look up or terms to search.

    Ex: "PRL 112 068103", "Phys. Rev. Lett. 112, 068103", "10.1103/PhysRevLett.112.068103"