Related papers: Perfect state transfer, graph products and equitab…
Quantum walks on graphs are fundamental to quantum computing and have led to many interesting open problems in algebraic graph theory. This review article highlights three key classes of open problems in this domain; perfect state transfer,…
Using a global optimization algorithm we obtain spin chains with site-dependent exchange coefficients which allow almost perfect quantum state transfer between the extremes of the chains without any further time-dependent external control.…
In this paper, we characterize the existence of perfect state transfer (PST) and fractional revival in continuous-time quantum walks on the zero-divisor graph $\Gamma(\mathbb{Z}_n)$. By using the canonical equitable partition of…
This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by…
The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the…
We demonstrate that perfect state transfer can be achieved using an engineered spin chain and clean local end-chain operations, without requiring the initialization of the state of the medium nor fine tuning of control-pulses. This…
High-dimensional quantum systems can offer extended possibilities and multiple advantages while developing advanced quantum technologies. In this paper, we propose a class of quantum-walk architecture networks that admit the efficient…
Continuous-time open quantum walks (CTOQW) are introduced as the formulation of quantum dynamical semigroups of trace-preserving and completely positive linear maps (or quantum Markov semigroups) on graphs. We show that a CTOQW always…
We construct the exact solution for a family of one-half spin chains explicitly. The spin chains Hamiltonian corresponds to an isotropic Heisenberg Hamiltonian, with staggered exchange couplings that take only two different values. We work…
We present a communication protocol for chains of permanently coupled qubits which achieves perfect quantum state transfer and which is efficient with respect to the number chains employed in the scheme. The system consists of $M$ uncoupled…
We study the protocol known as quantum state transfer for a strongly coupled antiferromagnetic spin chain or ring (acting as a spin bus), with weakly coupled external qubits. By treating the weak coupling as a perturbation, we find that…
In this paper, we present an abstract model of continuous-time quantum walk (CTQW) based on Bernoulli functionals and show that the model has perfect state transfer (PST), among others. Let $\mathfrak{h}$ be the space of square integrable…
In a one-dimensional Heisenberg chain, we show that there are no sets of coupling strengths such that the evolution perfectly transfers a quantum state between the two ends of the chain without the addition of magnetic fields. In lieu of…
We analyse the sensitivity of a spin chain modelled by an undirected weighted connected graph exhibiting perfect state transfer to small perturbations in readout time and edge weight in order to obtain physically relevant bounds on the…
We explore algebraic and spectral properties of weighted graphs containing twin vertices that are useful in quantum state transfer. We extend the notion of adjacency strong cospectrality to arbitrary Hermitian matrices, with focus on the…
Distributing arbitrary graph states across quantum networks is a central challenge for modular quantum computing and measurement-based quantum communication. We introduce the phase quantum walk (PQW), a discrete-time quantum walk in which…
Transferring quantum states efficiently between distant nodes of an information processing circuit is of paramount importance for scalable quantum computing. We report on the first observation of a perfect state transfer protocol on a…
We prove that the corona product of two graphs has no Laplacian perfect state transfer whenever the first graph has at least two vertices. This complements a result of Coutinho and Liu who showed that no tree of size greater than two has…
Chains of transmon qubits are considered promising systems to implement different quantum information tasks. In particular as channels that perform high-quality quantum state transfer. We study how changing the interaction strength between…
We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph G is universal mixing if the instantaneous or average probability distribution of the quantum walk on G ranges over…