相关论文: Perfect state transfer over interacting boson netw…
The study of perfect state transfer on graphs has attracted a great deal of attention during the past ten years because of its applications to quantum information processing and quantum computation. Perfect state transfer is understood to…
I show a scheme which allows a perfect transfer of an unknown single-qubit atomic state from one atom to another by letting two atoms interact simultaneously with a cavity QED. During the interaction between atom and cavity, the cavity is…
A simple method for transmitting quantum states within a quantum computer is via a quantum spin chain---that is, a path on $n$ vertices. Unweighted paths are of limited use, and so a natural generalization is to consider weighted paths;…
High-fidelity quantum computation and quantum state transfer are possible in short spin chains. We exploit a system based on a dispersive qubit-boson interaction to mimic XY coupling. In this model, the usually assumed nearest-neighbors…
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 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…
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…
The natural notion of almost perfect state transfer (APST) is examined. It is applied to the modelling of efficient quantum wires with the help of $XX$ spin chains. It is shown that APST occurs in mirror-symmetric systems, when the…
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…
We propose a protocol for perfect state transfer between any pair of vertices in a hypercube. Given a pair of distinct vertices in the hypercube we determine a sub-hypercube that contains the pair of vertices as antipodal vertices. Then a…
The quantum Perfect State Transfer (PST) is a fundamental tool of quantum communication in a network. It is not easy to achieve in practice. The original idea of PST depends on the fundamentals of the continuous-time quantum walk. A path…
A continuous-time quantum random walk describes the motion of a quantum mechanical particle on an underlying graph. The graph itself is associated with a Hilbert space of dimension equal to the number of vertices. The dynamics of the walk…
We investigate the quantum state transfer in a chain of particles satisfying q-deformed oscillators algebra. This general algebraic setting includes the spin chain and the bosonic chain as limiting cases. We study conditions for perfect…
Spin chains have been proposed as quantum wires in many quantum information processing architectures. Coherent transmission of quantum information over short distances is enabled by their internal dynamics, which drives the transport of…
Robust quantum state transfer (QST) is an indispensable ingredient in scalable quantum information processing. Here we present an experimentally feasible mechanism for realizing robust QST via topologically protected edge states in…
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 (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…
In this paper we answer the question of when circulant quantum spin networks with nearest-neighbor couplings can give perfect state transfer. The network is described by a circulant graph $G$, which is characterized by its circulant…
We propose new families of graphs which exhibit quantum perfect state transfer. Our constructions are based on the join operator on graphs, its circulant generalizations, and the Cartesian product of graphs. We build upon the results of…
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…