An anatomy of a quantum adiabatic algorithm that transcends the Turing computability

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.Comment: 7 pages, no figure. Submitted to the Proceedings of the conference "Foundations of Quantum Information" (April 2004, Camerino, Italy

A reformulation of Hilbert's tenth problem through Quantum Mechanics

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\"odinger 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

Quantum Heat Engines, the Second Law and Maxwell's Daemon

We introduce a class of quantum heat engines which consists of two-energy-eigenstate systems, the simplest of quantum mechanical systems, undergoing quantum adiabatic processes and energy exchanges with heat baths, respectively, at different stages of a cycle. Armed with this class of heat engines and some interpretation of heat transferred and work performed at the quantum level, we are able to clarify some important aspects of the second law of thermodynamics. In particular, it is not sufficient to have the heat source hotter than the sink, but there must be a minimum temperature difference between the hotter source and the cooler sink before any work can be extracted through the engines. The size of this minimum temperature difference is dictated by that of the energy gaps of the quantum engines involved. Our new quantum heat engines also offer a practical way, as an alternative to Szilard's engine, to physically realise Maxwell's daemon. Inspired and motivated by the Rabi oscillations, we further introduce some modifications to the quantum heat engines with single-mode cavities in order to, while respecting the second law, extract more work from the heat baths than is otherwise possible in thermal equilibria. Some of the results above are also generalisable to quantum heat engines of an infinite number of energy levels including 1-D simple harmonic oscillators and 1-D infinite square wells.Comment: Now 18 pages, 8 figure

Quantum Algorithm for Hilbert's Tenth Problem

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 proposal--quantum computability would surpass classical computability as delimited by the Church-Turing thesis. It is thus argued that computability, and with it the limits of Mathematics, ought to be determined not solely by Mathematics itself but also by Physical Principles