Related papers: Efficient Quantum Polar Codes Requiring No Preshar…
Polar codes are a new class of capacity-achieving error-correcting codes with low encoding and decoding complexity. Their low-complexity decoding algorithms rendering them attractive for use in software-defined radio applications where…
We develop novel protocols for generating loss-tolerant quantum codes; these are central for safeguarding information against qubit losses, with most crucial applications in quantum communications. Contrary to current proposals, our method…
We study faulty successive cancellation decoding of polar codes for the binary erasure channel. To this end, we introduce a simple erasure-based fault model and we show that, under this model, polarization does not happen, meaning that…
Polar codes are a class of linear block codes that provably achieves channel capacity. They have been selected as a coding scheme for the control channel of enhanced mobile broadband (eMBB) scenario for $5^{\text{th}}$ generation wireless…
Over any discrete memoryless channel, we build codes such that: for one, their block error probabilities and code rates scale like random codes'; and for two, their encoding and decoding complexities scale like polar codes'. Quantitatively,…
We propose a high-efficiency three-party quantum key agreement protocol, by utilizing two-photon polarization-entangled Bell states and a few single-photon polarization states as the information carriers, and we use the quantum dense coding…
We present an experimental demonstration of a quantum key distribution protocol using coherent polarization states. Post selection is used to ensure a low error rate and security against beam splitting attacks even in the presence of high…
This paper presents a new encryption scheme called Compact Coding that encodes information in time, phase, and intensity domains, simultaneously. While these approaches have previously been used one at a time, the proposed scheme brings to…
Coherent information quantifies the transmittable quantum information through a channel and is directly linked to the channel's quantum capacity. In a monitored quantum circuit, regarded as a quantum channel, extensive and positive coherent…
We study the use of entanglement purification for quantum communication over long distances. For distances much longer than the coherence length of a corresponding noisy quantum channel, the fidelity of transmission is usually so low that…
Quantum key distribution protocols based on equiangular spherical codes are introduced and their behavior under the intercept/resend attack investigated. Such protocols offer a greater range of secure noise tolerance and speed options than…
We present a scheme for secure deterministic quantum communication without using entanglement, in a Plug-and-Play fashion. The protocol is completely deterministic, both in the encoding procedure and in the control one, thus doubling the…
Quantum computers require error correction to achieve universal quantum computing. However, current decoding of quantum error-correcting codes relies on classical computation, which is slower than quantum operations in superconducting…
By carrying out measurements on entangled states, two parties can generate a secret key which is secure not only against an eavesdropper bound by the laws of quantum mechanics, but also against a hypothetical "post-quantum" eavesdroppers…
Recent years have seen rapid development in the subject of quantum coding theory, with breakthroughs on many exciting classes of codes, including quantum LDPC codes, quantum locally testable codes, and quantum codes with interesting…
Usual scenarios of fault-tolerant computation are concerned with the fault-tolerant realization of quantum algorithms that compute classical functions, such as Shor's algorithm for factoring. In particular, this means that input and output…
We propose efficient-phase-encoding protocols for continuous-variable quantum key distribution using coherent states and postselection. By these phase encodings, the probability of basis mismatch is reduced and total efficiency is…
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…
After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In…
The faithful distribution of entanglement over noisy channels is a vital prerequisite for many quantum technological applications. Quantum information can be encoded in different degrees of freedom (DOF) of photons, where each encoding…