Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Ingeniería y Ciencia

Poschl-Teller potentials based solution to Hilbert's tenth problem

Mario E. Vélez, Andrés Sicard, Juan Ospina

Published Jan 1, 2006• 2 citations
OpenAlex

Abstract

Hypercomputers compute functions or numbers, or more generally solve problems or carry out tasks, that cannot be computed or solved by a Turing machine. An adaptation of Tien D. Kieu¿s quantum hypercomputational algorithm is carried out for the dynamical algebra su(1, 1) of the Poschl-Teller potentials. The classically incomputable problem that is resolved with this hypercomputational algorithm is Hilbert¿s tenth problem. We indicated that an essential mathematical condition of these algorithms is the existence of infinitedimensional unitary irreducible representations of low dimensional dynamical algebras that allow the construction of coherent states of the Barut-Girardello type. In addition, we presented as a particular case of our hypercomputational algorithm on Poschl-Teller potentials, the hypercomputational algorithm on an infinite square well presented previously by the authors.

Related papers

A possible hypercomputational quantum algorithm

Andrés Sicard, Mario E. Vélez, Juan Ospina

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.

arXiv:quant-ph/0406137•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 25, 2005•7 citations

Hypercomputation based on quantum computing

Andrés Sicard, Mario E. Vélez, Juan Ospina

Abstract. We present a quantum algorithm for a (classically) incomputable decision problem: the Hilbert’s tenth problem; namely, we present a hypercomputation model based on quantum computation. The model is inspired by the one proposed by Tien D. Kieu. Our model exploits the quantum adiabatic process and the characteristics of the representation of the dynamical algebra su(1, 1) associated to the infinite square well. Furthermore, it is demonstrated that the model proposed is a universal quantum computation model.

•Jun 18, 2004•2 citations

Quantum algorithm of hypercomputation based on the pöschl-teller potential

Mario E. Vélez, Andrés Sicard, Juan Ospina

Se construye un algoritmo cuántico de hipercomputación con base en los potenciales PÖschl-Teller, el álgebra de Lie su(1,1) y una evolución adiabática. Este algoritmo resuelve en principio el décimo problema de Hilbert, un problema clásicamente no computable. Este algoritmo es una generalización del algoritmo propuesto por Tien D. Kieu, con base en el oscilador armónico; y del algoritmo propuesto por los autores, con base en la caja de potencial infinita

Revista de la Sociedad Colombiana de Física•Jan 1, 2006•1 citation

Computing a Turing-Incomputable Problem from Quantum Computing

Andrés Sicard, Mario E. Vélez, Juan Ospina

A hypercomputation model named Infinite Square Well Hypercomputation Model (ISWHM) is built from quantum computation. This model is inspired by the model proposed by Tien D. Kieu quant-ph/0203034 and solves an Turing-incomputable problem. For the proposed model and problem, a simulation of its behavior is made. Furthermore, it is demonstrated that ISWHM is a universal quantum computation model.

arXiv:quant-ph/0309198•Sep 26, 2003•2 citations

The quantum algorithm of Kieu does not solve the Hilbert's tenth problem

Boris S. Tsirelson

Recently T. Kieu (arXiv:quant-ph/0110136) claimed a quantum algorithm computing some functions beyond the Church-Turing class. He notes that "it is in fact widely believed that quantum computation cannot offer anything new about computability" and claims the opposite. However, his quantum algorithm does not work, which is the point of my short note. I still believe that quantum computation leads to new complexity but retains the old computability.

arXiv:quant-ph/0111009•Nov 1, 2001•14 citations

Hypercomputation: Towards an extension of the classical notion of Computability?

Gentian Kasa

The purpose of this thesis is to make an analysis of the concept of Hypercomputation and of some hypermachines. This thesis is separated in three main parts. We start in the first chapter with an analysis of the concept of Classical Computability with the Turing Machine and the Church-Turing thesis as a main reference and afterwards, in the second chapter, we continue with an analysis of hypercomputation and some hypermachines. Attention is given to the possible physical realization of these machines and their usefulness. In the third chapter a superficial introduction to Quantum Computing is made and a brief analysis to a quantum hypercomputational model, Tien D. Kieu's Adiabatic Quantum Computing.

arXiv:1210.7171•Oct 26, 2012•0 citations
Hypercomputers compute functions or numbers, or more generally solve problems or carry out tasks, that cannot be computed or solved by a Turing machine. An adaptation of Tien D. Kieu¿s quantum hypercomputational algorithm is carried out for the dynamical algebra su(1, 1) of the Poschl-Teller potentials. The classically incomputable problem that is resolved with this hypercomputational algorithm is Hilbert¿s tenth problem. We indicated that an essential mathematical condition of these algorithms is the existence of infinitedimensional unitary irreducible representations of low dimensional dynamical algebras that allow the construction of coherent states of the Barut-Girardello type. In addition, we presented as a particular case of our hypercomputational algorithm on Poschl-Teller potentials, the hypercomputational algorithm on an infinite square well presented previously by the authors.
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.
Abstract. We present a quantum algorithm for a (classically) incomputable decision problem: the Hilbert’s tenth problem; namely, we present a hypercomputation model based on quantum computation. The model is inspired by the one proposed by Tien D. Kieu. Our model exploits the quantum adiabatic process and the characteristics of the representation of the dynamical algebra su(1, 1) associated to the infinite square well. Furthermore, it is demonstrated that the model proposed is a universal quantum computation model.
The purpose of this thesis is to make an analysis of the concept of Hypercomputation and of some hypermachines. This thesis is separated in three main parts. We start in the first chapter with an analysis of the concept of Classical Computability with the Turing Machine and the Church-Turing thesis as a main reference and afterwards, in the second chapter, we continue with an analysis of hypercomputation and some hypermachines. Attention is given to the possible physical realization of these machines and their usefulness. In the third chapter a superficial introduction to Quantum Computing is made and a brief analysis to a quantum hypercomputational model, Tien D. Kieu's Adiabatic Quantum Computing.