Related papers: Quantum search with interacting Bose-Einstein cond…
This paper presents a novel theoretical model to simulate the Unruh temperature by relating it to the critical temperature of multiple Bose-Einstein thermal baths. These thermal baths are conceptualized as snapshots of a Bose-Firework…
We introduce a two-dimensional walk model in which a random walker can only move on the first quarter of a two-dimensional plane. We calculate the partition function of this walk model using a transfer matrix method and show that the model…
In this paper we propose quantum graphs as one-dimensional models with a complex topology to study Bose-Einstein condensation and phase transitions in a rigorous way. We fist investigate non-interacting many-particle systems on quantum…
Quantum walks function as essential means to implement quantum simulators, allowing one to study complex and often directly inaccessible quantum processes in controllable systems. In this contribution, the notion of a driven Gaussian…
The quantum walk is a powerful tool to develop quantum algorithms, which usually are based on searching for a vertex in a graph with multiple marked vertices, Ambainis's quantum algorithm for solving the element distinctness problem being…
This MS thesis explores the effects and origins of a 'noise with memory' in the dynamics of an open quantum system. The system considered here is a multi-qubit register performing the Grover's quantum search algorithm. We show that a…
We study the discrete-time quantum walk-based search for a marked vertex on a graph. By considering various structures in which not all vertices are equivalent, we investigate the relationship between the successful search probability and…
In a recent work by Novo et al. (Sci. Rep. 5, 13304, 2015), the invariant subspace method was applied to the study of continuous-time quantum walk (CTQW). The method helps to reduce a graph into a simpler version that allows more…
In this paper we present a quantum algorithm that uses noise as a resource. The goal of our quantum algorithm is the calculation of operator averages of an open quantum system evolving in time. Selected low-noise system qubits and noisy…
Stochastic methods are ubiquitous to a variety of fields, ranging from Physics to Economy and Mathematics. In many cases, in the investigation of natural processes, stochasticity arises every time one considers the dynamics of a system in…
We provide numerical evidence that the nonlinear searching algorithm introduced by Wong and Meyer \cite{meyer2013nonlinear}, rephrased in terms of quantum walks with effective nonlinear phase, can be extended to the finite 2-dimensional…
We review our results on a mathematical dynamical theory for observables for open many-body quantum nonlinear bosonic systems for a very general class of Hamiltonians. We show that non-quadratic (nonlinear) terms in a Hamiltonian provide a…
A thermodynamic system of non-interacting quantum particles changes its statistical distribution formulas if there is a universal limitation for the size of energetic quantum leaps (magnitude of quantum leaps smaller than Planck energy). By…
Quantum mechanical search induces polynomial speed up in an unsorted database search process. In case of classical linear search the computational time increases with the dimensionality of the query. However, quantum parallelism, inherent…
We present a method to study the dynamics of a quasi-two dimensional Bose-Einstein condensate which contains initially many vortices at arbitrary locations. We present first the analytical solution of the dynamics in a homogeneous medium…
Quantum walks have been shown to be fruitful tools in analysing the dynamic properties of quantum systems. This article proposes to use quantum walks as an approach to Quantum Neural Networks (QNNs). QNNs replace binary McCulloch-Pitts…
We analyze prospects for the use of Bose-Einstein condensates as condensed-matter systems suitable for generating a generic ``effective metric'', and for mimicking kinematic aspects of general relativity. We extend the analysis due to Garay…
We analyze the performance of classical and quantum search algorithms from a thermodynamic perspective, focusing on resources such as time, energy, and memory size. We consider two examples that are relevant to post-quantum cryptography:…
Quantum walks provide a framework for understanding and designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a…
The dynamics of quantum systems far from equilibrium represents one of the most challenging problems in theoretical many-body physics. While the evolution is in general intractable in all its details, relevant observables can become…