Related papers: Quantum routing in planar graph using perfect stat…
We consider the representation of a continuous-time quantum walk in a graph $X$ by the matrix $\exp(itA(X))$. We provide necessary and sufficient criteria for distance-regular graphs and, more generally, for graphs in association schemes to…
Quantum networks are composed of nodes which can send and receive quantum states by exchanging photons. Their goal is to facilitate quantum communication between any nodes, something which can be used to send secret messages in a secure…
In the emerging quantum internet, complex network topology could lead to efficient quantum communication and enhanced robustness against failures. However, there are some concerns about complexity in quantum communication networks, such as…
Spin network states are a powerful tool for constructing the $SU(2)$ gauge theories on a graph. In loop quantum gravity (LQG), they have yielded many promising predictions, although progress has been limited by the computational challenge…
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 computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, allowing for any initial and final mapping of circuit qubits…
Quantum walks on undirected graphs have been studied using symmetric matrices, such as the adjacency or Laplacian matrix, and many results about perfect state transfer are known. We extend some of those results to oriented graphs. We also…
Conventional quantum routing operates under the entrenched assumption that pathfinding is a prerequisite for routing. This classical-inspired routing model imposes a restricting design option, which prevents scaling the quantumness to the…
Perfect state transfer between two marked vertices of a graph by means of discrete-time quantum walk is analyzed. We consider the quantum walk search algorithm with two marked vertices, sender and receiver. It is shown by explicit…
Distributed quantum networks are not merely information conduits but intricate systems that embody the principles of quantum mechanics. In our study, we examine the underlying mechanisms of quantum connectivity within a distributed…
Quantum Markov networks are a generalization of quantum Markov chains to arbitrary graphs. They provide a powerful classification of correlations in quantum many-body systems---complementing the area law at finite temperature---and are…
We propose and analyze a setup based on (solid-state) qubits coupled to a common multi-mode transmission line, which allows for coherent spin-spin interactions over macroscopic on-chip distances, without any ground-state cooling…
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…
We consider the perfect transfer of a state between arbitrary nodes of one-dimensional spin-1/2 chain with optimally engineered couplings. Motivated by the fact that such a system could be used as a data bus for connecting multiple quantum…
We study the transfer of quantum information through a Heisenberg spin-1 chain prepared in its ground state. We measure the efficiency of such a quantum channel {\em via} the fidelity of retrieving an arbitrarily prepared state and {\em…
We consider multi-path routing of entanglement in quantum networks, where a pre-prepared multipartite entangled 2D cluster state serves as a resource to perform different tasks on demand. We show how to achieve parallel connections between…
Recent work has shown that a simple chain of interacting spins can be used as a medium for high-fidelity quantum communication. We describe a scheme for quantum communication using a spin system that conserves z-spin, but otherwise is…
Entanglement, one of the clearest manifestations of non-classical physics, holds significant promise for technological applications such as more secure communications and faster computations. In this paper we explore the use of…
A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby be seen as a small few qubit quantum computer. Qubits can be…
We investigate graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that when a quantum network is described by such a graph, the network is efficiently controllable, in…