Related papers: A high-fidelity quantum state transfer algorithm o…
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 investigate state transfer on a hypercube by means of a quantum walk where the sender and the receiver vertices are marked by a weighted loops. First, we analyze search for a single marked vertex, which can be used for state transfer…
This paper discusses continuous-time quantum walks and asymptotic state transfer in graphs with an involution. By providing quantitative bounds on the eigenvectors of the Hamiltonian, it provides an approach to achieving high-fidelity state…
We prove new results on perfect state transfer of quantum walks on quotient graphs. Since a graph $G$ has perfect state transfer if and only if its quotient $G/\pi$, under any equitable partition $\pi$, has perfect state transfer, we…
Perfect quantum state transfer is achievable in different settings, including linear qubit chains, bi-dimensional arrays, ladders, etc. The most studied case contemplates transferring arbitrary one-qubit pure states in systems with…
We present a new scheme for a discrete-time quantum walk on two- and three-dimensional lattices using a two-state particle. We use different Pauli basis as translational eigestates for different axis and show that the coin operation, which…
We investigate the fidelity of the quantum state transfer (QST) of two qubits by means of an arbitrary spin-1/2 network, on a lattice of any dimensionality. Under the assumptions that the network Hamiltonian preserves the magnetization and…
We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph's method for preparing coherent versions of efficiently…
Studies on Quantum Computing have been developed since the 1980s, motivating researches on quantum algorithms better than any classical algorithm possible. An example of such algorithms is Grover's algorithm, capable of finding $k$ (marked)…
A continuous-time quantum walk on a graph is a matrix-valued function $\exp(-\mathtt{i} At)$ over the reals, where $A$ is the adjacency matrix of the graph. Such a quantum walk has universal perfect state transfer if for all vertices $u,v$,…
Quantum walk is a useful model to simulate complex quantum systems and to build quantum algorithms; in particular, to develop spatial search algorithms on graphs, which aim to find a marked vertex as quickly as possible. Quantum walks are…
The transfer of data is a fundamental task in information systems. Microprocessors contain dedicated data buses that transmit bits across different locations and implement sophisticated routing protocols. Transferring quantum information…
Grover's algorithm is a quantum search algorithm that proceeds by repeated applications of the Grover operator and the Oracle until the state evolves to one of the target states. In the standard version of the algorithm, the Grover operator…
We study the existence of quantum state transfer on non-integral circulant graphs. We find that continuous time quantum walks on quantum networks based on certain circulant graphs with $2^k$ $\left(k\in\mathbb{Z}\right)$ vertices exhibit…
Perfect state transfer between qubits on a uniformly coupled network, with interactions specified by a graph, has advantages over an engineered chain, such as much faster transfer times (independent of the distance between the input and…
The ability to accurately transfer quantum information through networks is an important primitive in distributed quantum systems. While perfect quantum state transfer (PST) can be effected by a single particle undergoing continuous-time…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
Oblivious transfer protocol is a basic building block in cryptography and is used to transfer information from a sender to a receiver in such a way that, at the end of the protocol, the sender does not know if the receiver got the message…
We quantify the effect of weighted loops at the source and target nodes of a graph on the strength of quantum state transfer between these vertices. We give lower bounds on loop weights that guarantee strong transfer fidelity that works for…
We experimentally demonstrate the transfer of an unknown single-qubit state from Alice to Bob via a two-step discrete-time quantum random walk on a cycle with four vertices on a four-qubit nuclear magnetic resonance quantum processor. The…