Related papers: Mean Field Approximation for Identical Bosons on t…
We show under general assumptions that the mean-field approximation for quan- tum many-boson systems is correct. Our contribution unifies and improves on most of the known results. The proof uses general properties of quantization in…
We introduce a non-commutative generalization of the Gross-Pitaevskii equation for one-dimensional quantum gasses and quantum liquids. This generalization is obtained by applying the time-dependent variational principle to the variational…
In the limit of large particle numbers and low densities systems of cold atoms can be effectively described as macroscopic single particle systems in a mean-field approximation. In the case of a Bose-Hubbard system, modelling bosons on a…
Approximating the partition function of the ferromagnetic Ising model with general external fields is known to be #BIS-hard in the worst case, even for bounded-degree graphs, and it is widely believed that no polynomial-time approximation…
In this paper we consider coalescing random walks on a general connected graph $G=(V,E)$. We set up a unified framework to study the leading order of the decay rate of $P_t$, the expectation of the fraction of occupied sites at time $t$,…
High-fidelity quantum state transfer is critical for quantum communication and scalable quantum computation. Current quantum state transfer algorithms on the complete bipartite graph, which are based on discrete-time quantum walk search…
For algorithms based on interacting particle systems that admit a mean-field description, convergence analysis is often more accessible at the mean-field level. In order to transfer convergence results obtained at the mean-field level to…
This article presents a novel and succinct algorithmic framework via alternating quantum walks, unifying quantum spatial search, state transfer and uniform sampling on a large class of graphs. Using the framework, we can achieve exact…
In this paper we present an efficiently scaling quantum algorithm which finds the size of the maximum common edge subgraph for a pair of arbitrary graphs and thus provides a meaningful measure of graph similarity. The algorithm makes use of…
We discuss relations between the amenability of a graph and spectral properties of a random walk driven by a dynamical system. In order to include graphs which are not locally compact, we introduce the concept of amenability of weighted…
Using a new method it is possible to derive mean field equations from the microscopic $N$ body Schr\"odinger evolution of interacting particles without using BBGKY hierarchies. In this paper we wish to analyze scalings which lead to the…
In this paper a rigorous proof of the mean field limit for a pedestrian flow model in two dimensions is given by using a probabilistic method. The model under investigation is an interacting particle system coupled to the eikonal equation…
Suppose that we are given an arbitrary graph $G=(V, E)$ and know that each edge in $E$ is going to be realized independently with some probability $p$. The goal in the stochastic matching problem is to pick a sparse subgraph $Q$ of $G$ such…
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…
Many classical randomized algorithms (e.g., approximation algorithms for #P-complete problems) utilize the following random walk algorithm for {\em almost uniform sampling} from a state space $S$ of cardinality $N$: run a symmetric ergodic…
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact representation, inference in such models is intractable even…
We introduce a time-dependent projected Gross-Pitaevskii equation to describe a partially condensed homogeneous Bose gas, and find that this equation will evolve randomised initial wave functions to equilibrium. We compare our numerical…
We introduce a generalized Gross-Pitaevskii equation that provides a nonlinear framework for studying two-dimensional (2D) attractive Bose systems. Its defining feature is the logarithmic density dependence of the coupling constant, which…
We consider a gas of weakly interacting bosons in three dimensions subject to an external potential in the mean field regime. Assuming that the initial state of our system is a product state, we show that in the trace topology of one-body…
We study a harmonically confined Bose-Bose mixture using quantum Monte Carlo methods. Our results for the density profiles are systematically compared with mean-field predictions derived through the Gross-Pitaevskii equation in the same…