Related papers: Perfect State Transfer, Effective Gates and Entang…
Our work addresses the problem of generating maximally entangled two spin-1/2 (qubit) symmetric states using NMR, NQR, Lipkin-Meshkov-Glick Hamiltonians. Time evolution of such Hamiltonians provides various logic gates which can be used for…
The realization of robust universal quantum computation with any platform ultimately requires both the coherent storage of quantum information and (at least) one entangling operation between individual elements. The use of…
We propose a quantum network consisting of optical waveguides in the linear regime for quantum state transfer. The circular topology of our network introduces novel functionalities that enable us to analytically identify the conditions…
We show a perfect state transfer of an arbitrary unknown two-qubit state can be achieved via a discrete-time quantum walk with various settings of coin flippings, and extend this method to distribution of an arbitrary unknown multi-qubit…
We present and implement an efficient variational method to simulate two-dimensional finite size fermionic quantum systems by fermionic projected entangled pair states. The approach differs from the original one due to the fact that there…
Large-scale quantum information processing networks will most probably require the entanglement of distant systems that do not interact directly. This can be done by performing entangling gates between standing information carriers, used as…
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…
In the present paper, the first in a series of two, we propose a model of universal quantum computation using a fermionic/bosonic multi-particle continuous-time quantum walk with two internal states (e.g., the spin-up and down states of an…
Given a graph with Hermitian adjacency matrix $H$, perfect state transfer occurs from vertex $a$ to vertex $b$ if the $(b,a)$-entry of the unitary matrix $\exp(-iHt)$ has unit magnitude for some time $t$. This phenomenon is relevant for…
In this paper we build on the ideas presented in previous works for perfectly transferring a quantum state between opposite ends of a spin chain using a fixed Hamiltonian. While all previous studies have concentrated on nearest-neighbor…
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…
We demonstrate that conditional as well as unconditional basic operations which are prerequisite for universal quantum gates can be performed with almost 100% fidelity within a strongly interacting two-electron quantum ring. Both sets of…
Quantum state transfer within a quantum computer can be achieved by using a network of qubits, and such a network can be modelled mathematically by a graph. Here, we focus on the corresponding Laplacian matrix, and those graphs for which…
Quantum state transfer in the presence of noise is one of the main challenges in building quantum computers. We compare the quantum state transfer properties for two classes of qubit chains under the influence of static randomness. In fully…
Entanglement-based networks (EBNs) enable general-purpose quantum communication by combining entanglement and its swapping in a sequence that addresses the challenges of achieving long distance communication with high fidelity associated…
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…
We propose a method to deterministically entangle qubits or ensembles of qubits interacting with a shared bosonic mode in the ultrastrong coupling regime. We show that the resulting gate is a product of two unitaries: one unitary acts only…
The ability to realize high-fidelity quantum communication is one of the many facets required to build generic quantum computing devices. In addition to quantum processing, sensing, and storage, transferring the resulting quantum states…
We describe a protocol for perfectly transferring a quantum state from one party to another under the dynamics of a fixed, engineered Hamiltonian. Our protocol combines the concepts of fractional revival, dual rail encoding, and a rare…
We show how the spin independent scattering between two identical flying qubits can be used to implement an entangling quantum gate between them. We consider one dimensional models with a delta interaction in which the qubits undergoing the…