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/BF01011339zbMATH Open1382.68066WikidataQ55899549 ScholiaQ55899549MaRDI QIDQ1707541FDOQ1707541
Authors: Paul A. Benioff 
Publication date: 3 April 2018
Published in: Journal of Statistical Physics (Search for Journal in Brave)
quantum spin lattices[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Schr%EF%BF%BD%EF%BF%BDdinger+equation+description+of+Turing+machines&go=Go Schr��dinger equation description of Turing machines]closed conservative systemColeman model approximationcomputer as a physical systemmicroscopic Hamiltonian models of computers
Cites Work
Cited In (only showing first 100 items - show all)
- Turbulence theories and statistical closure approaches
- MAPPING, PROGRAMMABILITY AND SCALABILITY OF PROBLEMS FOR QUANTUM SPEED-UP
- Quantum perceptron over a field and neural network architecture selection in a quantum computer
- Quantum realization of the nearest-neighbor interpolation method for FRQI and NEQR
- Quantum computing with classical bits
- Quantum double models coupled to matter fields: A detailed review for a dualization procedure
- QPCF: higher-order languages and quantum circuits
- A little bit of classical magic to achieve (super-)quantum speedup
- THE CNOT QUANTUM LOGIC GATE USING q-DEFORMED OSCILLATORS
- Quantum algorithm design: techniques and applications
- A novel quantum representation of color digital images
- Quantum-based feature selection for multiclassification problem in complex systems with edge computing
- Computational power of infinite quantum parallelism
- Quantum Perceptrons
- A one-way function from thermodynamics and applications to cryptography
- Conservative logic
- Understanding quantum entanglement by thermo field dynamics
- An improved and cost reduced quantum circuit generator approach for image encoding applications
- Automata theory based on quantum logic: Some characterizations
- On the physical implementation of logical transformations: generalized \(L\)-machines
- From quantum cellular automata to quantum lattice gases
- Duality quantum computer and the efficient quantum simulations
- Quantum cooperative search algorithm for 3-sat
- Quantum inspired evolutionary algorithm for community detection in complex networks
- Garden optimization problems for benchmarking quantum annealers
- Quantum computation and quantum information†
- Quantum walks: a comprehensive review
- The physics of quantum computation
- Hierarchy and equivalence of multi-letter quantum finite automata
- Tight Binding Hamiltonians and Quantum Turing Machines
- Application of quantum approximate optimization algorithm to job shop scheduling problem
- A note on quantum sequential machines
- Determination of equivalence between quantum sequential machines
- Quantum simulation of quantum mechanical system with spatial noncommutativity
- Consciousness: Computing the uncomputable
- Quantum computers and unstructured search: finding and counting items with an arbitrarily entangled initial state
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Quantum mechanical Hamiltonian models of discrete processes that erase their own histories: Application to Turing machines
- TOOLS FOR QUANTUM ALGORITHMS
- Quantum realization of Arnold scrambling for IFRQI
- ANALYSIS OF QUANTUM FUNCTIONS
- Entanglement and electron correlation in quantum chemistry calculations
- On the complexity of minimizing probabilistic and quantum automata
- Elementary quantum gates between long-distance qubits mediated by a resonator
- On the computational power of molecular heat engines
- Information and computation: Classical and quantum aspects
- Necessary and Sufficient Conditions for Quantum Computation
- Automata theory based on quantum logic: reversibilities and pushdown automata
- A characterization of important algorithms for quantum-dot cellular automata
- Interference as a computational resource: a tutorial
- A theory of computation based on quantum logic. I
- An application of quantum finite automata to interactive proof systems
- Quantum mechanical Hamiltonian models of Turing machines
- Optimal LSBs-based quantum watermarking with lower distortion
- Quantum walks for the determination of commutativity of finite dimensional algebras
- Theory and application of Fermi pseudo-potential in one dimension
- Uncertainty principle and minimal energy dissipation in the computer
- Quantum circuits of $ \newcommand{\cZ}{c-\mathtt{Z}} \cZ$ and $ \newcommand{\Swap}{\mathtt{SWAP}} \Swap$ gates: optimization and entanglement
- Local transition functions of quantum Turing machines
- The case for hypercomputation
- Lattice-valued general orthomodular automata
- Distributed Bernstein-Vazirani algorithm
- Least significant qubit algorithm for quantum images
- A model of discrete quantum computation
- On coverings of products of uninitialized sequential quantum machines
- The variational quantum eigensolver: a review of methods and best practices
- Realization of the Hadamard gate based on superposition of the composite solitons
- Entangling problem Hamiltonian for adiabatic quantum computation
- Physics of selective systems: Computation and biology
- Solving Bernstein and Vazirani's problem with the 2-bit permutation function
- Quantum reversible circuits for audio watermarking based on echo hiding technique
- NMR quantum computing
- A novel fault-tolerant quantum divider and its simulation
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- Topological quantum gates in homotopy type theory
- On circuit models for quantum‐classical networks
- Practical security of RSA against NTC-architecture quantum computing attacks
- Short communication: A quantum algorithm for linear PDEs arising in finance
- Natural limitations of decision procedures for arithmetic with bounded quantifiers
- High-speed train timetable optimization based on space-time network model and quantum simulator
- Implementing quantum Fourier transform using three qubits
- Existence and uniqueness of solutions of the Koopman-von Neumann equation on bounded domains
- Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report)
- An introduction to quantum computing for statisticians and data scientists
- The quantum accelerated PointNet algorithm
- Quantum-inspired algorithm with fitness landscape approximation in reduced dimensional spaces for numerical function optimization
- Distributed Grover's algorithm
- How does adiabatic quantum computation fit into quantum automata theory?
- Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability
- Quantum learning Boolean linear functions w.r.t. product distributions
- Towards quantum computational mechanics
- Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions
- Deterministic hierarchical joint remote state preparation via a non-maximally entangled state
- A survey on GANs for computer vision: recent research, analysis and taxonomy
- A systematic review of quantum benchmarking
- A binary integer programming-based method for qubit mapping in sparse architectures
- Universality and programmability of quantum computers
- An alternative formulation of the quantum phase estimation using projection-based tensor decompositions
- Entanglement and electron correlation in quantum chemistry calculations
- Quaternionic quantum automata
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1707541)
