Related papers: Dualities and Identities for Entanglement-Assisted…
Though the entanglement-assisted formalism provides a universal connection between a classical linear code and an entanglement-assisted quantum error-correcting code (EAQECC), the issue of maintaining large amount of pure maximally…
This paper develops a general method for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit constructions are given for entanglement-assisted quantum…
We show how extra entanglement shared between sender and receiver reduces the memory requirements for a general entanglement-assisted quantum convolutional code. We construct quantum convolutional codes with good error-correcting properties…
Entanglement-assisted quantum error correcting codes (EAQECCs) play a significant role in protecting quantum information from decoherence and quantum noise. Recently, constructing entanglement-assisted quantum maximum distance separable…
A new type of link between geometry of symplectic group and entanglement-assisted (EA) quantum error-correcting codes (EAQECCs) is presented. Relations of symplectic subspaces and quaternary additive codes concerning parameters of EAQECCs…
We show how entanglement-assisted codes can be constructed from arbitrary quantum codes by associating them with quantum codes for erasure channels. If a subset of physical qubits is correctable for an erasure error, then it naturally forms…
Entanglement shared between the two ends of a quantum communication channel has been shown to be a useful resource in increasing both the quantum and classical capacities for these channels. The entanglement-assisted capacities were derived…
Brun, Devetak, and Hsieh [Science 314, 436 (2006)] demonstrated that pre-shared entanglement between sender and receiver enables quantum communication protocols that have better parameters than schemes without the assistance of…
We show that entirely quantum Shannon theoretic methods, based on von Neumann entropies and their properties, can be used to derive Singleton bounds on the performance of entanglement-assisted hybrid classical-quantum (EACQ) error…
Quantum teleportation is a foundational protocol for sending quantum information through entanglement distribution and classical communication. Assuming ideal classical communication, the reliability of quantum teleportation is limited by…
Entanglement-assisted quantum error correcting codes (EAQECCs) can be derived from arbitrary classical linear codes. However, it is a very difficult task to determine the number of entangled states required. In this work, using the method…
There is an advantage in simultaneously transmitting both classical and quantum information over a quantum channel compared to sending independent transmissions. The successful implementation of simultaneous transmissions of quantum and…
Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or…
The task of preserving entanglement against noises is of crucial importance for both quantum communication and quantum information transfer. To this aim, quantum error correction (QEC) codes may be employed to compensate, at least…
We show that a relatively simple reasoning using von Neumann entropy inequalities yields a robust proof of the quantum Singleton bound for quantum error-correcting codes (QECC). For entanglement-assisted quantum error-correcting codes…
The entanglement-assisted stabilizer formalism provides a useful framework for constructing quantum error-correcting codes (QECC), which can transform arbitrary classical linear codes into entanglement-assisted quantum error correcting…
We construct a theory of continuous-variable entanglement-assisted quantum error correction. We present an example of a continuous-variable entanglement-assisted code that corrects for an arbitrary single-mode error. We also show how to…
We consider entanglement-assisted (EA) private communication over a quantum broadcast channel, in which there is a single sender and multiple receivers. We divide the receivers into two sets: the decoding set and the malicious set. The…
Recently, Galindo et al. introduced the concept of asymmetric entanglement-assisted quantum error-correcting codes (AEAQECCs) from Calderbank-Shor-Steane (CSS) construction. In general, it's difficult to determine the required number of…
We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is the dual of the binary erasure channel (BEC) coding problem. We…