Searcharxiv⌕ Search

arXiv subjects

Tien D Kieu

Publications and source records attributed to Tien D Kieu.

10 recordsLinked to original sources
arXiv2006

A class of permanent magnetic lattices for ultracold atoms

We report on a class of configurations of permanent magnets on an atom chip for producing 1D and 2D periodic arrays of magnetic microtraps with non-zero potential minima and variable barrier height for trapping and manipulating ultracold atoms and quantum degenerate gases. We present analytical expressions for the relevant physical quantities and compare them with our numerical results and with some previous numerical calculations. In one of the configurations of permanent magnets, we show how it is possible by changing the angle between the crossed periodic arrays of magnets to go from a 1D array of 2D microtraps to a 2D array of 3D microtraps and thus to continuously vary the barrier heights between the microtraps. This suggests the possibility of performing a type of `mechanical' BEC to Mott insulator quantum phase transition in a magnetic lattice. We also discuss a configuration of magnets which could realize a two-qubit quantum gate in a magnetic lattice.

cond-mat.other↗
arXiv2003

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.

quant-ph↗
arXiv2003

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ö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.

quant-ph↗
arXiv2003

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

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.

quant-ph↗
arXiv2002

Quantum Principles and Mathematical Computability

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.

quant-ph↗
arXiv2001

Hilbert's Incompleteness, Chaitin's $Ω$ number and Quantum Physics

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.

quant-ph↗
arXiv1997

Measurement in Quantum Physics

The conceptual problems in quantum mechanics -- related to the collapse of the wave function, the particle-wave duality, the meaning of measurement -- arise from the need to ascribe particle character to the wave function. As will be shown, all these problems dissolve when working instead with quantum fields, which have both wave and particle character. Otherwise the predictions of quantum physics, including Bell's inequalities, coincide with those of the standard treatments. The transfer of the results of the quantum measurement to the classical realm is also discussed.

quant-ph↗
arXiv1994

Chiral gauge theory in four dimensions

A formulation of abelian and non-abelian chiral gauge theories is presented together with arguments for the unitarity and renormalisability in four dimensions. IASSNS-HEP-94/70, UM-P-94/96, and RCHEP-94/26.

hep-th↗
arXiv1994

What's Wrong with Anomalous Chiral Gauge Theory?

It is argued on general ground and demonstrated in the particular example of the Chiral Schwinger Model that there is nothing wrong with apparently anomalous chiral gauge theory. If quantised correctly, there should be no gauge anomaly and chiral gauge theory should be renormalisable and unitary, even in higher dimensions and with non-abelian gauge groups. Furthermore, mass terms for gauge bosons and chiral fermions can be generated without spoiling the gauge invariance.

hep-th↗