Related papers: The Perfect State Transfer Graph Limbo
Perfect quantum state transfer is achievable in different settings, including linear qubit chains, bi-dimensional arrays, ladders, etc. The most studied case contemplates transferring arbitrary one-qubit pure states in systems with…
We propose a class of qubit networks that admit perfect transfer of any quantum state in a fixed period of time. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be…
In a continuous-time quantum walk on a network of qubits, pretty good state transfer is the phenomenon of state transfer between two vertices with fidelity arbitrarily close to 1. We construct families of graphs to demonstrate that there is…
In this paper we study quantum state transfer (also called quantum tunneling) on graphs when there is a potential function on the vertex set. We present two main results. First, we show that for paths of length greater than three, there is…
We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties,…
We study pretty good quantum state transfer (i.e., state transfer that becomes arbitrarily close to perfect) between vertices of graphs with an involution in the presence of an energy potential. In particular, we show that if a graph has an…
Perfect transfer of a quantum state through a one-dimensional chain is now well understood, allowing one not only to decide whether a fixed Hamiltonian achieves perfect transfer, but to design a suitable one. We are particularly interested…
Faithfully transferring the quantum state is essential for quantum information processing. Here we demonstrate a fast (in 84 ns) and high-fidelity (99.2%) transfer of arbitrary quantum states in a chain of four superconducting qubits with…
A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with…
We quantify the effect of weighted loops at the source and target nodes of a graph on the strength of quantum state transfer between these vertices. We give lower bounds on loop weights that guarantee strong transfer fidelity that works for…
A duality between the properties of many spinor bosons on a regular lattice and those of a single particle on a weighted graph reveals that a quantum particle can traverse an infinite hierarchy of networks with perfect probability in…
We introduce and study peak state transfer, a notion of high state transfer in qubit networks modeled by continuous-time quantum walks. Unlike perfect or pretty good state transfer, peak state transfer does not require fidelity arbitrarily…
Superconducting quantum circuits, fabricated with multiple layers, are proposed to implement perfect quantum state transfer between nodes of a hypercube network. For tunable devices such as the phase qubit, each node can transmit quantum…
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…
We study perfect state transfer on quantum networks represented by weighted graphs. Our focus is on graphs constructed from the join and related graph operators. Some specific results we prove include: (1) The join of a weighted two-vertex…
In order to obtain perfect state transfer between two sites in a network of interacting qubits, their corresponding vertices in the underlying graph must satisfy a combinatorial property called strong cospectrality. Here we determine the…
The transfer of a quantum state between distant nodes in two-dimensional networks, is considered. The fidelity of state transfer is calculated as a function of the number of interactions in networks that are described by regular graphs. It…
Perfect (quantum) state transfer has been proved to be an effective model for quantum information processing. In this paper, we give a characterization of cubelike graphs having perfect edge state transfer. By using a lifting technique, we…
We construct families of graphs from linear groups $\mathrm{SL}(2,q)$, $\mathrm{GL}(2,q)$ and $\mathrm{GU}(2,q^2)$, where $q$ is an odd prime power, with the property that the continuous-time quantum walks on the associated networks of…
A continuous-time quantum walk on a graph $X$ is represented by the complex matrix $\exp (-\mathrm{i} t A)$, where $A$ is the adjacency matrix of $X$ and $t$ is a non-negative time. If the graph models a network of interacting qubits,…