Related papers: Strong quantum state transfer on graphs via loop e…
When analyzing weighted networks using spectral embedding, a judicious transformation of the edge weights may produce better results. To formalize this idea, we consider the asymptotic behavior of spectral embedding for different…
We investigate the entanglement properties of quantum states associated with directed graphs. Using a measure derived from the Fubini-Study metric, we quantitatively relate multipartite entanglement to the local connectivity of the graph.…
Quantum state transfer between different sites is a significant problem for quantum networks and quantum computers. By selecting quantum walks with two coins as the basic model and two coin spaces as the communication carriers, we…
Perfect state transfer is significant in quantum communication networks. There are very few graphs having this property. So, it is useful to find some new graphs having perfect state transfer. A good way to construct new graphs is by…
Quantum computation attaches importance to high-precision quantum manipulation, where the quantum state transfer with high fidelity is necessary. Here, we propose a new scheme to implement the quantum state transfer of high fidelity and…
We present several protocols for reliable quantum state transfer through a spin chain. We use a simple two-spin encoding to achieve a remarkably high fidelity transfer for an arbitrary quantum state. The fidelity of the transfer also…
We investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic…
In this paper, we study pretty good state transfer (PGST) in Grover walks on graphs. We consider transfer of quantum states that are localized at the vertices of a graph and we use Chebyshev polynomials to analyze PGST between such states.…
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…
Highly efficient transfer of quantum resources including quantum excitations, states, and information on quantum networks is an important task in quantum information science. Here, we propose a bipartite-graph framework for studying quantum…
In this paper we consider the problem of transmission across a graph and how to effectively control/restrict it with limited resources. Transmission can represent information transfer across a social network, spread of a malicious virus…
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…
Recent technological advances have allowed the fabrication of large arrays of coupled qubits serving as prototypes of quantum processors. However, the optimal control of such systems is notoriously hard, which limits the potential of…
Most real-world networks are weighted graphs with the weight of the edges reflecting the relative importance of the connections. In this work, we study non degree dependent correlations between edge weights, generalizing thus the…
We propose a measure to quantify the efficiency of classical and quantum mechanical transport processes on graphs. The measure only depends on the density of states (DOS), which contains all the necessary information about the graph. For…
We develop a theory to measure the variance and covariance of probability distributions defined on the nodes of a graph, which takes into account the distance between nodes. Our approach generalizes the usual (co)variance to the setting of…
Quantum graph state is a special class of nonlocal state among multiple quantum particles, underpinning several nonclassical and promising applications such as quantum computing and quantum secret sharing. Recently, establishing quantum…
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…
As quantum theory allows for information processing and computing tasks that otherwise are not possible with classical systems, there is a need and use of quantum Internet beyond existing network systems. At the same time, the realization…
A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with…