Related papers: Quantum routing in planar graph using perfect stat…
We propose a quantum-state transfer protocol in a spin chain that requires only the control of the spins at the ends of the quantum wire. The protocol is to a large extent insensitive to inhomogeneity caused by local magnetic fields and…
Spin chains have been proposed as quantum wires for information transfer in solid state quantum architectures. We show that huge gains in both transfer speed and fidelity are possible using a minimalist control approach that relies only a…
Spin chains have long been considered as candidates for quantum channels to facilitate quantum communication. We consider the transfer of a single excitation along a spin-1/2 chain governed by Heisenberg-type interactions. We build on the…
We consider a quantum walk with two marked vertices, sender and receiver, and analyze its application to perfect state transfer on complete bipartite graphs. First, the situation with both the sender and the receiver vertex in the same part…
A continuous-time quantum random walk describes the motion of a quantum mechanical particle on an underlying graph. The graph itself is associated with a Hilbert space of dimension equal to the number of vertices. The dynamics of the walk…
A continuous-time quantum walk on a graph $X$ is represented by the complex matrix $\exp (-\mathrm{i} t A)$, where $A$ is the adjacency matrix of $X$ and $t$ is a non-negative time. If the graph models a network of interacting qubits,…
Semiconductor hole-spin qubits offer a promising route to quantum computation due to their weak hyperfine interaction, and strong intrinsic spin-orbit coupling enabling electric control of qubits. Scalable architectures, however, require…
In a quantum communication network, links represent entanglement between qubits located at different nodes. Even if two nodes are not directly linked by shared entanglement, communication channels can be established between them via quantum…
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 demonstrate that an aperiodic array of certain quantum networks comprising magnetic and non-magnetic atoms can act as perfect spin filters for particles with arbitrary spin state. This can be achieved by introducing minimal quasi-one…
Quantum information science has the potential to revolutionize modern technology by providing resource-efficient approaches to computing, communication, and sensing. Although the physical qubits in a realistic quantum device will inevitably…
Generating high-quality multi-particle entanglement between communicating parties is the primary resource in quantum teleportation protocols. To this aim, we show that the natural dynamics of a single spin chain is able to sustain the…
Graph structure of quantum spin networks plays an essential role in applying quantum annealing (QA). The Ising model is the typical choice to describe the interactions between the spins in the networks. Here, we explore the interplay of…
The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between…
Faithfully transferring the quantum state is essential for quantum information processing. Here we demonstrate a fast (in 84 ns) and high-fidelity (99.2%) transfer of arbitrary quantum states in a chain of four superconducting qubits with…
We introduce an elementary quantum system consisting of a set of spins on a graph and a particle hopping between its nodes. The quantum state is build sequentially, applying a unitary transformation that couples neighboring spins and, at a…
Perfect transfer of {\em unknown} states across distinct nodes is a basic function in bosonic quantum networks. Here we develop a general theory to construct an $N$-node bosonic network governed by the time-dependent Hamiltonian, as the…
We demonstrate that a translation invariant chain of interacting quantum systems can be used for high efficiency transfer of quantum entanglement and the generation of multi-particle entanglement over large distances and between arbitrary…
Multipartite entangled states are great resources for quantum networks. In this work we study the distribution, or routing, of entangled states over fixed, but arbitrary, physical networks. Our simplified model represents each use of a…
Recent progress in applying complex network theory to problems in quantum information has resulted in a beneficial crossover. Complex network methods have successfully been applied to transport and entanglement models while information…