Related papers: Floquet engineering of continuous-time quantum wal…
We study quantum transport on finite discrete structures and we model the process by means of continuous-time quantum walks. A direct and effective comparison between quantum and classical walks can be attained based on the average…
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms.…
We present a brief overview of some of the analytic perturbative techniques for the computation of the Floquet Hamiltonian for a periodically driven, or Floquet, quantum many-body system. The key technical points about each of the methods…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
We present a method for simulating any non-interacting and time-periodic tight-binding Hamiltonian in Fourier space using electric circuits made of inductors and capacitors. We first map the time-periodic Hamiltonian to a Floquet…
Floquet engineering is the concept of tailoring a system by a periodic drive. It has been very successful in opening new classes of Hamiltonians to the study with ultracold atoms in optical lattices, such as artificial gauge fields,…
Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In…
The staggered quantum walk is a type of discrete-time quantum walk model without a coin which can be generated on a graph using particular partitions of the graph nodes. We design Hamiltonians for potential realization of the staggered…
The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between…
Near-resonant periodic driving of quantum systems promises the implementation of a large variety of novel effective Hamiltonians. The challenge of Floquet engineering lies in the preparation and measurement of the desired quantum state. We…
We analyze a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum-walk features such as localization that starkly distinguishes classical from quantum…
We propose a time-dependent approach to investigate the motion of electrons in quantum pump device configurations. The occupied one-particle states are propagated in real time and used to calculate the local electron density and current. An…
We explore the prospects to control by use of time-dependent fields quantum transport phenomena in nanoscale systems. In particular, we study for driven conductors the electron current and its noise properties. We review recent…
Quantum systems can be dynamically controlled using time-periodic external fields, leading to the concept of Floquet engineering, with promising technological applications. Computing Floquet energy spectra is harder than only computing…
In this paper we present a model exhibiting a new type of continuous-time quantum walk (as a quantum mechanical transport process) on networks, which is described by a non-Hermitian Hamiltonian possessing a real spectrum. We call it…
There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the…
The goal of digital quantum simulation is to approximate the dynamics of a given target Hamiltonian via a sequence of quantum gates, a procedure known as Trotterization. The quality of this approximation can be controlled by the so called…
This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by…
Characterizing time-periodic Hamiltonians is pivotal for validating and controlling driven quantum platforms, yet prevailing and unadjusted reconstruction methods demand dense time-domain sampling and heavy post-processing. We introduce a…
In this paper, we propose a circuit design for implementing quantum walks on complex networks. Quantum walks are powerful tools for various graph-based applications such as spatial search, community detection, and node classification.…