The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
From MaRDI portal
Publication:1707541
DOI10.1007/BF01011339zbMath1382.68066WikidataQ55899549 ScholiaQ55899549MaRDI QIDQ1707541
Publication date: 3 April 2018
Published in: Journal of Statistical Physics (Search for Journal in Brave)
quantum spin latticesSchrödinger equation description of Turing machinesclosed conservative systemColeman model approximationcomputer as a physical systemmicroscopic Hamiltonian models of computers
Related Items (92)
Quantum realization of the nearest-neighbor interpolation method for FRQI and NEQR ⋮ A one-way function from thermodynamics and applications to cryptography ⋮ Implementing quantum Fourier transform using three qubits ⋮ Duality quantum computer and the efficient quantum simulations ⋮ Quantum inspired evolutionary algorithm for community detection in complex networks ⋮ Quantum circuits of $ \newcommand{\cZ}{c-\mathtt{Z}} \cZ$ and $ \newcommand{\Swap}{\mathtt{SWAP}} \Swap$ gates: optimization and entanglement ⋮ Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report) ⋮ Quantum cooperative search algorithm for 3-sat ⋮ Theory and application of Fermi pseudo-potential in one dimension ⋮ Automata theory based on quantum logic: Some characterizations ⋮ Quantum-inspired algorithm with fitness landscape approximation in reduced dimensional spaces for numerical function optimization ⋮ Understanding quantum entanglement by thermo field dynamics ⋮ Quantum-based feature selection for multiclassification problem in complex systems with edge computing ⋮ On the physical implementation of logical transformations: generalized \(L\)-machines ⋮ Quantum computing with classical bits ⋮ Quantum perceptron over a field and neural network architecture selection in a quantum computer ⋮ Quantum learning Boolean linear functions w.r.t. product distributions ⋮ Distributed Bernstein-Vazirani algorithm ⋮ Interference as a computational resource: a tutorial ⋮ Quantum simulation of quantum mechanical system with spatial noncommutativity ⋮ A survey on GANs for computer vision: recent research, analysis and taxonomy ⋮ Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability ⋮ Quantum walks for the determination of commutativity of finite dimensional algebras ⋮ Application of quantum approximate optimization algorithm to job shop scheduling problem ⋮ Quaternionic quantum automata ⋮ Elementary quantum gates between long-distance qubits mediated by a resonator ⋮ Garden optimization problems for benchmarking quantum annealers ⋮ The quantum accelerated PointNet algorithm ⋮ Lattice-valued general orthomodular automata ⋮ Quantum double models coupled to matter fields: A detailed review for a dualization procedure ⋮ High-speed train timetable optimization based on space-time network model and quantum simulator ⋮ Distributed Grover's algorithm ⋮ A novel quantum representation of color digital images ⋮ Uncertainty principle and minimal energy dissipation in the computer ⋮ Physics of selective systems: Computation and biology ⋮ Optimal LSBs-based quantum watermarking with lower distortion ⋮ THE CNOT QUANTUM LOGIC GATE USING q-DEFORMED OSCILLATORS ⋮ Conservative logic ⋮ Quantum mechanical Hamiltonian models of discrete processes that erase their own histories: Application to Turing machines ⋮ Local Transition Functions of Quantum Turing Machines ⋮ ANALYSIS OF QUANTUM FUNCTIONS ⋮ Quantum algorithm design: techniques and applications ⋮ Automata theory based on quantum logic: reversibilities and pushdown automata ⋮ MAPPING, PROGRAMMABILITY AND SCALABILITY OF PROBLEMS FOR QUANTUM SPEED-UP ⋮ Turbulence theories and statistical closure approaches ⋮ Practical security of RSA against NTC-architecture quantum computing attacks ⋮ A little bit of classical magic to achieve (super-)quantum speedup ⋮ Least significant qubit algorithm for quantum images ⋮ NMR Quantum Computing ⋮ Quantum realization of Arnold scrambling for IFRQI ⋮ A model of discrete quantum computation ⋮ Short Communication: A Quantum Algorithm for Linear PDEs Arising in Finance ⋮ On the complexity of minimizing probabilistic and quantum automata ⋮ Quantum walks: a comprehensive review ⋮ On the computational power of molecular heat engines ⋮ On circuit models for quantum‐classical networks ⋮ Hierarchy and equivalence of multi-letter quantum finite automata ⋮ The case for hypercomputation ⋮ Computational power of infinite quantum parallelism ⋮ Determination of equivalence between quantum sequential machines ⋮ Universality and programmability of quantum computers ⋮ How does adiabatic quantum computation fit into quantum automata theory? ⋮ Information and computation: Classical and quantum aspects ⋮ Quantum computation and quantum information† ⋮ An application of quantum finite automata to interactive proof systems ⋮ Consciousness: Computing the uncomputable ⋮ A characterization of important algorithms for quantum-dot cellular automata ⋮ Entanglement and electron correlation in quantum chemistry calculations ⋮ Entanglement and electron correlation in quantum chemistry calculations ⋮ A note on quantum sequential machines ⋮ From quantum cellular automata to quantum lattice gases ⋮ On coverings of products of uninitialized sequential quantum machines ⋮ Quantum computers and unstructured search: finding and counting items with an arbitrarily entangled initial state ⋮ QPCF: higher-order languages and quantum circuits ⋮ TOOLS FOR QUANTUM ALGORITHMS ⋮ REALIZATION OF DYNAMICAL GROUP FOR A SYMMETRIC WELL POTENTIAL tan2(πx/a) AND ITS CONTROLLABILITY ⋮ Necessary and Sufficient Conditions for Quantum Computation ⋮ Quantum Perceptrons ⋮ Quantum mechanical Hamiltonian models of Turing machines ⋮ Tight Binding Hamiltonians and Quantum Turing Machines ⋮ The variational quantum eigensolver: a review of methods and best practices ⋮ Realization of the Hadamard gate based on superposition of the composite solitons ⋮ A theory of computation based on quantum logic. I ⋮ Entangling problem Hamiltonian for adiabatic quantum computation ⋮ Natural limitations of decision procedures for arithmetic with bounded quantifiers ⋮ A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY ⋮ Solving Bernstein and Vazirani's problem with the 2-bit permutation function ⋮ Quantum reversible circuits for audio watermarking based on echo hiding technique ⋮ A novel fault-tolerant quantum divider and its simulation ⋮ An improved and cost reduced quantum circuit generator approach for image encoding applications ⋮ Computational complexity of uniform quantum circuit families and quantum Turing machines ⋮ The physics of quantum computation
Cites Work
This page was built for publication: The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
