Related papers: Perfect state transfer on graphs with a potential
As quantum information technologies advance, challenges in scaling and connectivity persist, particularly the need for long-range qubit connectivity and efficient entanglement generation. Perfect State Transfer enables time-optimal state…
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…
An oriented circulant graph is called integral if all eigenvalues of its Hermitian adjacency matrix are integers. The main purpose of this paper is to investigate the existence of perfect state transfer ($\PST$ for short) and multiple state…
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…
Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to the case of dynamic graphs, in which an…
We propose a scheme for perfect transfer of an unknown qubit state via the discrete-time quantum walk on a line or a circle. For this purpose, we introduce an additional coin operator which is applied at the end of the walk. This operator…
Perfect state transfer (PST) is discussed in the context of passive quantum networks with logical bus topology, where many logical nodes communicate using the same shared media, without any external control. The conditions under which, a…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
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…
A method for high-fidelity quantum state transfer in a quantum network coupled to a continuum, based on time reversal in the continuum after decay, is theoretically suggested. Provided that the energy spectrum of the network is symmetric…
The neighborhood corona $G \star H$ is the graph obtained by taking one copy $G$ and $|G|$ copies of $H$, and joining each vertex of the $j$th copy of $H$ to all neighbors of $v_{j}$ in $G$. In this paper, we study the state transfer of…
A programmable quantum networks model is used in this paper for development of methods of control of a quantum state transport. These methods may be applied for a wide variety of patterns of controlled state transmission and spreading in…
The evolution of certain pair state in a quantum network with isomorphic branches, governed by the Heisenberg $XY$ Hamiltonian, depends solely on the local structure, and it remains unaffected even if the global structure is altered. All…
We find analytic models that can perfectly transfer, without state initializati$ or remote collaboration, arbitrary functions in two- and three-dimensional interacting bosonic and fermionic networks. We elaborate on a possible…
State transfer is a well-known routine for various systems of spins-$\frac{1}2$. Still, it is not well studied for chains of spins of larger magnitudes. In this contribution we argue that while perfect state transfer may seem unnatural in…
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…
The paper investigates perfect state transfer (PST) in Grover walks on Cayley graphs over the dihedral group $D_n$. The Grover walk is a discrete-time quantum walk widely studied in quantum information processing. A Cayley graph…
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…
We consider the fidelity of state transfer on an unweighted path on $n$ vertices, where a loop of weight $w$ has been appended at each of the end vertices. It is known that if $w$ is transcendental, then there is pretty good state transfer…
We present an alternative approach to unveil a different kind of entanglement in bipartite quantum states whose diagonal zero patterns in suitable matrix representations admit a nice description in terms of triangle-free graphs. Upon…