Related papers: Streaming universal distortion-free entanglement c…
Quantum entanglement is an indispensable resource for many significant quantum information processing tasks. However, because of the noise in quantum channels, it is difficult to distribute quantum entanglement over a long distance in…
We study the limits of bipartite entanglement distribution using a chain of quantum repeaters that have quantum memories. To generate end-to-end entanglement, each node can attempt the generation of an entangled link with a neighbor, or…
Motivated from the fact that universal source coding on countably infinite alphabets is not feasible, this work introduces the notion of almost lossless source coding. Analog to the weak variable-length source coding problem studied by Han…
We study the robust communication complexity of maximum matching. Edges of an arbitrary $n$-vertex graph $G$ are randomly partitioned between Alice and Bob independently and uniformly. Alice has to send a single message to Bob such that Bob…
Entanglement purification allows the creation of qubit pairs of arbitrarily high fidelity with respect to a maximally entangled state, starting from a larger number of low-fidelity pairs. Purification requires quantum memory, a role for…
We examine dense coding with an arbitrary pure entangled state sharing between the sender and the receiver. Upper bounds on the average success probability in approximate dense coding and on the probability of conclusive results in…
This article will examine states that superpose different amounts of entanglement and protocols that run in superposition but generate or consume different amounts of entanglement. In both cases we find a uniquely quantum difficulty:…
We present a security proof for establishing private entanglement by means of recurrence-type entanglement distillation protocols over noisy quantum channels. We consider protocols where the local devices are imperfect, and show that…
Entanglement-based quantum networks exhibit a unique flexibility in the choice of entangled resource states that are then locally manipulated by the nodes to fulfill any request in the network. Furthermore, this manipulation is not uniquely…
We present a quantum repeater protocol using atomic ensembles, linear optics and single-photon sources. Two local 'polarization' entangled states of atomic ensembles $u$ and $d$ are generated by absorbing a single photon emitted by an…
We investigate optimal discrimination between two projective single-qubit measurements in a scenario where the measurement can be performed only once. We consider general setting involving a tunable fraction of inconclusive outcomes and we…
We analyze three quantum communication protocols that have been proposed in the literature, and compare how well they communicate single-rail entanglement. We use specific metrics for output state purity and probability of success and…
We study the maximum weight matching problem in the random-order semi-streaming model and in the robust communication model. Unlike many other sublinear models, in these two frameworks, there is a large gap between the guarantees of the…
We address the question of efficient implementation of quantum protocols, with small communication and entanglement, and short depth circuit for encoding or decoding. We introduce two new methods to achieve this, the first method involving…
We analyze various scenarios for entangling two initially unentangled qubits. In particular, we propose an optimal universal entangler which entangles a qubit in unknown state $|\Psi>$ with a qubit in a reference (known) state $|0>$. That…
Superdense Coding is a cornerstone in secure quantum communication, exploiting pre-shared entanglement to encode two classical bits within a single qubit. However, noise and decoherence deteriorate entanglement quality, restricting both…
We introduce entanglement purification protocols for d-level systems (qudits) with improved efficiency as compared to previous protocols. While we focus on protocols for bipartite systems, we also propose generalizations to multi-partite…
We present a numerical investigation comparing two entanglement generation protocols in finite XX spin chains with varying spin magnitudes ($s = 1/2, 1, 3/2 $). Protocol 1 (P1) relies on staggered couplings to steer correlations toward the…
We improve the space bound for streaming approximation of Diameter but also of Farthest Neighbor queries, Minimum Enclosing Ball and its Coreset, in high-dimensional Euclidean spaces. In particular, our deterministic streaming algorithms…
We consider the problem of monotone, submodular maximization over a ground set of size $n$ subject to cardinality constraint $k$. For this problem, we introduce the first deterministic algorithms with linear time complexity; these…