Related papers: Edge-state enhanced transport in a 2-dimensional q…

Discrete-time quantum walks, quantum generalizations of classical random walks, provide a framework for quantum information processing, quantum algorithms and quantum simulation of condensed matter systems. The key property of quantum…

The quantum walk was originally proposed as a quantum mechanical analogue of the classical random walk, and has since become a powerful tool in quantum information science. In this paper, we show that discrete time quantum walks provide a…

This work focuses on quantitative representation of transport in systems with quenched disorder. Explicit mapping of the quenched trap model to continuous time random walk is presented. Linear temporal transformation: $t\to…

The quantum walk is a dynamical protocol which describes the motion of spinful particles on a lattice. Also, it has been demonstrated to be a powerful platform to explore topological quantum matter. Recently, the quantum walk in coherent…

A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix…

Coherent electron displacement is a conventional strategy for processing quantum information, as it enables to interconnect distinct sites in a network of atoms. The efficiency of the processing relies on the precise control of the…

We analyze the propagation of quantum states in the presence of weak disorder. In particular, we investigate the reliable transmittance of quantum states, as potential carriers of quantum information, through disorder-perturbed waveguides.…

We theoretically study the transport of time-bin entangled photon pairs in a two-dimensional topological photonic system of coupled ring resonators. This system implements the integer quantum Hall model using a synthetic gauge field and…

Quantum spin networks can be used to transport information between separated registers in a quantum information processor. To find a practical implementation, the strict requirements of ideal models for perfect state transfer need to be…

Hitting the exit node from the entrance node faster on a graph is one of the properties that quantum walk algorithms can take advantage of to outperform classical random walk algorithms. Especially, continuous-time quantum walks on…

We explain how centrosymmetry, together with a dominant doublet in the local density of states, can guarantee interference-assisted, strongly enhanced, strictly coherent quantum excitation transport between two predefined sites of a random…

Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…

We study how quantum walks can be used to find structural anomalies in graphs via several examples. Two of our examples are based on star graphs, graphs with a single central vertex to which the other vertices, which we call external…

In this paper, we study quantum walks on the extension of association schemes. Various state transfers can be achieved on these graphs, such as multiple state transfer among extreme points of a simplex, fractional revival on subsimplexes.…

The task of finding an element in an unstructured database is known as spatial search and can be expressed as a quantum walk evolution on a graph. In this article, we modify the usual search problem by adding an extra trapping vertex to the…

We explore theoretically how the coupling to cavity vacuum fields affects the electron transport in quantum conductors due to the counter-rotating-wave terms of light-matter interaction. We determine the quantum conductance in terms of the…

The study of quantum state transfer has led to a variety of research efforts utilizing quantum simulators. By exploiting the tunability of the qubit frequency and qubit-qubit coupling, a superconducting qubit chain can simulate various…

Efficient communication between qubits relies on robust networks which allow for fast and coherent transfer of quantum information. It seems natural to harvest the remarkable properties of systems characterized by topological invariants to…

Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example…

Motivated by surprises in recent experimental findings, we study transport in a model of a quantum Hall edge system with a gate-voltage controlled constriction. A finite backscattered current at finite edge-bias is explained from a…