Related papers: Perfect edge state transfer on cubelike graphs
We present a conceptually new approach to describe state-of-the-art photonic quantum experiments using Graph Theory. There, the quantum states are given by the coherent superpositions of perfect matchings. The crucial observation is that…
The chromatic index of a cubic graph is either 3 or 4. Edge-Kempe switching, which can be used to transform edge-colorings, is here considered for 3-edge-colorings of cubic graphs. Computational results for edge-Kempe switching of cubic…
Scalable quantum computing and communication requires the protection of quantum information from the detrimental effects of decoherence and noise. Previous work tackling this problem has relied on the original circuit model for quantum…
Quantum hypergraph states extend the well-studied class of graph states by taking into account multi-qubit interactions through hyperedges. They provide a powerful framework to represent a family of quantum states with genuine multipartite…
The aim of this review paper is to discuss some applications of orthogonal polynomials in quantum information processing. The hope is to keep the paper self contained so that someone wanting a brief introduction to the theory of orthogonal…
A set of Pauli stings is well characterized by the graph that encodes its commutatitivity structure, i.e., by its frustration graph. This graph provides a natural interface between graph theory and quantum information, which we explore in…
High fidelity state transfer is an important ingredient of distributed quantum information processing. We present and analyse results on perfect and quasi-perfect state transfer with linear spin chains incorporating non-uniform on-site…
Graph states are an elegant and powerful quantum resource for measurement based quantum computation (MBQC). They are also used for many quantum protocols (error correction, secret sharing, etc.). The main focus of this paper is to provide a…
We suggest a scheme that allows arbitrarily perfect state transfer even in the presence of random fluctuations in the couplings of a quantum chain. The scheme performs well for both spatially correlated and uncorrelated fluctuations if they…
Quantum walks have frequently envisioned the behavior of a quantum state traversing a classically defined, generally finite, graph structure. While this approach has already generated significant results, it imposes a strong assumption: all…
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…
We exploit a ferromagnetic chain of interacting $d$-level ($d>2$) particles for arbitrary perfect transfer of quantum states with $(d-1)$ levels. The presence of one extra degree of freedom in the Hilbert space of particles, which is not…
Graph states are a fundamental entanglement resource for multipartite quantum applications which are in general challenging to transform efficiently. While fusion operations for merging entangled states are well-developed, no direct…
Transferring the state of an information carrier from a sender to a receiver is an essential primitive in both classical and quantum communication and information processing. In a quantum process known as teleportation the unknown state of…
In this paper, we consider a continuous-time quantum walk based search algorithm. We introduce equitable partition of the graph and perfect state transfer on it. By these two methods, we can calculate the success probability and the finding…
Perfect state transfer (PST) is discussed in the context of passive quantum networks with logical bus topology, where many logical nodes communicate using the same shared media, without any external control. The conditions under which, a…
Graph states are a unique resource for quantum information processing, such as measurement-based quantum computation. Here, we theoretically investigate using continuous-variable graph states for single-parameter quantum metrology,…
We investigate quantum state transfer in XY spin chains and propose a recursive procedure to construct the nonuniform couplings of these chains with arbitrary length to achieve perfect state transfer(PST). We show that this method is…
Hypergraph states are multi-qubit states that form a subset of the locally maximally entangleable states and a generalization of the well--established notion of graph states. Mathematically, they can conveniently be described by a…
We study the tight-binding model for a graphene tube with perimeter N threaded by a magnetic field. We show exactly that this model has different nontrivial topological phases as the flux changes. The winding number, as an indicator of…