Inspired by Quantum Mechanics, we reformulate Hilbert's tenth problem in the domain of integer arithmetics into either a problem involving a set of infinitely coupled differential equations or a problem involving a Shrödinger propagator with some appropriate kernel. Either way, Mathematics and Physics could be combined for Hilbert's tenth problem and for the notion of effective computability.
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.
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 …
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.
To explore the limitation of a class of quantum algorithms originally proposed for the Hilbert's tenth problem, we consider two further classes of mathematically non-decidable problems, those of a modified version of the Hilbert's tenth problem and of the computation of the Chaitin's $Ω$ number, which is a representation of the Gödel's Incompletness theorem. Some interesting connection to Quantum Field Theory is pointed out.
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ödinger equations. We then present some preliminary numerical simulation results for the quantum adiabatic processes corresponding to various Diophantine equations.
We explore in the framework of Quantum Computation the notion of {\em Computability}, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm for Hilbert's tenth problem, which is equivalent to the Turing halting problem and is known to be mathematically noncomputable, is proposed where quantum continuous variables and quantum adiabatic evolution are employed. If this algorithm could be physically implemented, as much as it is valid in principle--that is, if certain hamiltonian and its ground state can be physically constructed according to the propo…
We first recall a fact which is well-known among mathematical physicists although lesser-known among theoretical physicists that the standard quantum mechanics over a complex Hilbert space, is a Hamiltonian mechanics, regarding the Hilbert space as a linear real manifold equipped with its canonical symplectic form and restricting only to the expectation-value functions of Hermitian operators. Then in this framework, we reformulate the structure of quantum mechanics in the language of symplectic manifolds and avoid linear structure of Hilbert space in such a way that the results can be stated f…
In conventional Schrödinger representation the unitarity of the evolution of bound states is guaranteed by the Hermiticity of the Hamiltonian. A non-unitary isospectral simplification of the Hamiltonian, $\mathfrak{h} \to H=Ω\,\mathfrak{h}\,Ω\neq H^\dagger$ induces the change ${\cal L} \to {\cal K}$ of the Hilbert space of states, reflected by the loss of the Hermiticity of $H\neq H^\dagger$. In such a reformulation of the theory the introduction of an {\it ad hoc} inner-product metric reconverts ${\cal K}$ into the third, correct physical Hilbert space ${\cal H}$, unitarily equivalent to ${\c…
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.
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.
The mathematical notion of incompleteness (eg of rational numbers, Turing-computable functions, and arithmetic proof) does not play a key role in conventional physics. Here, a reformulation of the kinematics of quantum theory is attempted, based on an inherently granular and discontinuous state space, in which the quantum wavefunction is associated with a finite set of finite bit strings, and the unitary transformations of complex Hilbert space are reformulated as finite permutation and related operators incorporating complex and hyper-complex structure. Such a reformulation, consistent with W…
Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then outline a quantum mechanical "algorithm" for one of the insoluble problems of mathematics, the Hilbert's tenth and equivalently the Turing halting problem. The key element of this algorithm is the {\em computability} and {\em measurability} of both the values of physical observables and of the quantum-mechanical probability distributions for these values.
In paper [Znojil M., Phys. Rev. D 78 (2008), 085003, 5 pages, arXiv:0809.2874] the two-Hilbert-space (2HS, a.k.a. cryptohermitian) formulation of Quantum Mechanics has been revisited. In the present continuation of this study (with the spaces in question denoted as ${\cal H}^{\rm (auxiliary)}$ and ${\cal H}^{\rm (standard)}$) we spot a weak point of the 2HS formalism which lies in the double role played by ${\cal H}^{\rm (auxiliary)}$. As long as this confluence of roles may (and did!) lead to confusion in the literature, we propose an amended, three-Hilbert-space (3HS) reformulation of the sa…
The hypercomputers compute functions or numbers, or more generally solve problems or carry out tasks, that cannot be computed or solved by a Turing machine. Several numerical simulations of a possible hypercomputational algorithm based on quantum computations previously constructed by the authors are presented. The hypercomputability of our algorithm is based on the fact that this algorithm could solve a classically non-computable decision problem, Hilbert's tenth problem. The numerical simulations were realized for three types of Diophantine equations: with and without solutions in non-negati…
We present a reformulation of quantum mechanics in terms of probability measures and functions on a general classical sample space and in particular in terms of probability densities and functions on phase space. The basis of our proceeding is the existence of so-called statistically complete observables and the duality between the state spaces and the spaces of the observables, the latter holding in the quantum as well as in the classical case. In the phase-space context, we further discuss joint position-momentum observables, Hilbert spaces of infinitely differentiable functions on phase spa…
A reformulation of quantum mechanics called ``hybrid interaction picture'' (HIP) is proposed. In contrast to its current non-Hermitian-interaction-picture (NIP) predecessor the new formalism combines a simplification of the NIP Hilbert-space metric with an innovative preconditioning of the observables of interest. Via an illustrative example it is shown that the idea might open new ways towards optimal model-building strategies in quantum theory of unitary systems.
We explore in the framework of Quantum Computation the notion of computability, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm that exploits the quantum adiabatic processes is considered for the Hilbert's tenth problem, which is equivalent to the Turing halting problem and known to be mathematically noncomputable. Generalised quantum algorithms are also considered for some other mathematical noncomputables in the same and of different noncomputability classes. The key element of all these algorithms is the measurability of both the values of…
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 …
Maintaining local interactions in the quantum simulation of gauge field theories relegates most states in the Hilbert space to be unphysical -- theoretically benign, but experimentally difficult to avoid. Reformulations of the gauge fields can modify the ratio of physical to gauge-variant states often through classically preprocessing the Hilbert space and modifying the representation of the field on qubit degrees of freedom. This paper considers the implications of representing SU(3) Yang-Mills gauge theory on a lattice of irreducible representations in both a global basis of projected global…
