Related papers: Peak state transfer in continuous quantum walks
Performing a faithful transfer of an unknown quantum state is a key challenge for enabling quantum networks. The realization of networks with a small number of quantum links is now actively pursued, which calls for an assessment of…
Twin vertices in simple unweighted graphs are vertices that have the same neighbours and, in the case of weighted graphs with possible loops, the corresponding incident edges have equal weights. In this paper, we explore the role of twin…
In this paper we provide a novel way to explore the relation between quantum teleportation and quantum phase transition. We construct a quantum channel with a mixed state which is made from one dimensional quantum Ising chain with infinite…
In the quest for designing novel protocols for quantum information and quantum computation, an important goal is to achieve perfect quantum state transfer for systems beyond the well-known one dimensional cases, such as 1d spin chains. We…
Distributing arbitrary graph states across quantum networks is a central challenge for modular quantum computing and measurement-based quantum communication. We introduce the phase quantum walk (PQW), a discrete-time quantum walk in which…
We consider pretty good state transfer in coined quantum walks between antipodal vertices on the hypercube $Q_d$. When $d$ is a prime, this was proven to occur in the arc-reversal walk with Grover coins. We extend this result by…
Perfect transfer of a quantum state through a one-dimensional chain is now well understood, allowing one not only to decide whether a fixed Hamiltonian achieves perfect transfer, but to design a suitable one. We are particularly interested…
Semiconductor quantum-dot spin qubits are a promising platform for quantum computation, because they are scalable and possess long coherence times. In order to realize this full potential, however, high-fidelity information transfer…
Effective transport of quantum information is an essential element of quantum computation. We consider the problem of transporting a quantum state by using a moving potential well, while maintaining the encoded quantum information. In…
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 show that certain types of quantum walks can be modeled as waves that propagate in a medium with phase and group velocities that are explicitly calculable. Since the group and phase velocities indicate how fast wave packets can propagate…
One of the most basic tasks required for Quantum Information Technology is the ability to connect different components of a Quantum Computer by quantum wires that obey the superposition principle. Since superpositions can be very sensitive…
Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to the case of dynamic graphs, in which an…
Let A be the adjacency matrix of a graph $X$ and suppose U(t)=exp(itA). We view A as acting on $\cx^{V(X)}$ and take the standard basis of this space to be the vectors $e_u$ for $u$ in $V(X)$. Physicists say that we have perfect state…
High fidelity quantum state transfer is an essential part of quantum information processing. In this regard, we address the problem of maximizing the fidelity in a quantum state transformation process satisfying the Liouville-von Neumann…
A blow-up of $n$ copies of a graph $G$ is the graph $\overset{n}\uplus~G$ obtained by replacing every vertex of $G$ by an independent set of size $n$, where the copies of vertices in $G$ are adjacent in the blow-up if and only if the…
We study the routing of quantum information in parallel on multi-dimensional networks of tunable qubits and oscillators. These theoretical models are inspired by recent experiments in superconducting circuits using Josephson junctions and…
Perfect state transfer (PST) has great significance due to its applications in quantum information processing and quantum computation. In this paper we present a characterization on connected simple Cayley graph $\Gamma={\rm Cay}(G,S)$…
We propose a protocol for perfect state transfer between any pair of vertices in a hypercube. Given a pair of distinct vertices in the hypercube we determine a sub-hypercube that contains the pair of vertices as antipodal vertices. Then a…
Robust quantum routing is essential for scalable quantum technologies. This paper investigates the resilience of routing protocols in network architectures designed for perfect, high-fidelity transfer of both classical and quantum…