Related papers: Quantum state transfer on the complete bipartite g…
We present a generalized definition of discrete-time quantum walks convenient for capturing a rather broad spectrum of walker's behavior on arbitrary graphs. It includes and covers both: the geometry of possible walker's positions with…
We study a quantum state transfer between spins interacting with an arbitrary network of spins coupled by uniform XX interactions. It is shown that in such a system under fairly general conditions, we can expect a nearly perfect transfer of…
We propose a new protocol of implementing continuous-variable quantum state transfer using partially disembodied transport. This protocol may improve the fidelity at the expense of the introduction of a semi-quantum channel between the…
The transfer of quantum information between different locations is key to many quantum information processing tasks. Whereas, the transfer of a single qubit state has been extensively investigated, the transfer of a many-body system…
Transmitting quantum states by channels of analogous Bell states is studied in this paper. We analyse the transmitting process, constructed the probabilitic unitary operator, and gain the largest successful transfer quantum state…
Quantum information science has the potential to revolutionize modern technology by providing resource-efficient approaches to computing, communication, and sensing. Although the physical qubits in a realistic quantum device will inevitably…
Faithfully transferring the quantum state is essential for quantum information processing. Here we demonstrate a fast (in 84 ns) and high-fidelity (99.2%) transfer of arbitrary quantum states in a chain of four superconducting qubits with…
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…
This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that…
We study a quantum switch that distributes maximally entangled multipartite states to sets of users. The entanglement switching process requires two steps: first, each user attempts to generate bipartite entanglement between itself and the…
Multiple quantum (MQ) NMR coherence spectra, which can be obtained experimentally in MQ NMR, can be transferred from the sender to the remote receiver without mixing the MQ-coherences of different orders and distortions. The only effect of…
There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the…
A proof that continuous time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by Childs [PRL 102 180501 (2009)]. We present a version based instead on the discrete time…
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…
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…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
We consider the multi-qubit fixed-excitation state transfer along the spin chain with dipole-dipole interaction subjected to the interaction with environment governed by the Lindblad equation preserving the excitation number during…
When studying the perfect transfer of a quantum state from one site to another, it is typically assumed that one can receive the arriving state at a specific instant in time, with perfect accuracy. Here, we study how sensitive perfect state…
In this paper, we investigate a high-dimensional quantum state transfer protocol. An arbitrary unknown high-dimensional state can be transferred with high fidelity between two remote registers through a XX coupling spin chain of arbitrary…
We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties,…