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

A mathematical proof for a ground-state identification criterion

Tien D. Kieu

Published Feb 17, 2006• 4 citations
arXivHTMLPDF

Abstract

We give a mathematical proof for an identification criterion by a probability measure for the ground state among an infinite number of available states, or a finitely truncated number with appropriate boundary conditions, in a quantum adiabatic algorithm for Hilbert's tenth problem.
DOI
10.48550/arxiv.quant-ph/0602146

Related papers

On the identification of the ground state based on occupation probabilities: An investigation of Smith's apparent counterexamples

Tien D. Kieu

We study a set of truncated matrices, given by Smith~\cite{Smith2005}, in connection to an identification criterion for the ground state in our proposed quantum adiabatic algorithm for Hilbert's tenth problem. We identify the origin of the trouble for this truncated example and show that for a suitable choice of some parameter it can always be removed. We also argue that it is only an artefact of the truncation of the underlying Hilbert spaces, through showing its sensitivity to different boundary conditions available for such a truncation. It is maintained that the criterion, in general, should be applicable provided certain conditions are satisfied. We also point out that, apart from this one, other criteria serving the same identification purpose may also be available.

arXiv:quant-ph/0602145•Feb 17, 2006•11 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•34 citations

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

Tien D. Kieu

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.

arXiv:quant-ph/0407090•International Journal of Quantum Information•Dec 17, 2004•20 citations

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

ON SUFFICIENT ALGEBRAIC CONDITIONS FOR IDENTIFICATION OF QUANTUM STATES

Andrzej Jamiołkowski

QP-PQ, quantum probability and white noise analysis•Jan 1, 2011•1 citation

Distinguishing sets of quantum states

Rahul Jain

Given two sets finite $S_0$ and $S_1$ of quantum states. We show necessary and sufficient conditions for distinguishing them by a measurement.

arXiv:quant-ph/0506205•Jun 24, 2005•5 citations
We study a set of truncated matrices, given by Smith~\cite{Smith2005}, in connection to an identification criterion for the ground state in our proposed quantum adiabatic algorithm for Hilbert's tenth problem. We identify the origin of the trouble for this truncated example and show that for a suitable choice of some parameter it can always be removed. We also argue that it is only an artefact of the truncation of the underlying Hilbert spaces, through showing its sensitivity to different boundary conditions available for such a truncation. It is maintained that the criterion, in general, should be applicable provided certain conditions are satisfied. We also point out that, apart from this one, other criteria serving the same identification purpose may also be available.
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.
Given two sets finite S0S_0S0​ and S1S_1S1​ of quantum states. We show necessary and sufficient conditions for distinguishing them by a measurement.