Related papers: Quantum State Transfer in Graphs with Tails
We systematically investigated perfect state transfer between antipodal nodes of discrete time quantum walks on variants of the cycles C_4, C_6 and C_8 for three choices of coin operator. Perfect state transfer was found, in general, to be…
We investigate state transfer on a hypercube by means of a quantum walk where the sender and the receiver vertices are marked by a weighted loops. First, we analyze search for a single marked vertex, which can be used for state transfer…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
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…
Matrix representations of quantum operators are computationally complete but often obscure the structural topology of information flow within a quantum circuit \cite{nielsen2000}. In this paper, we introduce a generalized graph-theoretic…
In a one-dimensional Heisenberg chain, we show that there are no sets of coupling strengths such that the evolution perfectly transfers a quantum state between the two ends of the chain without the addition of magnetic fields. In lieu of…
Quantum walks are accepted as a generic model for quantum transport. The character of the transport crucially depends on the properties of the walk like its geometry and the driving coin. We demonstrate that increasing transport distance…
Quantum physics in flat-band (FB) systems embodies a variety of exotic phenomenon and even counter intuitive features. The quantum transport in several graphene based compounds that exhibit a flat band and a tunable gap is investigated.…
Using the signed laplacian matrix, and weighted and hybrid graphs, we present additional ways to interpret graphs as grid states. Hybrid graphs offer the most general interpretation. Existing graphical methods that characterize entanglement…
There has been much recent study on the application of spin chains to quantum state transfer and communication. Here we demonstrate that spin chains set up for perfect quantum state transfer can be utilised to generate remote quantum gates,…
We consider the definition of quantum walks on directed graphs. Call a directed graph reversible if, for each pair of vertices (i, j), if i is connected to j then there is a path from j to i. We show that reversibility is a necessary and…
We study the spectral properties of infinite rectangular quantum graphs in the presence of a magnetic field. We study how these properties are affected when three-dimensionality is considered, in particular, the chaological properties. We…
We show that the one-way channel formalism of quantum optics has a physical realisation in electronic systems. In particular, we show that magnetic edge states form unidirectional quantum channels capable of coherently transporting…
Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with…
We introduce a new model of background independent physics in which the degrees of freedom live on a complete graph and the physics is invariant under the permutations of all the points. We argue that the model has a low energy phase in…
We study scattering for continuous-time quantum walks on finite graphs with two attached leads. We derive explicit formulae for the two-terminal scattering matrix in terms of characteristic polynomials of the finite graph and its…
This work deals with quantum transport in open quantum graphs. We consider the case of complete graphs on $n$ vertices with an edge removed and attached to two leads, to represent the entrance and exit channels, from where we calculate the…
We explore the main processes involved in the evolution of general quantum systems by means of Diagrams of States, a novel method to graphically represent and analyze how quantum information is elaborated during computations performed by…
We investigate quantum phase transitions (QPTs) in spin chain systems characterized by local Hamiltonians with matrix product ground states. We show how to theoretically engineer such QPT points between states with predetermined properties.…
Being able to reliably transfer the quantum state from one system to another is crucial to developing quantum networks. A standard way to accomplish this transfer of information is by making use of an intermediate information carrier (e.g.,…