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/0407090 · International Journal of Quantum Information

AN ANATOMY OF A QUANTUM ADIABATIC ALGORITHM THAT TRANSCENDS THE TURING COMPUTABILITY

Tien D. Kieu

Published Dec 17, 2004• 18 citations
arXivHTMLPDF

Abstract

We give an update on a quantum adiabatic algorithm for the Turing noncomputable Hilbert's tenth problem, and briefly go over some relevant issues and misleading objections to the algorithm.
DOI
10.1142/s0219749905000712

Related papers

Quantum algorithms for the Hilbert's tenth problem

Tien D. Kieu

A quantum algorithm is presented for the classically non-computable Hilbert's tenth problem, which ultimately links to the Turing halting problem.

•Oct 24, 2001•5 citations

Quantum Algorithm for Hilbert's Tenth Problem

Tien D. Kieu

arXiv:quant-ph/0110136•International Journal of Theoretical Physics•Jul 1, 2003•81 citations

INTRODUCING ADIABATIC QUANTUM COMPUTATION

Huazhong Li

Recent applications of quantum adiabatic approximation to quantum computation are reviewed.We discuss the adiabatic quantum algorithm and the recent discovery of inconsistency of quantum adiabatic theorem giving impact to this application.

Progress in physics•Jan 1, 2008•0 citations

REVIEW ON QUANTUM CHAOS ALGORITHM AND GENERALIZED QUANTUM TURING MACHINE

Satoshi Iriyama, Makoto Ohya

Quantum Bio-Informatics•Mar 1, 2008•3 citations

Numerical simulations of a quantum algorithm for Hilbert's tenth problem

Kieu, T D

We employ quantum mechanical principles in the computability exploration of the class of classically noncomputable Hilbert's tenth problem which is equivalent to the Turing halting problem in Computer Science. The Quantum Adiabatic Theorem enables us to establish a connection between the solution for this class of problems and the asymptotic behaviour of solutions of a particular type of time-dependent Schr\\"odinger equations. We then present some preliminary numerical simulation results for the quantum adiabatic processes corresponding to various Diophantine equations.

•Apr 16, 2003•12 citations

How Powerful is Adiabatic Quantum Computation

Wim van Dam, Michele Mosca, Umesh V. Vazirani

We analyze the computational power and limitations of the recently proposed 'quantum adiabatic evolution algorithm'.

•Jan 1, 2001•190 citations
We employ quantum mechanical principles in the computability exploration of the class of classically noncomputable Hilbert's tenth problem which is equivalent to the Turing halting problem in Computer Science. The Quantum Adiabatic Theorem enables us to establish a connection between the solution for this class of problems and the asymptotic behaviour of solutions of a particular type of time-dependent Schr\\"odinger equations. We then present some preliminary numerical simulation results for the quantum adiabatic processes corresponding to various Diophantine equations.