Related papers: Quantum communication scheme to teleport arbitrary…
Discrete quantum walks are dynamical protocols for controlling a single quantum particle. Despite of its simplicity, quantum walks display rich topological phenomena and provide one of the simplest systems to study and understand…
We study a transport phenomenon in certain coined quantum walks where a subspace of states localized at a vertex gets transferred to another vertex. We first develop characterizations for perfect and pretty good subspace state transfer…
Most protocols for Quantum Information Processing consist of a series of quantum gates, which are applied sequentially. In contrast, interactions, for example between matter and fields, as well as measurements such as homodyne detection of…
We propose an implementation of a quantum walk on a circle on an optomechanical system by encoding the walker on the phase space of a radiation field and the coin on a two-level state of a mechanical resonator. The dynamics of the system is…
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 study a 2-D disordered time-discrete quantum walk based on 1-D `generalized elephant quantum walk' where an entangling coin operator is assumed and which paves the way to a new set of properties. We show that considering a given disorder…
It is demonstrated that in gate-based quantum computing architectures quantum walk is a natural mathematical description of quantum gates. It originates from field-matter interaction driving the system, but is not attached to specific qubit…
We present a generalized definition of discrete-time quantum walks convenient for capturing a rather broad spectrum of walker's behavior on arbitrary graphs. It includes and covers both: the geometry of possible walker's positions with…
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…
Quantum teleportation plays a key role in modern quantum technologies. Thus, it is of much interest to generate alternative approaches or representations aimed at allowing us a better understanding of the physics involved in the process…
We study quantum walk on a ladder with combination of conventional and split-step protocols. The two components of the walk resulting from periodic boundary conditions can be made to have three kinds of probability distributions. Two of…
We study the teleportation scheme performed by means of a partially entangled pure state. We found that the information belonging to the quantum channel can be distributed into both the system of the transmitter and the system of the…
We propose a simple scheme for the quantum teleportation of both bipartite and multipartite entangled coherent states with the successful probability 1/2. The scheme is based on only linear optical devices such as beam splitters and phase…
We extend the scheme of quantum teleportation by quantum walks introduced by Wang et al. (2017). First, we introduce the mathematical definition of the accomplishment of quantum teleportation by this extended scheme. Secondly, we show a…
The presented work provides a procedure for optimizing the communication cost of a distributed quantum circuit (DQC) in terms of the number of qubit teleportations. Because of technology limitations which do not allow large quantum…
Quantum random walks have received much interest due to their non-intuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable…
Quantum walks have emerged as an interesting alternative to the usual circuit model for quantum computing. While still universal for quantum computing, the quantum walk model has very different physical requirements, which lends itself more…
A quantum walk places a traverser into a superposition of both graph location and traversal "spin." The walk is defined by an initial condition, an evolution determined by a unitary coin/shift-operator, and a measurement based on the…
High-fidelity quantum state transfer is critical for quantum communication and scalable quantum computation. Current quantum state transfer algorithms on the complete bipartite graph, which are based on discrete-time quantum walk search…
We describe two protocols for efficient data transmission using a single passive bus. Different types of interactions are obtained enabling deterministic transfer and teleportation of composite quantum systems for arbitrary subsystem…