Related papers: Controlled transport in chiral quantum walks on gr…
We investigate a theoretical model for effective carrier mobility to comprehensively describe the behavior of the perpendicular carrier transport across multiple quantum well (MQW) structures under applied electric field. The analytical…
Searching for simple models that possess non-trivial controlling properties is one of the central tasks in the field of quantum technologies. In this work, we construct a quantum spin-$1/2$ chain of finite size, termed as controllable spin…
In this paper, we consider a continuous-time quantum walk based search algorithm. We introduce equitable partition of the graph and perfect state transfer on it. By these two methods, we can calculate the success probability and the finding…
We study the quantum-mechanical transport on two-dimensional graphs by means of continuous-time quantum walks and analyse the effect of different boundary conditions (BCs). For periodic BCs in both directions, i.e., for tori, the problem…
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…
Quantum walks have wide applications in quantum information, such as universal quantum computation, so it is important to explore properties of quantum walks thoroughly. We propose a novel method to implement discrete-time quantum walks…
Quantum time evolution exhibits rich physics, attributable to the interplay between the density and phase of a wave function. However, unlike classical heat diffusion, the wave nature of quantum mechanics has not yet been extensively…
The finite dihedral group generated by one rotation and one reflection is the simplest case of the non-abelian group. Cayley graphs are diagrammatic counterparts of groups. In this paper, much attention is given to the Cayley graph of the…
We formalize the treatment of directed (or chiral) quantum walks using Hermitian adjacency matrices, bridging two developing fields of research in quantum information and spectral graph theory. We display results and simulations which…
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…
Discrete time quantum walks (DTQWs) are nontrivial generalizations of random walks with a broad scope of applications. In particular, they can be used as computational primitives, and they are suitable tools for simulating other quantum…
Quantum walks exhibit properties without classical analogues. One of those is the phenomenon of asymptotic trapping -- there can be non-zero probability of the quantum walker being localised in a finite part of the underlying graph…
A discrete-time quantum walk is the quantum analogue of a Markov chain on a graph. Zhan [J. Algebraic Combin. 53(4):1187-1213, 2020] proposes a model of discrete-time quantum walk whose transition matrix is given by two reflections, using…
This paper introduces a non-variational quantum algorithm designed to solve a wide range of combinatorial optimisation problems, including constrained and non-binary problems. The algorithm leverages an engineered interference process…
In this paper, we study mixing and large decoherence in continuous-time quantum walks on one dimensional regular networks, which are constructed by connecting each node to its $2l$ nearest neighbors($l$ on either side). In our…
Quantum walks (QWs) are of interest as examples of uniquely quantum behavior and are applicable in a variety of quantum search and simulation models. Implementing QWs on quantum devices is useful from both points of view. We describe a…
The basic conceptual picture and theoretical basis for development of transport equations in porous media are examined. The general form of the governing equations is derived for conservative chemical transport in heterogeneous geological…
Optical techniques have been employed to coherently control the quantum transport through nanojunctions. Conventional works on optical control of quantum transport usually applied a tailored electrical pulses to perform specific tasks. In…
The lackadaisical quantum walk is a discrete-time, coined quantum walk on a graph with a weighted self-loop at each vertex. It uses a generalized Grover coin and the flip-flop shift, which makes it equivalent to Szegedy's quantum Markov…
We investigate nonequilibrium transport in a triple-quantum-dot (TQD) system, where the central dot acts as a discrete tunnel barrier, subject to continuous monitoring by a quantum point contact (QPC) that is capacitively coupled to all…