Related papers: Quantum state transfer on integral oriented circul…
We introduce a scheme for perfect state transfer in regular two and three dimensional structures. The interactions on the lattices are of XX spin type with uniform couplings. In two dimensions the structure is a hexagonal lattice and in…
In this paper we derive analytical relations between probabilities of the excited state transfers and entanglements calculated by both the Wootters and positive partial transpose (PPT) criteria for the arbitrary spin system with single…
The three- spin chain with Heisenberg XY- interaction is simulated in a three- qubit nuclear magnetic resonance (NMR) quantum computer. The evolution caused by the XY- interaction is decomposed into a series of single- spin rotations and…
We demonstrate that a quantum graph exhibits a $\mathcal{PT}$-symmetry provided the coefficients in the condition describing the wave function matching at the vertices are circulant matrices; this symmetry is nontrivial if they are not…
While continuous-variable (CV) quantum systems are believed to be more efficient for quantum sensing and metrology than their discrete-variable (DV) counterparts due to the infinite spectrum of their native operators, our toolkit of…
A theory of orientation on gain graphs (voltage graphs) is developed to generalize the notion of orientation on graphs and signed graphs. Using this orientation scheme, the line graph of a gain graph is studied. For a particular family of…
We explicitate the relation between Hamiltonians for networks of interacting qubits in the XYZ model and graph Laplacians. We then study evolution in networks in which all sites can communicate with each other. These are modeled by the…
Regular families of coupled quantum networks are described such the unknown state of a qubit can be perfectly routed from any node to any other node in a time linear in the distance. Unlike previous constructions, the transfer can be…
A graph is said to be symmetric if its automorphism group is transitive on its arcs. Guo et al. (Electronic J. Combin. 18, \#P233, 2011) and Pan et al. (Electronic J. Combin. 20, \#P36, 2013) determined all pentavalent symmetric graphs of…
On a finite regular graph, (co)resonant states are eigendistributions of the transfer operator associated to the shift on one-sided infinite non-backtracking paths. We introduce two pairings of resonant and coresonant states, the vertex…
On the basis of the method of iterative summation of path integrals (ISPI), we develop a numerically exact transfer-matrix method to describe the nonequilibrium properties of interacting quantum-dot systems. For this, we map the ISPI scheme…
The transfer of quantum information between different locations is key to many quantum information processing tasks. Whereas, the transfer of a single qubit state has been extensively investigated, the transfer of a many-body system…
The quadratic unitary Cayley graph $\mathcal{G}_{\mathbb{Z}_n}$ has vertex set $\mathbb{Z}_n: =\{0,1, \ldots ,n-1\}$, where two vertices $u$ and $v$ are adjacent if and only if $u - v$ or $v-u$ is a square of some units in $\mathbb{Z}_n$.…
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…
The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in…
We prove that the empirical density of states of quantum spin glasses on arbitrary graphs converges to a normal distribution as long as the maximal degree is negligible compared with the total number of edges. This extends the recent…
The inertia of a graph $G$ is defined to be the triplet $In(G) = (p(G), n(G), $ $\eta(G))$, where $p(G)$, $n(G)$ and $\eta(G)$ are the numbers of positive, negative and zero eigenvalues (including multiplicities) of the adjacency matrix…
The natural notion of almost perfect state transfer (APST) is examined. It is applied to the modelling of efficient quantum wires with the help of $XX$ spin chains. It is shown that APST occurs in mirror-symmetric systems, when the…
The convex set of quantum states of a composite $K \times K$ system with positive partial transpose is analysed. A version of the hit and run algorithm is used to generate a sequence of random points covering this set uniformly and an…
The basic idea of spin chain engineering for perfect quantum state transfer (QST) is to find a set of coupling constants in the Hamiltonian, such that a particular state initially encoded on one site will evolve freely to the opposite site…