Related papers: Deterministic distributed dense coding with stabil…
The need of discriminating between different quantum states is a fundamental issue in Quantum Information and Communication. The actual realization of generally optimal strategies in this task is often limited by the need of supplemental…
This paper considers the problem of distributed source coding for a large network. A major obstacle that poses an existential threat to practical deployment of conventional approaches to distributed coding is the exponential growth of the…
The quantum advantage of dense coding is studied, considering general encoding quantum operations. Particular attention is devoted to the case of many senders, and it is shown that restrictions on the possible operations on the senders'…
We consider a protocol for sharing quantum states using continuous variable systems. Specifically we introduce an encoding procedure where bosonic modes in arbitrary secret states are mixed with several ancillary squeezed modes through a…
A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the systems recovers from this catastrophic situation without external intervention in finite time.…
We study the following semi-deterministic setting of the joint source-channel coding problem: a deterministic source sequence (a.k.a. individual sequence) is transmitted via a memoryless channel, using delay-limited encoder and decoder,…
Shared entanglement between spatially separated systems is an essential resource for quantum information processing including long-distance quantum cryptography and teleportation. While purification protocols for mixed distributed entangled…
The usefulness of the recent experimentally realized six photon cluster state by C. Y. Lu et al. (2007, Nature {3} {91}), is investigated for quantum communication protocols like teleportation, quantum information splitting (QIS), remote…
We propose a systematic scheme for the construction of graphs associated with binary stabilizer codes. The scheme is characterized by three main steps: first, the stabilizer code is realized as a codeword-stabilized (CWS) quantum code;…
We propose two deterministic secure quantum communication (DSQC) protocols employing three-qubit GHZ-like states and five-qubit Brown states as quantum channels for secure transmission of information in units of two bits and three bits…
We present a method for implementing stabilizer-based codes with encoding schemes of the operator quantum error correction paradigm, e.g., the "standard" five-qubit and CSS codes, on solid-state qubits with Ising or XY-type interactions.…
This paper focuses on a networked state estimation problem for a spatially large linear system with a distributed array of sensors, each of which offers partial state measurements, and the transmission is lossy. We propose a measurement…
We show that a simple experimental setting of a locally pumped and lossy array of two-level quantum systems can stabilize states with strong long-range coherence. Indeed, by explicit analytic construction, we show there is an extensive set…
In a single hop broadcast packet erasure network, we demonstrate that it is possible to provide multirate packet delivery outside of what is given by the network min-cut. This is achieved by using a deterministic non-block-based network…
Fault-tolerant cluster states form the basis for scalable measurement-based quantum computation. Recently, new stabilizer codes for scalable circuit-based quantum computation have been introduced that have very high thresholds under biased…
How entangled is a randomly chosen bipartite stabilizer state? We show that if the number of qubits each party holds is large the state will be close to maximally entangled with probability exponentially close to one. We provide a similar…
The ability to reliably distribute entanglement among the nodes of a network is an essential requirement for the development of effective quantum communication protocols and the realization of useful quantum networks. It has been…
This paper studies the stability of communication protocols that deal with transmission errors. We consider a coordination game between an informed sender and an uninformed decision maker, the receiver, who communicate over a noisy channel.…
We classify, up to local unitary equivalence, the set of $n$-qubit states that is stabilized by the diagonal subgroup of the local unitary group. We exhibit a basis for this set, parameterized by diagrams of nonintersecting chords…
We propose a theoretical scheme for secure quantum key distribution network following the ideas in quantum dense coding. In this scheme, the server of the network provides the service for preparing and measuring the Bell states, and the…