Related papers: Scattering theory and discrete-time quantum walks
This paper continues the study of large time behavior of a nonlinear quantum walk begun in arXiv:1801.03214. In this paper, we provide a weak limit theorem for the distribution of the nonlinear quantum walk. The proof is based on the…
We study quantum Markov chains on graphs, described by completely positive maps, following the model due to S. Gudder (J. Math. Phys. 49, 072105, 2008) and which includes the dynamics given by open quantum random walks as defined by S.…
Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information…
A randomly walking quantum particle evolving by Schr\"odinger's equation searches for a unique marked vertex on the "simplex of complete graphs" in time $\Theta(N^{3/4})$. In this paper, we give a weighted version of this graph that…
Quantum walks have been shown to have a wide range of applications, from artificial intelligence, to photosynthesis, and quantum transport. Quantum stochastic walks (QSWs) generalize this concept to additional non-unitary evolution. In this…
We prove that a quantum walk can detect the presence of a marked element in a graph in $O(\sqrt{WR})$ steps for any initial probability distribution on vertices. Here, $W$ is the total weight of the graph, and $R$ is the effective…
Quantum particles are known to be faster than classical when they propagate stochastically on certain graphs. A time needed for a particle to reach a target node on a distance, the hitting time, can be exponentially less for quantum walks…
We propose a phenomenon of discrete-time quantum walks on graphs called the pulsation, which is a generalization of a phenomenon in the quantum searches. This phenomenon is discussed on a composite graph formed by two connected graphs…
We study the statistical properties of the scattering matrix associated with generic quantum graphs. The scattering matrix is the quantum analogue of the classical evolution operator on the graph. For the energy-averaged spectral form…
Transport phenomena play a crucial role in modern physics and applied sciences. Examples include the dissipation of energy across a large system, the distribution of quantum information in optical networks, and the timely modeling of…
Linear chains of quantum scatterers are studied in the process of lengthening, which is treated and analysed as a discrete dynamical system defined over the manifold of scattering matrices. Elementary properties of such dynamics relate the…
By adding generalizations involving translations, the machinery of the quantum theory of free fields leads to the semiclassical equations of motion for a charged massive particle in electromagnetic and gravitational fields. With the…
Wave propagation through waveguides, quantum wires or films with a modest amount of disorder is in the semi-ballistic regime when in the transversal direction(s) almost no scattering occurs, while in the long direction(s) there is so much…
We consider a continuous-time quantum walk on a triple graph and investigate the influence of the side chain on the propagation in the main chain. Calculating the interchange of the probabilities between the two parts of the main chain, we…
Quantum walks that depend smoothly on a small parameter $\varepsilon\ge0$ are considered on directed graphs. The asymptotic behavior of the scattering matrix of the quantum walk as $\varepsilon\to+0$ is investigated. It is shown that, in…
In this theoretical study, we analyze quantum walks on complex networks, which model network-based processes ranging from quantum computing to biology and even sociology. Specifically, we analytically relate the average long time…
In this paper, we consider discrete time quantum walks on graphs with coin focusing on the decentralized model, where the coin operation is allowed to change with the vertex of the graph. When the coin operations can be modified at every…
In a continuous-time quantum walk on a network of qubits, pretty good state transfer is the phenomenon of state transfer between two vertices with fidelity arbitrarily close to 1. We construct families of graphs to demonstrate that there is…
A continuous-time quantum walk on a graph is a matrix-valued function $\exp(-\mathtt{i} At)$ over the reals, where $A$ is the adjacency matrix of the graph. Such a quantum walk has universal perfect state transfer if for all vertices $u,v$,…
We investigate the ballistic spreading behavior of the one-dimensional discrete time quantum walks whose time evolution is driven by any balanced quantum coin. We obtain closed-form expressions for the long-time variance of position of…