Related papers: Strong quantum state transfer on graphs via loop e…
In this paper we show how using complex valued edge weights in a graph can completely suppress the flow of probability amplitude in a continuous time quantum walk to specific vertices of the graph when the edge weights, graph topology and…
We consider quantum graph states that can be mapped to directed weighted graphs, also known as directed networks. The geometric measure of entanglement of the states is calculated for the quantum graph states corresponding to arbitrary…
A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix…
Continuous-time quantum walk describes the propagation of a quantum particle (or an excitation) evolving continuously in time on a graph. As such, it provides a natural framework for modeling transport processes, e.g., in light-harvesting…
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…
Quantum effects are known to provide an advantage in particle transfer across networks. In order to achieve this advantage, requirements on both a graph type and a quantum system coherence must be found. Here we show that the process of…
The growing complexity of wireless systems has accelerated the move from traditional methods to learning-based solutions. Graph Neural Networks (GNNs) are especially well-suited here, since wireless networks can be naturally represented as…
Perfect (quantum) state transfer has been proved to be an effective model for quantum information processing. In this paper, we give a characterization of cubelike graphs having perfect edge state transfer. By using a lifting technique, we…
Quantum walks have frequently envisioned the behavior of a quantum state traversing a classically defined, generally finite, graph structure. While this approach has already generated significant results, it imposes a strong assumption: all…
We study the state transfer through quantum walks placed on a bounded one-dimensional path. We first consider continuous-time quantum walks from a Gaussian state. We find such a state when superposing centered on the starting and antipodal…
Quantum state transfer protocols are a major toolkit in many quantum information processing tasks, from quantum key distribution to quantum computation. To assess performance of a such a protocol, one often relies on the average fidelity…
Quantum states of spin systems that can be represented with weighted graphs $G(V, E)$ are studied. The geometrical characteristics of these states are examined. We find that the velocity of quantum evolution is determined by the sum of the…
High-fidelity quantum state transfer is critical for quantum communication and scalable quantum computation. Current quantum state transfer algorithms on the complete bipartite graph, which are based on discrete-time quantum walk search…
Quantum networks consist of quantum nodes that are linked by entanglement and quantum information can be transferred from one node to another. Operations can be applied to qubits of local nodes coordinated by classical communication to…
We examine quantum transport in periodic quantum graphs with a vertex coupling non-invariant with respect to time reversal. It is shown that the graph topology may play a decisive role in the conductivity properties illustrating this claim…
We study quantum state transfer through a qubit network modeled by spins with XY interaction, when relying on a single excitation. We show that it is possible to achieve perfect transfer by shifting (adding) energy to specific vertices.…
We study the transmission of a quantum particle along a straight input--output line to which a graph $\Gamma$ is attached at a point. In the point of contact we impose a singularity represented by a certain properly chosen scale-invariant…
We consider graphs with two cut vertices joined by a path with one or two edges, and prove that there can be no quantum perfect state transfer between these vertices, unless the graph has no other vertex. We achieve this result by applying…
In this paper, we investigate a high-dimensional quantum state transfer protocol. An arbitrary unknown high-dimensional state can be transferred with high fidelity between two remote registers through a XX coupling spin chain of arbitrary…
Graph states are an important class of multipartite entangled quantum states. We propose a new approach for distributing graph states across a quantum network. We consider a quantum network consisting of nodes-quantum computers within which…