Related papers: Simulating and Learning Quantum Evolution: A CTQW-…
The study of quantum walk processes has been widely divided into two standard variants, the discrete-time quantum walk (DTQW) and the continuous-time quantum walk (CTQW). The connection between the two variants has been established by…
The dynamics of a discrete-time quantum walk (DTQW) can be realized within a purely classical interacting particle system composed of some boxes and a large but finite number of balls, and can, in principle, be implemented in a tabletop…
We propose a new multi-dimensional discrete-time quantum walk (DTQW), whose continuum limit is an extended multi-dimensional Dirac equation, which can be further mapped to the Schr\"{o}dinger equation. We show in two ways that our DTQW is…
In this paper we study quantum simulation algorithms on the elastic wave equations using the Schr\"odingerisation method. The Schr\"odingerisation method transforms any linear PDEs into a system of Schr\"odinger-type PDEs -with unitary…
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…
The quantum walk (QW) is the term given to a family of algorithms governing the evolution of a discrete quantum system and as such has a founding role in the study of quantum computation. We contribute to the investigation of QW phenomena…
Quantum walks (QWs) represent pillars of quantum dynamics and information processing. They provide a powerful framework for simulating quantum transport, designing search algorithms, and enabling universal quantum computation. Several…
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are…
Link prediction is one of the fundamental problems in graph theory, critical for understanding and forecasting the evolution of complex systems like social and biological networks. While classical heuristics capture certain aspects of graph…
In recent years, there has been an emerging trend of combining two innovations in computer science and physics to achieve better computation capability. Exploring the potential of quantum computation to achieve highly efficient performance…
We address the dynamics of continuous-time quantum walk (CTQW) on planar 2D lattice graphs, i.e. those forming a regular tessellation of the Euclidean plane (triangular, square, and honeycomb lattice graphs). We first consider the free…
In this paper, we consider continuous-time quantum walks (CTQWs) on one-dimension ring lattice of N nodes in which every node is connected to its 2m nearest neighbors (m on either side). In the framework of the Bloch function ansatz, we…
A discrete-time Quantum Walk (QW) is essentially a unitary operator driving the evolution of a single particle on the lattice. Some QWs admit a continuum limit, leading to familiar PDEs (e.g. the Dirac equation). In this paper, we study the…
Quantum Stochastic Walks (QSW) allow for a generalization of both quantum and classical random walks by describing the dynamic evolution of an open quantum system on a network, with nodes corresponding to quantum states of a fixed basis. We…
A discrete-time Quantum Walk (QW) is an operator driving the evolution of a single particle on the lattice, through local unitaries. Some QW admit, as their continuum limit, a well-known equation of Physics. In arXiv:1803.01015 the QW is…
We implement the discrete-time quantum walk model using the continuous-time evolution of the Hamiltonian that includes both the shift and the coin generators. Based on the Trotter-Suzuki first-order approximation, we consider an…
In this work we propose an approach for implementing time-evolution of a quantum system using product formulas. The quantum algorithms we develop have provably better scaling (in terms of gate complexity and circuit depth) than a naive…
History dependent discrete time quantum walks (QWs) are often studied for their lattice traversal properties. A particular model in the literature uses the state of a memory qubit at each site to record visits and to control the dynamics of…
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or…
Quantum computers could potentially simulate the dynamics of systems such as polyatomic molecules on a much larger scale than classical computers. We investigate a general quantum computational algorithm that simulates the time evolution of…