Related papers: Communication in XYZ All-to-All Quantum Networks w…
Search and state transfer between hubs, i.e. fully connected vertices, on otherwise arbitrary connected graph is investigated. Motivated by a recent result of Razzoli et al. (J. Phys. A: Math. Theor. 55, 265303 (2022)) on universality of…
This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general -- indeed, it is…
The ability to accurately transfer quantum information through networks is an important primitive in distributed quantum systems. While perfect quantum state transfer (PST) can be effected by a single particle undergoing continuous-time…
This work deals with quantum transport in open quantum graphs. We consider the case of complete graphs on $n$ vertices with an edge removed and attached to two leads, to represent the entrance and exit channels, from where we calculate the…
We study the existence of quantum state transfer in $\mathcal{Q}$-graphs in this paper. The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and…
Distributing entanglement among multiple users is a fundamental problem in quantum networks, requiring an efficient solution. In this work, a protocol is proposed for extracting maximally entangled (GHZn) states for any number of parties in…
We study the existence of state transfer with respect to the $q$-Laplacian matrix of a graph equipped with a non-trivial involution. We show that the occurrence of perfect state transfer between certain pair (or plus) states in such a graph…
We consider transfer of single and multi-qubit states on a quasi-1D lattice, where the time evolutions involved in the state transfer protocol are generated by only 1D Hamiltonians. We use the quasi-1D isotropic Heisenberg model under a…
We prove that translationally invariant Hamiltonians of a chain of $n$ qubits with nearest-neighbour interactions have two seemingly contradictory features. Firstly in the limit $n\rightarrow\infty$ we show that any translationally…
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…
Considering the two-photon exchange interaction between n coupled cavities each of them containing a two level atom, the atomic and photonic state transfer is investigated. In fact, n atom-cavity systems are considered to be distributed on…
Quantum spin networks can be used to transport information between separated registers in a quantum information processor. To find a practical implementation, the strict requirements of ideal models for perfect state transfer need to be…
We present an algorithm to design networks that feature pretty good state transfer (PGST), which is of interest for high-fidelity transfer of information in quantum computing. Realizations of PGST networks have so far mostly relied either…
We present a general formalism to the problem of perfect state-transfer (PST), where the state involves multiple excitations of the quantum network. A key feature of our formalism is that it allows for inclusion of nontrivial interactions…
This work presents an exactly soluble scheme to address the problem of optimal transfer of quantum states through a set of $s$ harmonic oscillators composing a network with connected ends as a closed quantum circuit. For this purpose we…
Quantum Markov networks are a generalization of quantum Markov chains to arbitrary graphs. They provide a powerful classification of correlations in quantum many-body systems---complementing the area law at finite temperature---and are…
The last decade has witnessed substantial interest in protocols for transferring information on networks of quantum mechanical objects. A variety of control methods and network topologies have been proposed, on the basis that transfer with…
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…
Efficient communication between qubits relies on robust networks which allow for fast and coherent transfer of quantum information. It seems natural to harvest the remarkable properties of systems characterized by topological invariants to…
Previously it was shown that (almost) perfect state transfer can be achieved on the complete bipartite graph by a discrete-time coined quantum walk based algorithm when both the sender and receiver vertices are in the same partition of the…