Related papers: Quantum state transfer on the complete bipartite g…
In this paper, a study on discrete-time coined quantum walks on the line is presented. Clear mathematical foundations are still lacking for this quantum walk model. As a step towards this objective, the following question is being…
To transport high-quality quantum state between two distant qubits through one-dimensional spin chains, the perfect state transfer (PST) method serves as the first choice, due to its natively perfect transfer fidelity that is independent of…
We give a complete characterization of pretty good state transfer on paths between any pair of vertices with respect to the quantum walk model determined by the XY-Hamiltonian. If $n$ is the length of the path, and the vertices are indexed…
A quantum walk places a traverser into a superposition of both graph location and traversal "spin." The walk is defined by an initial condition, an evolution determined by a unitary coin/shift-operator, and a measurement based on the…
In quantum communication, quantum state transfer from one location to another in a quantum network plays a prominent role, where the impact of noise could be crucial. The idea of state transfer can be fruitfully associated with quantum walk…
A fundamental task in quantum information science is to transfer an unknown state from particle $A$ to particle $B$ (often in remote space locations) by using a bipartite quantum operation $\mathcal{E}^{AB}$. We suggest the power of…
We study a continous-time quantum walk on a path graph. In this paper, we show that, for any odd prime $p$ and positive integer $t$, the path on $2^t p - 1$ vertices admits pretty good state transfer between vertices $a$ and $n+1-a$ for…
Quantum networks consist of quantum nodes that are linked by entanglement and quantum information can be transferred from one node to another. Operations can be applied to qubits of local nodes coordinated by classical communication to…
Quantum state transfer is an important task in quantum information processing. It is known that one can engineer the couplings of a one-dimensional spin chain to achieve the goal of perfect state transfer. To leverage the value of these…
A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix…
We consider an exact state transmission, where a density matrix in one information processor A at time $t=0$ is exactly equal to that in another processor B at a later time. We demonstrate that there always exists a complete set of…
We propose and experimentally demonstrate a novel protocol for transferring quantum states between superconducting cavities using only continuous two-mode squeezing interactions, without exchange of photonic excitations between cavities.…
Quantum state transfer from an information-carrying qubit to a receiving qubit is ubiquitous for quantum information technology. In a closed quantum system, this task requires precisely-timed control of coherent qubit-qubit interactions…
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 uniformly coupled double quantum Hamiltonian for a spin chain has recently been implemented experimentally. We propose a method for the determination of initial quantum states that will provide perfect or near-perfect state transmission…
We propose a protocol for perfect state transfer between any pair of vertices in a hypercube. Given a pair of distinct vertices in the hypercube we determine a sub-hypercube that contains the pair of vertices as antipodal vertices. Then a…
Quantum counting is a key quantum algorithm that aims to determine the number of marked elements in a database. This algorithm is based on the quantum phase estimation algorithm and uses the evolution operator of Grover's algorithm because…
Quantum walks on translation invariant regular graphs spread quadratically faster than their classical counterparts. The same coherence that gives them this quantum speedup inhibits, or even stops their spread in the presence of disorder.…
Perfect state transfer (PST) has great significance due to its applications in quantum information processing and quantum computation. In this paper we present a characterization on connected simple Cayley graph $\Gamma={\rm Cay}(G,S)$…
We develop a mathematically rigorous theory for the quantum transfer processes in degenerate donor-acceptor dimers in contact with a thermal environment. We calculate explicitly the transfer rates and the acceptor population efficiency. The…