相关论文: Direct Equivalence between Dynamics of Quantum Wal…

We study the entanglement dynamics of discrete time quantum walks acting on bounded finite sized graphs. We demonstrate that, depending on system parameters, the dynamics may be monotonic, oscillatory but highly regular, or quasi-periodic.…

We address decoherence and classicalization of continuous-time quantum walks (CTQWs) on graphs. In particular, we investigate three different models of decoherence, and employ the quantum-classical (QC) dynamical distance as a figure of…

Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear…

Multi-dimensional quantum walks can exhibit highly non-trivial topological structure, providing a powerful tool for simulating quantum information and transport systems. We present a flexible implementation of a 2D optical quantum walk on a…

Quantum walks have emerged as an interesting approach to quantum information processing, exhibiting many unique properties compared to the analogous classical random walk. Here we introduce a model for a discrete-time quantum walk with…

Recent work has shown that quantum computers can compute scattering probabilities in massive quantum field theories, with a run time that is polynomial in the number of particles, their energy, and the desired precision. Here we study a…

With photonics, the quantum computational advantage has been demonstrated on the task of boson sampling. Next, developing quantum-enhanced approaches for practical problems becomes one of the top priorities for photonic systems. Quantum…

Dynamical phase transitions in the relaxation behavior of stochastic quantum walks are investigated, focusing on systems where coherent unitary evolution is periodically interrupted by dephasing. This interplay leads to a classicalization…

The connection between coined and continuous-time quantum walk models has been addressed in a number of papers. In most of those studies, the continuous-time model is derived from coined quantum walks by employing dimensional reduction and…

We introduce a fidelity-based measure $\text{D}_{\text{CQ}}(t)$ to quantify the differences between the dynamics of classical (CW) and quantum (QW) walks over a graph. We provide universal, graph-independent, analytic expressions of this…

The development of universal quantum computers has achieved remarkable success in recent years, culminating with the quantum supremacy reported by Google. Now is possible to implement short-depth quantum circuits with dozens of qubits and…

A discrete-time quantum walk is the quantum analogue of a Markov chain on a graph. Zhan [J. Algebraic Combin. 53(4):1187-1213, 2020] proposes a model of discrete-time quantum walk whose transition matrix is given by two reflections, using…

It is demonstrated that in gate-based quantum computing architectures quantum walk is a natural mathematical description of quantum gates. It originates from field-matter interaction driving the system, but is not attached to specific qubit…

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…

Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…

Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and…

The universal quantum computation model based on quantum walk by Childs has opened the door for a new way of studying the limitations and advantages of quantum computation, as well as for its intermediate-term simulation. In recent years,…

We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…

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…

Quantum random walks have received much interest due to their non-intuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable…