Related papers: Communication in XYZ All-to-All Quantum Networks w…
For a graph $G$ and a related symmetric matrix $M$, the continuous-time quantum walk on $G$ relative to $M$ is defined as the unitary matrix $U(t) = \exp(-itM)$, where $t$ varies over the reals. Perfect state transfer occurs between…
Uniform random intersection graphs have received much interest and been used in diverse applications. A uniform random intersection graph with $n$ nodes is constructed as follows: each node selects a set of $K_n$ different items uniformly…
We propose a scheme to distribute graph states over quantum networks in the presence of noise in the channels and in the operations. The protocol can be implemented efficiently for large graph sates of arbitrary (complex) topology. We…
We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a…
Graph states are an important class of multipartite entangled quantum states. We propose a new approach for distributing graph states across a quantum network. We consider a quantum network consisting of nodes-quantum computers within which…
Using an approach to open quantum systems based on the effective non-Hermitian Hamiltonian, we fully describe transport properties for a paradigmatic model of a coherent quantum transmitter: a finite sequence of square potential barriers.…
A system of a two-level atom of an impurity (qubit) inserted into a periodic chain coupled to the continuum is studied with the use of the effective non-Hermitian Hamiltonian. Exact solutions are derived for the quasistationary eigenstates,…
The dynamical behaviour of the quantum state of different quantum spin chains, with designed site dependent interaction strengths, is analyzed when the initial state belongs to the one excitation subspace. It is shown that the inhomogeneous…
We investigate a system composed of $N$ coupled cavities and two-level atoms interacting one at a time. Adjusting appropriately the atom-field detuning, and make the hopping rate of photons between neighboring cavities, $A$, greater than…
We show a perfect state transfer of an arbitrary unknown two-qubit state can be achieved via a discrete-time quantum walk with various settings of coin flippings, and extend this method to distribution of an arbitrary unknown multi-qubit…
A fully connected vertex $w$ in a simple graph $G$ of order $N$ is a vertex connected to all the other $N-1$ vertices. Upon denoting by $L$ the Laplacian matrix of the graph, we prove that the continuous-time quantum walk (CTQW) -- with…
We use a normal mode approach to show full and partial state transfer in a class of coupled resonator networks with underlying $su(2)$ symmetry that includes the so-called $J_{x}$ photonic lattice. Our approach defines an auxiliary…
We study the time evolution of a single spin excitation state in certain linear spin chains, as a model for quantum communication. Some years ago it was discovered that when the spin chain data (the nearest neighbour interaction strengths…
The transfer of quantum states has played an important role in quantum information processing. In fact, transfer of quantum states from point $A$ to $B$ with unit fidelity is very important for us and we focus on this case. In recent years,…
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…
We present a new scheme for teleporting multiqubit quantum information from a sender to a distant receiver via the control of many agents in a network. We show that the receiver can successfully restore the original state of each qubit as…
Graph states provide a powerful framework for describing multipartite entanglement in quantum information science. In their standard formulation, graph states are generated by controlled-$Z$ interactions and naturally encode symmetric…
We demonstrate that the general model of a linearly time-dependent crossing of two energy bands is integrable. Namely, the Hamiltonian of this model has a quadratically time-dependent commuting operator. We apply this property to four-state…
Realizing the advantages of quantum computation requires access to the full Hilbert space of states of many quantum bits (qubits). Thus, large-scale quantum computation faces the challenge of efficiently generating entanglement between many…
This article presents a novel and succinct algorithmic framework via alternating quantum walks, unifying quantum spatial search, state transfer and uniform sampling on a large class of graphs. Using the framework, we can achieve exact…