Quantum mechanical Hamiltonian models of Turing machines

DOI10.1007/BF01342185zbMath0514.68055OpenAlexW2026402424WikidataQ56156226 ScholiaQ56156226MaRDI QIDQ1051429

Paul A. Benioff

Publication date: 1982

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01342185

zbMATH Keywords

nondissipative models of computersquantum spin latticesSchrödinger equation description of Turing machines

Mathematics Subject Classification ID

Quantum field theory on lattices (81T25)

Related Items (44)

Learning with Limited Samples: Meta-Learning and Applications to Communication Systems ⋮ Milestone developments in quantum information and no-go theorems ⋮ The 50\% advanced information rule of the quantum algorithms ⋮ A quantum-inspired evolutionary algorithm using Gaussian distribution-based quantization ⋮ Realization of a quantum gate using gravitational search algorithm by perturbing three-dimensional harmonic oscillator with an electromagnetic field ⋮ An efficient approach for quantum entanglement purification ⋮ Entropy flow in near-critical quantum circuits ⋮ Quantum image processing? ⋮ Emulation of high-performance correlation-based quantum clustering algorithm for two-dimensional data on FPGA ⋮ Distributed Bernstein-Vazirani algorithm ⋮ Quantum image restoration based on Hudson-Parthasarathy Schrödinger equation ⋮ Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm ⋮ On the simulation of quantum Turing machines. ⋮ THE CNOT QUANTUM LOGIC GATE USING q-DEFORMED OSCILLATORS ⋮ Quantum computation in quantum-Hall systems. ⋮ A Hamiltonian for quantum copying ⋮ The mechanism of quantum computation ⋮ Quantum Boolean image denoising ⋮ Unrelated parallel machine scheduling -- perspectives and progress ⋮ Quantum finite automata: advances on Bertoni's ideas ⋮ Quantum walks: a comprehensive review ⋮ Analytic methods in quantum computing ⋮ Quantum computation by quantumlike systems ⋮ The case for hypercomputation ⋮ Analogies and differences between quantum and stochastic automata ⋮ Prefix-free quantum Kolmogorov complexity ⋮ Finite time blowup for an averaged three-dimensional Navier-Stokes equation ⋮ Quantum circuits for calculating the squared sum of the inner product of quantum states and its application ⋮ An introduction to quantum computing for statisticians and data scientists ⋮ Some algebraic properties of measure-once two-way quantum finite automata ⋮ Teleportation of the states of motion of atoms by interaction with two-slit screens and cavities ⋮ Weakly regular quantum grammars and asynchronous quantum automata ⋮ Design of threshold segmentation method for quantum image ⋮ Organization of computations on the atomic-molecular level ⋮ Quantum automata and quantum grammars ⋮ TOOLS FOR QUANTUM ALGORITHMS ⋮ REALIZATION OF DYNAMICAL GROUP FOR A SYMMETRIC WELL POTENTIAL tan²(πx/a) AND ITS CONTROLLABILITY ⋮ On a Quantum Logical Element Associated with the Radical of a Complex Matrix ⋮ A framework for structured quantum search. ⋮ Realizable Universal Quantum Logic Gates ⋮ Regular languages accepted by quantum automata ⋮ Quantum-inspired ant lion-optimized hybrid fuzzy c-means method for fuzzy clustering and image segmentation ⋮ Solving Bernstein and Vazirani's problem with the 2-bit permutation function ⋮ Quantum neural networks

Cites Work

• Unnamed Item
• Uncertainty principle and minimal energy dissipation in the computer
• Quantum mechanical Hamiltonian models of discrete processes that erase their own histories: Application to Turing machines
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
• Irreversibility and Heat Generation in the Computing Process
• Logical Reversibility of Computation

This page was built for publication: Quantum mechanical Hamiltonian models of Turing machines