Tight Binding Hamiltonians and Quantum Turing Machines
- 27 January 1997
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 78 (4) , 590-593
- https://doi.org/10.1103/physrevlett.78.590
Abstract
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.All Related Versions
This publication has 23 references indexed in Scilit:
- Quantum ballistic evolution in quantum mechanics: Application to quantum computersPhysical Review A, 1996
- Perfect Quantum Error Correcting CodePhysical Review Letters, 1996
- Scheme for reducing decoherence in quantum computer memoryPhysical Review A, 1995
- Almost Any Quantum Logic Gate is UniversalPhysical Review Letters, 1995
- Universality in quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1995
- Two-bit gates are universal for quantum computationPhysical Review A, 1995
- Necessary and Sufficient Conditions for Quantum ComputationJournal of Modern Optics, 1994
- Quantum Mechanical Hamiltonian Models of ComputersaAnnals of the New York Academy of Sciences, 1986
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1985
- The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machinesJournal of Statistical Physics, 1980