Related papers: Tight Binding Hamiltonians and Quantum Turing Mach…
The dynamics of a quantum system can be simulated using a quantum computer by breaking down the unitary into a quantum circuit of one and two qubit gates. The most established methods are the Trotter-Suzuki decompositions, for which…
In the limit of large quantum excitations, the classical and quantum probability distributions for a Schr\"odinger equation can be compared by using the corresponding WKBJ solutions whose rapid oscillations are averaged. This result is…
Entanglement is one of the key feature of quantum world that has no classical counterpart. This arises due to the linear superposition principle and the tensor product structure of the Hilbert space when we deal with multiparticle systems.…
We have developed an efficient computational method to treat long, one-dimensional systems of strongly-interacting atoms forming self-assembled spin chains. Such systems can be used to realize many spin chain model Hamiltonians tunable by…
We describe how one may go about performing quantum computation with arbitrary "quantum stuff", as long as it has some basic physical properties. Imagine a long strip of stuff, equipped with regularly spaced wires to provide input settings…
In this paper, we give random matrix theory approach to the quantum mechanics using the quantum Hamilton-Jacobi formalism. We show that the bound state problems in quantum mechanics are analogous to solving Gaussian unitary ensemble of…
Quantum computers use quantum mechanical phenomena to perform conventionally intractable calculations for specific problems. Despite being universal machines, quantum computers are not expected to replace classical computers, but rather, to…
The purpose of this thesis is to give a formal definition of quantum Kolmogorov complexity (QC), and rigorous mathematical proofs of its basic properties. The definition used here is similar to that by Berthiaume, van Dam, and Laplante. It…
As was well known, in classical computation, Turing machines, circuits, multi-stack machines, and multi-counter machines are equivalent, that is, they can simulate each other in polynomial time. In quantum computation, Yao [11] first proved…
Ab initio computations of atomic nuclei, based on Hamiltonians from effective field theories of quantum chromodynamics, are now routinely used to predict and describe properties of medium heavy nuclei, and even the heavy nucleus $^{208}$Pb…
We pursue the view that quantum theory may be an emergent structure related to large space-time scales. In particular, we consider classical Hamiltonian systems in which the intrinsic proper time evolution parameter is related through a…
We propose a scheme for scalable and robust quantum computing on two-dimensional arrays of qubits with fixed longitudinal coupling. This opens the possibility for bypassing the device complexity associated with tunable couplers required in…
Every quantum state can be represented as a probability distribution over the outcomes of an informationally complete measurement. But not all probability distributions correspond to quantum states. Quantum state space may thus be thought…
Quantum simulation is a promising near term application for mesoscale quantum information processors, with the potential to solve computationally intractable problems at the scale of just a few dozen interacting quantum systems. Recent…
We apply the atom counting theory to strongly correlated Fermi systems and spin models, which can be realized with ultracold atoms. The counting distributions are typically sub-Poissonian and remain smooth at quantum phase transitions, but…
We show that, in spite of a rather common opinion, quantum mechanics can be represented as an approximation of classical statistical mechanics. The approximation under consideration is based on the ordinary Taylor expansion of physical…
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…
A number of many-body problems can be formulated using Hamiltonians that are quadratic in the creation and annihilation operators. Here, we show how such quadratic Hamiltonians can be efficiently estimated indirectly, employing very few…
We investigate bicomplex Hamiltonian systems in the framework of an analogous version of the Schrodinger equation. Since in such a setting three different types of conjugates of bicomplex numbers appear, each is found to define in a natural…
Precision control of a quantum system requires accurate determination of the effective system Hamiltonian. We develop a method for estimating the Hamiltonian parameters for some unknown two-state system and providing uncertainty bounds on…