A possible hypercomputational quantum algorithm

Abstract

The term `hypermachine' denotes any data processing device (theoretical or that can be implemented) capable of carrying out tasks that cannot be performed by a Turing machine. We present a possible quantum algorithm for a classically non-computable decision problem, Hilbert's tenth problem; more specifically, we present a possible hypercomputation model based on quantum computation. Our algorithm is inspired by the one proposed by Tien D. Kieu, but we have selected the infinite square well instead of the (one-dimensional) simple harmonic oscillator as the underlying physical system. Our model exploits the quantum adiabatic process and the characteristics of the representation of the dynamical Lie algebra su(1,1) associated to the infinite square well.

Title changed. Updated to the published version. Oral contribution to Quantum Information and Computation III, part of the SPIE Defense and Security Symposium 2005. 8 pages

References in corpus (9)

• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Quantum computation over continuous variables
• Temporally stable coherent states for infinite well and Pöschl-Teller potentials
• Entangled SU(2) and SU(1,1) coherent states
• A reformulation of Hilbert's tenth problem through Quantum Mechanics
• Realization of Arbitrary Gates in Holonomic Quantum Computation
• Quantum adiabatic algorithm for Hilbert's tenth problem: I. The algorithm
• Quantum Algorithm for Hilbert's Tenth Problem
• An anatomy of a quantum adiabatic algorithm that transcends the Turing computability