Related papers: Evolution of Quantum Resources in Quantum-walk-bas…
Quantum walks are widely and successfully used to model diverse physical processes. This leads to computation of the models, to explore their properties. Quantum walks have also been shown to be universal for quantum computing. This is a…
Understanding the role that quantum entanglement plays as a resource in various information processing tasks is one of the crucial goals of quantum information theory. Here we propose a new perspective for studying quantum entanglement:…
The resource theory of coherence studies the operational value of superpositions in quantum technologies. A key question in this theory concerns the efficiency of manipulation and inter-conversion of the resource. Here we solve this…
We show how multi-walker quantum walks can be implemented in a quantum quincunx created via cavity quantum electrodynamics. The implementation of a quantum walk with a multi-walker opens up the interesting possibility to introduce…
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2^n objects that our algorithm runs in polynomial time.
Entanglement and coherence are two essential quantum resources for quantum information processing. A natural question arises of whether there are direct link between them. And by thinking about this question, we propose a new measure for…
We look at two possible routes to classical behavior for the discrete quantum random walk on the line: decoherence in the quantum ``coin'' which drives the walk, or the use of higher-dimensional coins to dilute the effects of interference.…
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…
We introduce a continuous-time quantum walk on an ultrametric space corresponding to the set of p-adic integers and compute its time-averaged probability distribution. It is shown that localization occurs for any location of the ultrametric…
Quantum information theory is built upon the realisation that quantum resources like coherence and entanglement can be exploited for novel or enhanced ways of transmitting and manipulating information, such as quantum cryptography,…
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…
We investigate quantum superposition effects in two-dimensional quantum walks of identical particles with different statistics under particle exchange, starting from various different initial configurations. To characterize interparticle…
The quantum switch, a process enabling a coherent superposition of different orders of quantum channels, has garnered significant attention due to its ability to enable noiseless communications through noisy channels, such as…
Quantum coherence plays an important role in quantum resource theory, which is strongly related with entanglement. Similar to the entanglement evolution equation, we find the coherence evolution equation of quantum states through fully and…
Wave-particle duality, a fundamental principle of quantum mechanics, encapsulates the complementary relationship between the wave and particle behaviors of quantum systems. In this paper, we treat quantum coherence and classical…
Continuous-time quantum walks may be exploited to enhance spatial search, i.e., for finding a marked element in a database structured as a complex network. However, in practical implementations, the environmental noise has detrimental…
This paper researches how the systematic errors in phase inversions affect the success rate and the number of iterations in optimized quantum random-walk search algorithm. Through geometric description of this algorithm, the model of the…
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…
We study the evolution of quantum correlations in two-particle discrete-time non-unitary quantum walks on a line with gain and loss. The two particles are initially prepared in a maximally entangled state and evolve independently. Using…