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

arXiv:quant-ph/0602082 · Journal of Physics A Mathematical and General

Quantum hypercomputation based on the dynamical algebra

A Sicard, J Ospina, M Vélez

Published Sep 19, 2006• 4 citations
arXivHTMLPDF

Abstract

An adaptation of Kieu's hypercomputational quantum algorithm (KHQA) is presented. The method that was used was to replace the Weyl–Heisenberg algebra by other dynamical algebra of low dimension that admits infinite-dimensional irreducible representations with naturally defined generalized coherent states. We have selected the Lie algebra , because this algebra possesses the necessary characteristics to realize the hypercomputation and also because such algebra has been identified as the dynamical algebra associated with many relatively simple quantum systems. In addition to an algebraic adaptation of KHQA over the algebra , we presented an adaptation of KHQA over some concrete physical referents: the infinite square well, the infinite cylindrical well, the perturbed infinite cylindrical well, the Pöschl–Teller potentials, the Holstein–Primakoff system and the Laguerre oscillator. We conclude that it is possible to have many physical systems within condensed matter and quantum optics in which it is possible to consider an implementation of KHQA.

DOI
10.1088/0305-4470/39/40/018

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

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

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

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.

Ingeniería y Ciencia•Jan 1, 2006•2 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

Quantum Mechanics as a Generalization of Nambu Dynamics to the Weyl-Wigner Formalism

Iwo Białynicki‐Birula, P. J. Morrison

Abstract It is shown that Nambu dynamics can be generalized to any number of dimensions by replacing the 0(3) algebra, a prominent feature of Nambu's formulation, by an arbitrary Lie algebra. For the infinite dimensional algebra of rotations in phase space one obtains quantum mechanics in the Weyl-Wigner representation from the generalized Nambu dynamics. Also, this formulation can be cast into a canonical Hamiltonian form by a natural choice of canonically conjugate variables.

Zeitschrift für Naturforschung A•Feb 1, 1997•0 citations
An adaptation of Kieu's hypercomputational quantum algorithm (KHQA) is presented. The method that was used was to replace the Weyl–Heisenberg algebra by other dynamical algebra of low dimension that admits infinite-dimensional irreducible representations with naturally defined generalized coherent states. We have selected the Lie algebra , because this algebra possesses the necessary characteristics to realize the hypercomputation and also because such algebra has been identified as the dynamical algebra associated with many relatively simple quantum systems. In addition to an algebraic adaptation of KHQA over the algebra , we presented an adaptation of KHQA over some concrete physical referents: the infinite square well, the infinite cylindrical well, the perturbed infinite cylindrical well, the Pöschl–Teller potentials, the Holstein–Primakoff system and the Laguerre oscillator. We conclude that it is possible to have many physical systems within condensed matter and quantum optics in which it is possible to consider an implementation of KHQA.
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.
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.
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.