相关论文: Quantum State Transfer on Coronas

Let $\alpha(G)$ denote the cardinality of a maximum independent set and $\mu(G)$ be the size of a maximum matching of a graph $G=\left( V,E\right) $. If $\alpha(G)+\mu(G)=\left\vert V\right\vert $, then $G$ is a K\"{o}nig-Egerv\'{a}ry…

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…

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…

We present an analytical study of state transfer in a spin chain in the presence of an inhomogeneous set of exchange coefficients. We initially consider the homogeneous case and describe a method to obtain the energy spectrum of the system.…

Designing a good transfer channel for arbitrary quantum states in spin chains implies optimizing a cost function, usually the averaged fidelity of transmission. The fidelity of transmission measures how much the transferred state resembles…

Let $G$ be a graph with adjacency matrix $A$. The transition matrix of $G$ is denoted by $H(t)$ and it is defined by $H(t):=\exp{\left(itA\right)},\;t\in\mathbb{R}.$ The graph $G$ has perfect state transfer (PST) from a vertex $u$ to…

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…

Pure states correspond to one-dimensional subspaces of $\mathbb{C}^n$ represented by unit vectors. In this paper, we develop the theory of perfect state transfer (PST) between real pure states with emphasis on the adjacency and Laplacian…

In this paper we study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer: the transmission of quantum states without dissipation. The essential goal is to…

We generalize an already proposed protocol for quantum state transfer to spin chains of arbitrary spin. An arbitrary unknown $d-$ level state is transferred through a chain with rather good fidelity by the natural dynamics of the chain. We…

We study a class of symmetric quantum walks on Hamming graphs, where the distance between vertices specifies the transition probability. A special model is the simple quantum walk on the hypercube, which has been discussed in the…

We investigate coined quantum walk search and state transfer algorithms, focusing on the complete $M$-partite graph with $N$ vertices in each partition. First, it is shown that by adding a loop to each vertex the search algorithm finds the…

This article is devoted to the development of analytical and numerical approaches to the problem of the end-to-end quantum state transfer along the spin-1/2 chain using two methods: (a) a homogeneous spin chain with week end bonds and equal…

We propose a scheme for perfect transfer of an unknown qubit state via the discrete-time quantum walk on a line or a circle. For this purpose, we introduce an additional coin operator which is applied at the end of the walk. This operator…

Based on shortcuts to adiabaticity and quantum Zeno dynamics, we present a protocol to implement quantum state transfer (QST) in a quantum spin-1/2 chain. In the protocol, the complex Hamiltonian of an $N$-site system is simplified, and a…

Theoretical calculations on transmission of quantum states such as Schr\"{o}dinger cat (SC) states are considered in a periodically poled nonlinear crystal (PPNC). Combinations of various initial states (SC, coherent (C),and vacuum (V)) of…

The corona of hypergraphs is an extension of the corona operation applied to graphs. The corona $G_0^* \odot_1^n G_1^*$ of two hypergraphs is obtained by taking $n$ copies of $G_1^*$ (where $n$ is the order of $G_0^*$) and by joining the…

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;…

A method for high-fidelity quantum state transfer in a quantum network coupled to a continuum, based on time reversal in the continuum after decay, is theoretically suggested. Provided that the energy spectrum of the network is symmetric…

By considering distance-regular graphs as spin networks, we investigate the state transfer fidelity in this class of networks. The effect of environment on the dynamics of state transfer is modeled using Milburn's intrinsic decoherence [G.…