Related papers: Spin Chains, Graphs and State Revival
In this paper, we study the role of both "spin"(species) and mass imbalance in a mixture of two species of fermionic atoms with attractive interaction in an one-dimensional optical lattice. Using the bosonization approach, quantum phase…
We derive upper and lower bounds on the convergence behavior of certain classes of one-parameter quantum dynamical semigroups. The classes we consider consist of tensor product channels and of channels with commuting Liouvillians. We…
We call Krawtchouk-Griffiths systems, or KG-systems, systems of multivariate polynomials orthogonal with respect to corresponding multinomial distributions. The original Krawtchouk polynomials are orthogonal with respect to a binomial…
Krawtchouk's polynomials occur classically as orthogonal polynomials with respect to the binomial distribution. They may be also expressed in the form of matrices, that emerge as arrays of the values that the polynomials take. The algebraic…
The natural notion of almost perfect state transfer (APST) is examined. It is applied to the modelling of efficient quantum wires with the help of $XX$ spin chains. It is shown that APST occurs in mirror-symmetric systems, when the…
We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…
Motivated by the conduction properties of graphene discovered and studied in the last decades, we consider the quantum dynamics of a massless, charged, spin 1/2 relativistic particle in three dimensional space-time, in the presence of an…
A number of interesting features of the ground states of quantum spin chains are analized with the help of a functional integral representation of the system's equilibrium states. Methods of general applicability are introduced in the…
We study a particular class of trace-preserving completely positive maps, called PQ-channels, for which classical and quantum evolutions are isolated in a certain sense. By combining open quantum random walks with a notion of recurrence, we…
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…
The conventional spin dynamics simulations are performed in direct products of state spaces of individual spins. In a general system of n spins, the total number of elements in the state basis is >4^n. A system propagation step requires an…
A quantum walk places a traverser into a superposition of both graph location and traversal "spin." The walk is defined by an initial condition, an evolution determined by a unitary coin/shift-operator, and a measurement based on the…
We investigate quantum state transfer on a class of bipartite graphs, namely the butterfly graphs, within the framework of discrete-time quantum walks. These graphs facilitate the construction of scalable quantum networks that enable…
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$…
In this paper, we study pretty good state transfer (PGST) in Grover walks on graphs. We consider transfer of quantum states that are localized at the vertices of a graph and we use Chebyshev polynomials to analyze PGST between such states.…
The recently found hypergeometric multiple orthogonal polynomials on the step-line by Lima and Loureiro are shown to be random walk polynomials. It is proven that the corresponding Jacobi matrix and its transpose, which are nonnegative…
We propose an optical lattice setup to investigate spin chains and ladders. Electric and magnetic fields allow us to vary at will the coupling constants, producing a variety of quantum phases including the Haldane phase, critical phases,…
We count the number of walks of length n on a k-node circular digraph that cover all k nodes in two ways. The first way illustrates the transfer-matrix method. The second involves counting various classes of height-restricted lattice paths.…
Non-perturbative approaches to quantum gravity call for a deep understanding of the emergence of geometry and locality from the quantum state of the gravitational field. Without background geometry, the notion of distance should entirely…
We investigate the phase diagram of spinless fermions on a square lattice with nearest-neighbor interaction, using the recently developed projective truncation approximation in Green's function equation of motion. For attractive…