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/0504021 · Springer eBooks

Numerical Simulations of a Possible Hypercomputational Quantum Algorithm

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

Published Dec 7, 2005• 5 citations
arXivHTMLPDF
DOI
10.1007/3-211-27389-1_65

Related papers

Quantum Hypercomputation

Tien D. Kieu

Minds and Machines•Nov 1, 2002•33 citations

Hypercomputation with quantum adiabatic processes

Tien D. Kieu

Theoretical Computer Science•Jan 2, 2004•32 citations

Relativistic and Quantum Hypercomputation

Springer eBooks•Jan 1, 2008•0 citations

On quantum computational algorithms

이수준

•Jan 1, 2002•0 citations

Quantum hypercomputation based on the dynamical algebra

A Sicard, J Ospina, M Vélez

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.

arXiv:quant-ph/0602082•Journal of Physics A Mathematical and General•Sep 19, 2006•4 citations

Hypercomputability of quantum adiabatic processes: Fact versus Prejudices

Tien D. Kieu

We give an overview of a quantum adiabatic algorithm for Hilbert's tenth problem, including some discussions on its fundamental aspects and the emphasis on the probabilistic correctness of its findings. For the purpose of illustration, the numerical simulation results of some simple Diophantine equations are presented. We also discuss some prejudicial misunderstandings as well as some plausible difficulties faced by the algorithm in its physical implementation.

arXiv:quant-ph/0504101•Apr 14, 2005•7 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.