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/0111020

Reply to ``The quantum algorithm of Kieu does not solve the Hilbert's tenth problem"

Tien D. Kieu

Published Nov 3, 2001• 8 citations
arXivHTMLPDF

Abstract

The arguments employed in quant-ph/0111009, to claim that the quantum algorithm in quant-ph/0110136 does not work, are so general that were they true then the adiabatic theorem itself would have been wrong. As a matter of fact, those arguments are only valid for the sudden approximation, not the adiabatic process.
DOI
10.48550/arxiv.quant-ph/0111020

Related papers

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•12 citations

Reply to `No Contradictions between Bohmian and quantum mechanics'

Partha Ghose

Marchildon's claim (quant-ph/0007068) regarding Ghose's papers (quant-ph/0001024 and 0003037) is shown to be erroneous.

arXiv:quant-ph/0008007•Aug 1, 2000•3 citations

Reply to "Comment on: A Quantum Approach to Static Games of Complete Information"

L. MARINATTO, WEBER, TULLIO

This is a reply to the paper by S.C.Benjamin, quant-ph/0008127.

•Jan 1, 2000•19 citations

Reply to Comment: Quantum Cryptography Based on Orthogonal States?

Lior Goldenberg, Lev Vaidman A

This is our Reply to Peres' Comment [quant-ph/9509003] to "Quantum Cryptography Based on Orthogonal States" [Phys. Rev. Lett. 75, 1239 (1995)].

arXiv:quant-ph/9604029•Apr 25, 1996•3 citations

Reply to: Quantum mechanical rules for observed observers and the consistency of quantum theory

Lídia del Rio, Renato Renner

•Jan 1, 2024•0 citations

Quantum adiabatic algorithm for Hilbert's tenth problem: I. The algorithm

Tien D. Kieu

We review the proposal of a quantum algorithm for Hilbert's tenth problem and provide further arguments towards the proof that: (i) the algorithm terminates after a finite time for any input of Diophantine equation; (ii) the final ground state which contains the answer for the Diophantine equation can be identified as the component state having better-than-even probability to be found by measurement at the end time--even though probability for the final ground state in a quantum adiabatic process need not monotonically increase towards one in general. Presented finally are the reasons why our algorithm is outside the jurisdiction of no-go arguments previously employed to show that Hilbert's tenth problem is recursively non-computable.

arXiv:quant-ph/0310052•Oct 8, 2003•26 citations
We review the proposal of a quantum algorithm for Hilbert's tenth problem and provide further arguments towards the proof that: (i) the algorithm terminates after a finite time for any input of Diophantine equation; (ii) the final ground state which contains the answer for the Diophantine equation can be identified as the component state having better-than-even probability to be found by measurement at the end time--even though probability for the final ground state in a quantum adiabatic process need not monotonically increase towards one in general. Presented finally are the reasons why our algorithm is outside the jurisdiction of no-go arguments previously employed to show that Hilbert's tenth problem is recursively non-computable.