相关论文: Investigation of continuous-time quantum walk on r…

The ballistic conductance of a coupled $T$-shaped semiconductor quantum wire (CTQW) are studied. Two types of CTQW are considered, one of which is a $\Pi $-shaped quantum wire ($\Pi $QW) which consists of two transverse wires on the same…

Multilayer network is a potent platform which paves a way to study the interactions among entities in various networks with multiple types of relationships. In this study, the dynamics of discrete-time quantum walk on a multilayer network…

Discrete-time quantum walk (DTQW) represents a convenient mathematical framework for describing the motion of a particle on a discrete set of positions when this motion is conditioned by the values of certain internal degrees of freedom,…

In this paper, we treat quantum walks in a two-dimensional lattice with cutting edges along a straight boundary introduced by Asboth and Edge (2015 Phys.Rev. A 91 022324) in order to study one-dimensional edge states originating from…

We study continuous-time open quantum walks in one dimension through a matrix representation, focusing on nearest-neighbor transitions for which an associated weight matrix exists. Statistics such as site recurrence are studied in terms of…

In the literature, there are numerous studies of one-dimensional discrete-time quantum walks (DTQWs) using a moving shift operator. However, there is no exact solution for the limiting probability distributions of DTQWs on cycles using a…

The coherent superposition of position states in a quantum walk (QW) can be precisely engineered towards the desired distributions to meet the need of quantum information applications. The coherent distribution can make full use of quantum…

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…

We treat a quantum walk (QW) on the line whose quantum coin at each vertex tends to be the identity as the distance goes to infinity. We obtain a limit theorem that this QW exhibits localization with not an exponential but a "power-law"…

We have calculated long series expansions for self-avoiding walks and polygons on the honeycomb lattice, including series for metric properties such as mean-squared radius of gyration as well as series for moments of the area-distribution…

In large-scale quantum networks, quantum repeaters provide an efficient method to distribute entangled states among selected nodes for realizing long-distance and complicated quantum communications. However, extending quantum repeater…

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…

Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing…

We analyze continuous-time quantum walks on necklace graphs - cyclical graphs consisting of many copies of a smaller graph (pearl). Using a Bloch-type ansatz for the eigenfunctions, we block-diagonalize the Hamiltonian, reducing the…

Quantum walks are a powerful framework for the development of quantum algorithms, with lackadaisical quantum walks (LQWs) standing out as an efficient model for spatial search. In this work, we investigate how broken-link decoherence…

Inspired by the classical spectral analysis of birth-death chains using orthogonal polynomials, we study an analogous set of constructions in the context of open quantum dynamics and related walks. In such setting, block tridiagonal…

We clarify the relations between the mathematical structures that enable fashioning quantum walks on regular graphs and their realizations in anyonic systems. Our protagonist is association schemes that may be synthesized from type-II…

We consider the dynamical properties of Quantum Walks defined on the d-dimensional cubic lattice, or the homogeneous tree of coordination number 2d, with site dependent random phases, further characterised by transition probabilities…

The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the…

A discrete-time staggered quantum walk was recently introduced as a generalization that allows to unify other versions, such as the coined and Szegedy's walk. However, it also produces new forms of quantum walks not covered by previous…