Related papers: Peak state transfer in continuous quantum walks
Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with…
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…
We suggest a scheme that allows arbitrarily perfect state transfer even in the presence of random fluctuations in the couplings of a quantum chain. The scheme performs well for both spatially correlated and uncorrelated fluctuations if they…
The existence of perfect state transfer (PST) on quantum spin networks is a fundamental problem in mathematics and physics. Various works in the literature have explored PST in graphs with arithmetic origins, such as gcd-graphs over…
Spin chains have been proposed as wires to transport information between distributed registers in a quantum information processor. Unfortunately, the challenges in manufacturing linear chains with engineered couplings has hindered…
The Quantum Speed Limit can be found in many different situations, in particular in the propagation of information through quantum spin chains. In homogeneous chains it implies that taking information from one extreme of the chain to the…
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…
An $s$-pair state in a graph is a quantum state of the form $\mathbf{e}_u+s\mathbf{e}_v$, where $u$ and $v$ are vertices in the graph and $s$ is a non-zero complex number. If $s=-1$ (resp., $s=1$), then such a state is called a pair state…
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 describe an efficient protocol to perform quantum state transfer using Hamiltonian dynamics with long-range interactions. The time to transfer $n$ qubits a sufficiently large distance is proportional to $\sqrt{n}$. Even without error…
Ideally, quantum teleportation should transfer a quantum state without distortion and without providing any information about that state. However, quantum teleportation of continuous electromagnetic field variables introduces additional…
In this paper we show how using complex valued edge weights in a graph can completely suppress the flow of probability amplitude in a continuous time quantum walk to specific vertices of the graph when the edge weights, graph topology and…
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…
We propose a protocol for perfect quantum state transfer that is resilient to a broad class of realistic experimental imperfections, including noise sources that could be modelled either as independent Markovian baths or as certain forms of…
Ballistic quantum-information transfer through spin chains is based on the idea of making the spin dynamics ruled by collective excitations with linear dispersion relation. Unlike perfect state transfer schemes, a ballistic transmission…
Quantum state transfer is a fundamental requirement for scalable quantum computation, where fast and reliable communication between distant subsystems is essential. In this work, we present a protocol for quantum state transfer in linear…
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…
Finding minimal time and establishing the structure of the corresponding optimal controls which can transfer a given initial state of a quantum system into a given target state is a key problem of quantum control. In this work, this problem…
Achieving quantum state transfer in passive ways can become a powerful asset for scalable quantum networks. Here, we demonstrate how giant atoms coupled to 1D waveguides provide a platform for such a passive, deterministic transfer.…
Quantum state propagation over binary tree configurations is studied in the context of quantum spin networks. For binary tree of order two a simple protocol is presented which allows to achieve arbitrary high transfer fidelity. It does not…