相关论文: On the communication complexity of establishing a …

We investigate quantum repeater protocols based upon atomic qubit-entanglement distribution through optical coherent-state communication. Various measurement schemes for an optical mode entangled with two spatially separated atomic qubits…

Shape formation is a basic distributed problem for systems of computational mobile entities. Intensively studied for systems of autonomous mobile robots, it has recently been investigated in the realm of programmable matter. Namely, it has…

We show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to…

We propose a scheme for using an unmodulated and unmeasured spin-chain as a channel for short distance quantum communications. The state to be transmitted is placed on one spin of the chain and received later on a distant spin with some…

We prove a trade-off relation between the entanglement cost and classical communication complexity of causal order structure of a protocol in distributed quantum information processing. We consider an implementation of a class of two-qubit…

Transmitting unknown quantum states to distant locations is crucial for distributed quantum information protocols. The seminal quantum teleportation scheme achieves this feat while requiring prior maximal entanglement between the sender and…

We investigate the transfer of genuine multipartite entanglement across a spin-1/2 chain with nearest-neighbor XX-type interaction. We focus on the perturbative regime, where a block of spins is weakly coupled at each edge of a quantum…

We show how to efficiently send an M-partite entangled state along a spin chain of arbitrary size. Specifically, we show how an entangled M-partite W sate can be almost flawlessly transmitted from one end (Alice) to the other end (Bob) of a…

We consider quantum communication in the case that the communicating parties not only do not share a reference frame but use imperfect quantum communication channels, in that each channel applies some fixed but unknown unitary rotation to…

We investigate localization of noninteracting particles with spins higher than 1/2 in a two-dimensional random potential in presence of spin-orbit coupling. We consider an integer spin ($s=1$) and a half-integer spin ($s=3/2$) belonging to…

Quantum repeater is one of the important building blocks for long distance quantum communication network. The previous quantum repeaters based on atomic ensembles and linear optical elements can only be performed with a maximal success…

We give lower bounds on the communication complexity required to solve several computational problems in a distributed-memory parallel machine, namely standard matrix multiplication, stencil computations, comparison sorting, and the Fast…

Quantum experiments usually assume the existence of perfect, classical, reference frames, which allow for the specification of measurement settings (e.g. orientation of the Stern Gerlach magnet in spin measurements) with arbitrary…

We consider the problem of localizing relevant subsets of non-rigid geometric shapes given only a partial 3D query as the input. Such problems arise in several challenging tasks in 3D vision and graphics, including partial shape similarity,…

We study the scalability of consensus-based distributed optimization algorithms by considering two questions: How many processors should we use for a given problem, and how often should they communicate when communication is not free?…

We solve the problem of the optimal cloning of pure entangled two-qubit states with a fixed degree of entanglement using local operations and classical communication. We show, that amazingly, classical communication between the parties can…

We show that a quantum clock cannot be teleported without prior synchronization between sender and receiver: every protocol using a finite amount of entanglement and an arbitrary number of rounds of classical communication will necessarily…

This thesis examines some of the more fundamental requirements of a successful quantum computation, namely the ability to transmit quantum information with maximum efficiency, and the creation of entanglement. I focus specifically on…

Analyzing the properties of entanglement in many-particle spin-1/2 systems is generally difficult because the system's Hilbert space grows exponentially with the number of constituent particles, $N$. Fortunately, it is still possible to…

We calculate the fidelity of transmission of a single qubit between distant sites on semi-infinite and finite chains of spins coupled via the magnetic dipole interaction. We show that such systems often perform better than their Heisenberg…