Related papers: Perfect state transfer in graphs related to linear…
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…
Faithfully transferring the quantum state is essential for quantum information processing. Here we demonstrate a fast (in 84 ns) and high-fidelity (99.2%) transfer of arbitrary quantum states in a chain of four superconducting qubits with…
We investigate the quantum state transfer in a chain of particles satisfying q-deformed oscillators algebra. This general algebraic setting includes the spin chain and the bosonic chain as limiting cases. We study conditions for perfect…
In this paper, we consider a continuous-time quantum walk based search algorithm. We introduce equitable partition of the graph and perfect state transfer on it. By these two methods, we can calculate the success probability and the finding…
Motivated by the need for communication of coherent state-based qubits in quantum computers, we introduce a method for perfect transferring of an arbitrary superposition of coherent states between two distant nodes of a linear array of…
The transfer of quantum states has played an important role in quantum information processing. In fact, transfer of quantum states from point $A$ to $B$ with unit fidelity is very important for us and we focus on this case. In recent years,…
We propose to use ferromagnetic systems for entanglement generation and distribution together with perfect state transfer between distant parties in a qubit chain. The scheme relies on an effective 2-qubit dynamics, realized by leaving two…
This paper deals with the classification of groups $G$ such that power graphs and proper power graphs of $G$ are line graphs. In fact, we classify all finite nilpotent groups whose power graphs are line graphs. Also, we categorize all…
In this paper, we investigate certain graphs defined on groups, with a focus on infinite groups. The graphs discussed are the power graph, the enhanced power graph, and the commuting graph whose vertex set is a group $G$. The power graph is…
We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…
Probabilistic quantum state transformations can be characterized by the degree of state separation they provide. This, in turn, sets limits on the success rate of these transformations. We consider optimum state separation of two known pure…
Search and state transfer between hubs, i.e. fully connected vertices, on otherwise arbitrary connected graph is investigated. Motivated by a recent result of Razzoli et al. (J. Phys. A: Math. Theor. 55, 265303 (2022)) on universality 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…
We propose a protocol to generate a stream of mobile qubits in a graph state through a single stationary parent qubit and discuss two types of its physical implementation, namely, the generation of photonic graph states through an atom-like…
A non-complete graph is \emph{$2$-distance-transitive} if, for $i=1,2$ and for any two vertex pairs $(u_1,v_1)$ and $(u_2,v_2)$ with the same distance $i$ in the graph, there exists an element of the graph automorphism group that maps…
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…
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…
Graph structures are ubiquitous throughout the natural sciences. Here we consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. In particular, we consider training data…
In this paper we investigate families of connected graphs which do not contain an odd cycle in their complement. Specifically, we consider graphs formed by two complete graphs connected in a particular way. We determine which of these…
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…