Related papers: Quantum search with interacting Bose-Einstein cond…
We investigate continuous-time quantum walks of two indistinguishable particles (bosons, fermions or hard-core bosons) in one-dimensional lattices with nearest-neighbour interactions. The two interacting particles can undergo independent-…
Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near-term. Adiabatic quantum computing, quantum…
Spatial search on graphs is one of the most important algorithmic applications of quantum walks. To show that a quantum-walk-based search is more efficient than a random-walk-based search is a difficult problem, which has been addressed in…
We consider a quantum Otto cycle with an interacting Bose-Einstein condensate at finite temperature. We present a procedure to evolve this system in time in three spatial dimensions, in which closed (adiabatic) strokes are described by the…
We propose a realistic scheme to implement discrete-time quantum walks in the Brillouin zone (i.e., in quasimomentum space) with a spinor Bose-Einstein condensate. Relying on a static optical lattice to suppress tunneling in real space, the…
We investigate the behavior of coherence in scattering quantum walk search on complete graph under the condition that the total number of vertices of the graph is greatly larger than the marked number of vertices we are searching, $N \gg…
Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel…
A quantum walk on a lattice is a paradigm of a quantum search in a database. The database qubit strings are the lattice sites, qubit rotations are tunneling events, and the target site is tagged by an energy shift. For quantum walks on a…
The spatial search problem aims to find a marked vertex of a finite graph using a dynamic with two constraints: (1) The walker has no compass and (2) the walker can check whether a vertex is marked only after reaching it. This problem is a…
Adiabatic quantum algorithms represent a promising approach to universal quantum computation. Whilst in a closed system these algorithms are limited by avoided level crossings, where the gap becomes exponentially small in the system size,…
We analyze the realization of a quantum-walk search algorithm in a passive, linear optical network. The specific model enables us to consider the effect of realistic sources of noise and losses on the search efficiency. Photon loss uniform…
We study scattering quantum walks on highly symmetric graphs and use the walks to solve search problems on these graphs. The particle making the walk resides on the edges of the graph, and at each time step scatters at the vertices. All of…
A quantum particle evolving by Schr\"odinger's equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace's operator. In discrete space, this is replaced by the discrete or graph Laplacian,…
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 Schrodinger…
Kronecker graphs, obtained by repeatedly performing the Kronecker product of the adjacency matrix of an "initiator" graph with itself, have risen in popularity in network science due to their ability to generate complex networks with…
It is shown that for a $N$-boson system the parity of $N$ can be responsible for a qualitative difference in the system response to variation of a parameter. The nonlinear boson model is considered, which describes tunneling of boson pairs…
We study the detailed out of equilibrium time evolution of a homogeneous Bose-Einstein condensate.We consider a nonrelativistic quantum theory for a self-interacting complex scalar field, immersed in a thermal bath, as an effective…
We study the quantum walk search algorithm of Shenvi, Kempe and Whaley [PRA 67 052307 (2003)] on data structures of one to two spatial dimensions, on which the algorithm is thought to be less efficient than in three or more spatial…
In this work we presented a derivation of the quantum hydrodynamic equations for neutral bosons. We considered short range interaction between particles. This interaction consist binary interaction $U(\textbf{r}_{i},\textbf{r}_{j})$ and…
We study spatial search with continuous-time quantum walks on real-world complex networks. We use smaller replicas of the Internet network obtained with a recent geometric renormalization method introduced by Garc\'ia-P\'erez et al., Nat.…