Related papers: Perfect State Transfer without State Initializatio…
In this paper, a three party controlled quantum secure direct communication protocol based on GHZ like state is proposed. In this scheme, the receiver can obtain the sender s two secret bits under the permission of the controller. By using…
We study the existence of state transfer with respect to the $q$-Laplacian matrix of a graph equipped with a non-trivial involution. We show that the occurrence of perfect state transfer between certain pair (or plus) states in such a graph…
We study perfect state transfer on quantum networks represented by weighted graphs. Our focus is on graphs constructed from the join and related graph operators. Some specific results we prove include: (1) The join of a weighted two-vertex…
We provide a characterization of perfect state transfer in a quantum walk whose Hamiltonian is given by the normalized Laplacian. We discuss a connection between classical random walks and quantum walks only present in this model, and we…
We study a quantum state transfer between spins interacting with an arbitrary network of spins coupled by uniform XX interactions. It is shown that in such a system under fairly general conditions, we can expect a nearly perfect transfer of…
Quantum teleportation provides a way to transfer unknown quantum states from one system to another via an entangled state as a quantum channel without physical transmission of the object itself. The entangled channel, measurement performed…
Achieving robust and scalable remote quantum entanglement is a fundamental challenge for the development of distributed quantum networks and modular quantum computing systems. Along this, perfect state transfer (PST) and fractional state…
Qubit(s) transfer through a helical chain is studied. We consider the transfer of a single state and Bell states across a multiferroic spin chain and the possibility of an electric field control of the fidelity of the single state and the…
We show how to achieve perfect quantum state transfer and construct effective two-qubit gates between distant sites in engineered bosonic and fermionic networks. The Hamiltonian for the system can be determined by choosing an eigenvalue…
We propose and analyze a scheme for conditional state transfer in a Heisenberg $XXZ$ spin chain which realizes a quantum spin transistor. In our scheme, the absence or presence of a control spin excitation in the central gate part of the…
Interconnecting well-functioning, scalable stationary qubits and photonic qubits could substantially advance quantum communication applications and serve to link future quantum processors. Here, we present two protocols for transferring the…
We present a method for accelerating adiabatic protocols for systems involving a coupling to a continuum, one that cancels both non-adiabatic errors as well as errors due to dissipation. We focus on applications to a generic quantum state…
One of the strengths of quantum information theory is that it can treat quantum states without referring to their particular physical representation. In principle, quantum states can be therefore fully swapped between various quantum…
Recently, synthetic spin-orbit coupling has been introduced into cold-atom systems for more flexible control of the Hamiltonian, which was further made time-varying through two-photon detuning to achieve dynamic control of the cold-atom…
We provide an extensive discussion on a scheme for Hamiltonian tomography of a spin-chain model that does not require state initialization [Phys. Rev. Lett. 102, 187203 (2009)]. The method has spurred the attention of the physics community…
Perfect (quantum) state transfer has been proved to be an effective model for quantum information processing. In this paper, we give a characterization of cubelike graphs having perfect edge state transfer. By using a lifting technique, we…
The transfer of a quantum state between distant nodes in two-dimensional networks, is considered. The fidelity of state transfer is calculated as a function of the number of interactions in networks that are described by regular graphs. It…
We analyze a recent protocol for the transmission of quantum states via a dual spin chain [Burgarth and Bose, Phys. Rev. A 71, 052315 (2005)] under the constraint that the receiver's measurement strength is finite. That is, we consider the…
In this article, we consider a spin-spin interaction network governed by $XX + YY$ Hamiltonian. The vertices and edges of the network represent the spin objects and their interactions, respectively. We take a privilege to switch on or off…
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…