Related papers: Quantum search with interacting Bose-Einstein cond…
We consider Bose-Einstein condensation of noninteracting homogeneous three-dimensional gas in canonical ensemble when both particle number $N$ and total momentum $\mathbf{P}$ of all particles are fixed. Using the saddle point method, we…
A randomly walking quantum particle evolving by Schr\"odinger's equation searches on $d$-dimensional cubic lattices in $O(\sqrt{N})$ time when $d \ge 5$, and with progressively slower runtime as $d$ decreases. This suggests that graph…
We study possible scenarios for quantum non-demolition measurements using Bose-Einstein condensates. We show that the interactions between condensate atoms makes it possible to measure the atom number with minimal back action on the system.…
We analytically investigate the recently proposed and implemented discrete-time quantum walk based on kicked ultra-cold atoms. We show how the internal level structure of the kicked atoms leads to the emergence of a relative light-shift…
Quantum computation using continuous-time evolution under a natural hardware Hamiltonian is a promising near- and mid-term direction toward powerful quantum computing hardware. We investigate the performance of continuous-time quantum walks…
We solve the unstructured search problem in constant time by computing with a physically motivated nonlinearity of the Gross-Pitaevskii type. This speedup comes, however, at the novel expense of increasing the time-measurement precision.…
The dynamics of interacting quantum vortices in a quasi-two-dimensional spatially inhomogeneous Bose-Einstein condensate, whose equilibrium density vanishes at two points of the plane with a possible presence of an immobile vortex with a…
We introduce a simple diagrammatic approach for estimating how a randomly walking quantum particle searches on a graph in continuous-time, which involves sketching small weighted graphs with self-loops and considering degenerate…
An ideal quantum walk transitions from one vertex to another with perfect fidelity, but in physical systems, the particle may be hindered by potential energy barriers. Then the particle has some amplitude of tunneling through the barriers,…
We study a Bose-Einstein condensate at the low energy limit and show that their collective dynamics exhibit interesting quantum dynamical behavior. The system undergoes a dynamical quantum phase transition after a sudden quench into a…
We present a novel scheme for universal quantum computation based on spinless interacting bosonic quantum walkers on a piecewise-constant graph, described by the two-dimensional Bose-Hubbard model. Arbitrary X and Z rotations are…
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or…
We prove two equilibrium properties of a system of interacting atoms in three or higher dimensional continuous space. (i) If the particles interact via pair potentials of a nonnegative Fourier transform, their self-organization into…
A simple model of an atomic Bose-Einstein condensate in a box whose size varies with time is studied to determine the nature of adiabaticity in the nonlinear dynamics obtained within the Gross-Pitaevskii equation (the nonlinear…
We investigate the interplay between nonlinearity and inhomogeneities in discrete-time quantum walks on one-dimensional lattices. Nonlinear effects are introduced through a Kerr-like, intensity-dependent local phase, while spatial and…
We report on the theoretical analysis of bosonic and fermionic non-interacting systems in a discrete two-particle quantum walk affected by different kinds of disorder. We considered up to 100-step QWs with a spatial, temporal and…
The coined quantum walk is a discretization of the Dirac equation of relativistic quantum mechanics, and it is the basis of many quantum algorithms. We investigate how it searches the complete bipartite graph of $N$ vertices for one of $k$…
Quantum walks have been useful for designing quantum algorithms that outperform their classical versions for a variety of search problems. Most of the papers, however, consider a search space containing a single marked element only. We show…
This paper examines the performance of spatial search where the Grover diffusion operator is replaced by continuous-time quantum walks on a class of interdependent networks. We prove that for a set of optimal quantum walk times and marked…
We formulate Grover's unstructured search algorithm as a chiral quantum walk, where transitioning in one direction has a phase conjugate to transitioning in the opposite direction. For small phases, this breaking of time-reversal symmetry…