Related papers: On quantum perfect state transfer in weighted join…
Quantum spin networks can be used to transport information between separated registers in a quantum information processor. To find a practical implementation, the strict requirements of ideal models for perfect state transfer need to be…
Let $X$ be a graph on $n$ vertices with with adjacency matrix $A$ and let $H(t)$ denote the matrix-valued function $\exp(iAt)$. If $u$ and $v$ are distinct vertices in $X$, we say perfect state transfer}from $u$ to $v$ occurs if there is a…
We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and Graph Theory. In these setups, the paths of photons are identified such that the photon-source information is never created.…
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…
Let $G$ be a graph with adjacency matrix $A$. The transition matrix corresponding to $G$ is defined by $H(t):=\exp{\left(itA\right)}$, $t\in\Rl$. The graph $G$ is said to have perfect state transfer (PST) from a vertex $u$ to another vertex…
This article presents a novel and succinct algorithmic framework via alternating quantum walks, unifying quantum spatial search, state transfer and uniform sampling on a large class of graphs. Using the framework, we can achieve exact…
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…
This work deals with quantum graphs, focusing on the transmission properties they engender. We first select two simple diamond graphs, and two hexagonal graphs in which the vertices are all of degree 3, and investigate their transmission…
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 investigate coined quantum walk search and state transfer algorithms, focusing on the complete $M$-partite graph with $N$ vertices in each partition. First, it is shown that by adding a loop to each vertex the search algorithm finds the…
We study state transfer in quantum walk on graphs relative to the adjacency matrix. Our motivation is to understand how the addition of pendant subgraphs affect state transfer. For two graphs $G$ and $H$, the Frucht-Harary corona product $G…
The aim of this review paper is to discuss some applications of orthogonal polynomials in quantum information processing. The hope is to keep the paper self contained so that someone wanting a brief introduction to the theory of orthogonal…
We propose a quantum network consisting of optical waveguides in the linear regime for quantum state transfer. The circular topology of our network introduces novel functionalities that enable us to analytically identify the conditions…
We study the routing of quantum information in parallel on multi-dimensional networks of tunable qubits and oscillators. These theoretical models are inspired by recent experiments in superconducting circuits using Josephson junctions and…
We describe a protocol for perfectly transferring a quantum state from one party to another under the dynamics of a fixed, engineered Hamiltonian. Our protocol combines the concepts of fractional revival, dual rail encoding, and a rare…
The transport of quantum states is a crucial aspect of information processing systems, facilitating operations such as quantum key distribution and inter-component communication within quantum computers. Most quantum networks rely on…
We consider pretty good state transfer in coined quantum walks between antipodal vertices on the hypercube $Q_d$. When $d$ is a prime, this was proven to occur in the arc-reversal walk with Grover coins. We extend this result by…
Quantum metrology exploits quantum mechanical effects to increase the precision of measurements of physical quantities. A wide variety of applications are currently being developed for scientific and technological purposes, however, most…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…