Related papers: Perfect state transfer on hypercubes and its imple…
We propose a hypercube switching architecture for the perfect state transfer (PST) where we prove that it is always possible to find an induced hypercube in any given hypercube of any dimension such that PST can be performed between any two…
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…
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…
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…
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 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 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…
The transfer of data is a fundamental task in information systems. Microprocessors contain dedicated data buses that transmit bits across different locations and implement sophisticated routing protocols. Transferring quantum information…
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 protocol for perfect quantum state transfer that is resilient to a broad class of realistic experimental imperfections, including noise sources that could be modelled either as independent Markovian baths or as certain forms of…
Quantum state transfer within a quantum computer can be achieved by using a network of qubits, and such a network can be modelled mathematically by a graph. Here, we focus on the corresponding Laplacian matrix, and those graphs for which…
Motivated by the need for communication of coherent state-based qubits in quantum computers, we introduce a method for perfect transferring of an arbitrary superposition of coherent states between two distant nodes of a linear array of…
We present a perfect state transfer protocol via a qubit chain with the evolution governed by the $xx$ Hamiltonian. In contrast to the recent protocol announced in [Phys. Rev. Lett. {\bf 101}, 230502 (2008)], our method does not demand any…
Transferring quantum states efficiently between distant nodes of an information processing circuit is of paramount importance for scalable quantum computing. We report on the first observation of a perfect state transfer protocol on a…
We review the subject of perfect state transfer; how one designs the (fixed) interactions of a chain of spins so that a quantum state, initially inserted on one end of the chain, is perfectly transferred to the opposite end in a fixed time.…
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…
Perfect state transfer between qubits on a uniformly coupled network, with interactions specified by a graph, has advantages over an engineered chain, such as much faster transfer times (independent of the distance between the input and…
As quantum information technologies advance, challenges in scaling and connectivity persist, particularly the need for long-range qubit connectivity and efficient entanglement generation. Perfect State Transfer enables time-optimal state…
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…
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…