Related papers: Quantum Simulation of a Discrete-Time Quantum Stoc…
A particular family of Discrete Time Quantum Walks (DTQWs) simulating fermion propagation in $2$D curved space-time is revisited. Usual continuous covariant derivatives and spin-connections are generalized into discrete covariant…
The formalism of continuous-time quantum walks on graphs has been widely used in the study of quantum transport of energy and information, as well as in the development of quantum algorithms. In experimental settings, however, there is…
QSW_MPI is a python package developed for time-series simulation of continuous-time quantum stochastic walks. This model allows for the study of Markovian open quantum systems in the Lindblad formalism, including a generalisation of the…
This paper presents a novel quantum walk approach to simulating parton showers on a quantum computer. We demonstrate that the quantum walk paradigm offers a natural and more efficient approach to simulating parton showers on quantum…
Quantum walks are widely and successfully used to model diverse physical processes. This leads to computation of the models, to explore their properties. Quantum walks have also been shown to be universal for quantum computing. This is a…
We present an approach using quantum walks (QWs) to redistribute ultracold atoms in an optical lattice. Different density profiles of atoms can be obtained by exploiting the controllable properties of QWs, such as the variance and the…
In this paper, a study on discrete-time coined quantum walks on the line is presented. Clear mathematical foundations are still lacking for this quantum walk model. As a step towards this objective, the following question is being…
In this work, we present a new algorithm for generating quantum circuits that efficiently implement continuous time quantum walks on arbitrary simple sparse graphs. The algorithm, called matching decomposition, works by decomposing a…
In one-way quantum computation (1WQC) model, universal quantum computations are performed using measurements to designated qubits in a highly entangled state. The choices of bases for these measurements as well as the structure of the…
Continuous-time quantum walks (CTQWs) provide a valuable model for quantum transport, universal quantum computation and quantum spatial search, among others. Recently, the empowering role of new degrees of freedom in the Hamiltonian…
Open quantum walks (OQWs) are a new type of quantum walks which are entirely driven by the dissipative interaction with external environments and are formulated as completely positive trace-preserving maps on graphs. A generalized quantum…
The unique features of quantum walk, such as the possibility of the walker to be in superposition ofthe position space and get entangled with the position space, provides inherent advantages that canbe captured to design highly secure…
Quantum walks are referred to as quantum analogs to random walks in mathematics. They have been studied as quantum algorithms in quantum information for quantum computers. There are two types of quantum walks. One is the discrete-time…
The quantum walk formalism is a widely used and highly successful framework for modeling quantum systems, such as simulations of the Dirac equation, different dynamics in both the low and high energy regime, and for developing a wide range…
A discrete-time Quantum Walk (QW) is essentially an operator driving the evolution of a single particle on the lattice, through local unitaries. Some QWs admit a continuum limit, leading to familiar PDEs (e.g. the Dirac equation). Recently…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain…
We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total…
We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy's quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has $l$ integer self-loops, can be generalized to a…
Continuous-time quantum walk is one of the alternative approaches to quantum computation, where a universal set of quantum gates can be achieved by scattering a quantum walker on some specially-designed structures embedded in a sparse graph…
We present an approach to simulate the Schr\"odinger equation through continuous time quantum walks. The CTQW-based simulation applies unitary evolution driven by a quantum walk to generate probability amplitude distributions at various…