Related papers: Perfect state transfer in graphs related to linear…

The phase space for a system of $n$ qubits is a discrete grid of $2^{n} \times 2^{n}$ points, whose axes are labeled in terms of the elements of the finite field $\Gal{2^n}$ to endow it with proper geometrical properties. We analyze the…

A general formalism of the problem of perfect state transfer is presented. We show that there are infinitely many Hamiltonians which may provide solution to this problem. In a first attempt to give a classification of them we investigate…

Let X be a non-empty finite set, E be a finite dimensional euclidean vector space and G a finite subgroup of O(E), the orthognal group of E. Suppose GG={U_i | i in X} is a finite set of linear lines in E and an orbit of G on which its…

This work recollects a non-universal set of quantum gates described by higher-dimensional Spin groups. They are also directly related with matchgates in theory of quantum computations and complexity. Various processes of quantum state…

For a set of quantum states generated by the action of a group, we consider the graph obtained by considering two group elements adjacent whenever the corresponding states are non-orthogonal. We analyze the structure of the connected…

By using some techniques such as spectral distribution and stratification associated with the graphs, employed in [1,2] for the purpose of Perfect state transfer (PST) of a single qubit over antipodes of distance-regular spin networks and…

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…

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 introduce some new perfect state transfer and teleportation schemes by quantum walks with two coins. Encoding the transferred information in coin 1 state and alternatively using two coin operators, we can perfectly recover the…

We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…

We quantify the effect of weighted loops at the source and target nodes of a graph on the strength of quantum state transfer between these vertices. We give lower bounds on loop weights that guarantee strong transfer fidelity that works for…

We present the construction of a new family of coherent states for quantum theories of connections obtained following the polymer quantization. The realization of these coherent states is based on the notion of graph change, in particular…

We construct multipartite graph states whose dimension is the power of a prime number. This is realized by the finite field, as well as the generalized controlled-NOT quantum circuit acting on two qudits. We propose the standard form of…

Let $q$ be an odd prime power, let $n\ge 2$, and let $V\subsetneq \mathbb F_{q^n}$ be a proper $\mathbb F_q$-vector subspace. Given a nonzero quadratic form $Q(X,Y)\in \mathbb F_{q^n}[X,Y]$, we consider the graph $\Gamma(Q,V)$ that…

This paper is a sequel to the work of Bhattacharjya et al.\ (J. Phys. A-Math. 57.33: 335303, https://doi.org/10.1088/1751-8121/ad6653) on quantum state transfer on blow-up graphs, where instead of the adjacency matrix, we take the Laplacian…

We present a general formalism to the problem of perfect state-transfer (PST), where the state involves multiple excitations of the quantum network. A key feature of our formalism is that it allows for inclusion of nontrivial interactions…

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.…

This work presents an exactly soluble scheme to address the problem of optimal transfer of quantum states through a set of $s$ harmonic oscillators composing a network with connected ends as a closed quantum circuit. For this purpose we…

In the light of recent advances in fabricating single layer quantum chips and a possible road toward development of multi-layer quantum chips, we review, in a detailed way, the subject of quantum state transfer with particular emphasis on…

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…