Related papers: Perfect chiral quantum routing
A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition. Here we…
A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science.…
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…
The Scattering Quantum Random Walk scheme has found success as a basis for search algorithms on highly symmetric graph structures. In this paper we examine its effectiveness at locating a specially marked vertex on square grid graphs,…
I explore the use of quantum information as a security enabler for the future driverless vehicle. Specifically, I investigate the role combined classical and quantum information can have on the most important characteristic of the…
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…
As practical quantum networks prepare to serve an ever-expanding number of nodes, there has grown a need for advanced auxiliary classical systems that support the quantum protocols and maintain compatibility with the existing fiber-optic…
Quantum versions of random walks on the line and the cycle show a quadratic improvement over classical random walks in their spreading rates and mixing times respectively. Non-unitary quantum walks can provide a useful optimisation of these…
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$,…
Quantum communication demands efficient distribution of quantum entanglement across a network of connected partners. The search for efficient strategies for the entanglement distribution may be based on percolation theory, which describes…
The robust operation of quantum entanglement states are crucial for applications in quantum information, computing, and communications1-3. However, it has always been a great challenge to complete such a task because of decoherence and…
Based on the correspondence between circuit Laplacian and Schrodinger equation, recent investigations have shown that classical electric circuits can be used to simulate various topological physics and the Schrodinger's equation.…
Previously it was shown that (almost) perfect state transfer can be achieved on the complete bipartite graph by a discrete-time coined quantum walk based algorithm when both the sender and receiver vertices are in the same partition of the…
We consider a quantum walk with two marked vertices, sender and receiver, and analyze its application to perfect state transfer on complete bipartite graphs. First, the situation with both the sender and the receiver vertex in the same part…
It is expected that quantum wires (q-wires), will be required to transport quantum information within many quantum computer implementations. Here we describe a new design for a q-wire with perfect transmission using a uniformly coupled…
Quantum walks on translation invariant regular graphs spread quadratically faster than their classical counterparts. The same coherence that gives them this quantum speedup inhibits, or even stops their spread in the presence of disorder.…
Spin chains have been proposed as wires to transport information between distributed registers in a quantum information processor. Unfortunately, the challenges in manufacturing linear chains with engineered couplings has hindered…
In this paper, we study Grover's search algorithm focusing on continuous-time quantum walk on graphs. We propose an alternative optimization approach to Grover's algorithm on graphs that can be summarized as follows: instead of finding…
One of the most important algorithmic applications of quantum walks is to solve spatial search problems. A widely used quantum algorithm for this problem, introduced by Childs and Goldstone [Phys. Rev. A 70, 022314 (2004)], finds a marked…
We formalize the treatment of directed (or chiral) quantum walks using Hermitian adjacency matrices, bridging two developing fields of research in quantum information and spectral graph theory. We display results and simulations which…