Related papers: Communication in XYZ All-to-All Quantum Networks w…
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…
Spectral graph theory gives an algebraical approach to analyze the dynamics of a network by using the matrix that represents the network structure. However, it is not easy for social networks to apply the spectral graph theory because the…
The k-pair problem in network coding theory asks to send k messages simultaneously between k source-target pairs over a directed acyclic graph. In a previous paper [ICALP 2009, Part I, pages 622--633] the present authors showed that if a…
Robust quantum routing is essential for scalable quantum technologies. This paper investigates the resilience of routing protocols in network architectures designed for perfect, high-fidelity transfer of both classical and quantum…
Quantum communication between distant parties is based on suitable instances of shared entanglement. For efficiency reasons, in an anticipated quantum network beyond point-to-point communication, it is preferable that many parties can…
We show how to perfectly transfer, without state initialization and remote collaboration, arbitrary functions in interacting boson lattices. We describe a possible implementation of state transfer through bosonic atoms trapped in optical…
We address the properties of continuous-time quantum walks with Hamiltonians of the form $\mathcal{H}= L + \lambda L^2$, being $L$ the Laplacian matrix of the underlying graph and being the perturbation $\lambda L^2$ motivated by its…
When initially introduced, a Hamiltonian that realises perfect transfer of a quantum state was found to be analogous to an x-rotation of a large spin. In this paper we extend the analogy further to demonstrate geometric effects by…
Quantum information transfer is an important part of quantum information processing. Several proposals for quantum information transfer along linear arrays of nearest-neighbor coupled qubits or spins were made recently. Perfect transfer was…
We propose a generalization of transformer neural network architecture for arbitrary graphs. The original transformer was designed for Natural Language Processing (NLP), which operates on fully connected graphs representing all connections…
The evolution of spin network states in loop quantum gravity can be described by introducing a time variable, defined by the surfaces of constant value of an auxiliary scalar field. We regulate the Hamiltonian, generating such an evolution,…
Let $L$ denote the Laplacian matrix of a graph $G$. We study continuous quantum walks on $G$ defined by the transition matrix $U(t)=\exp\left(itL\right)$. The initial state is of the pair state form, $e_a-e_b$ with $a,b$ being any two…
The role of noise in the transport properties of quantum excitations is a topic of great importance in many fields, from organic semiconductors for technological applications to light-harvesting complexes in photosynthesis. In this paper we…
Interconnecting well-functioning, scalable stationary qubits and photonic qubits could substantially advance quantum communication applications and serve to link future quantum processors. Here, we present two protocols for transferring the…
A fully-connected qubit network is considered, where every qubit interacts with every other one. When the interactions between the qubits are homogeneous, the system is a special case of the finite Lipkin-Meshkov-Glick model. We propose a…
The study of quantum state transfer has led to a variety of research efforts utilizing quantum simulators. By exploiting the tunability of the qubit frequency and qubit-qubit coupling, a superconducting qubit chain can simulate various…
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…
Unlike vision and language domains, graph learning lacks a shared input space, as input features differ across graph datasets not only in semantics, but also in value ranges and dimensionality. This misalignment prevents graph models from…
We demonstrate the capability of continuous variable Gaussian states to communicate multipartite quantum information. A quantum teamwork protocol is presented according to which an arbitrary possibly entangled multimode state can be…
In this paper we build on the ideas presented in previous works for perfectly transferring a quantum state between opposite ends of a spin chain using a fixed Hamiltonian. While all previous studies have concentrated on nearest-neighbor…