Related papers: Realization of a collective decoding of codeword s…
Much progress has been made on decoding algorithms for error-correcting codes in the last decade. In this article, we give an introduction to some fundamental results on iterative, message-passing algorithms for low-density parity check…
In the literature there exists analytical expressions for the probability of a receiver decoding a transmitted source message that has been encoded using random linear network coding. In this work, we look into the probability that the…
We present a review of the problem of finding out whether a quantum state of two or more parties is entangled or separable. After a formal definition of entangled states, we present a few criteria for identifying entangled states and…
A quantum codeword is a redundant representation of a logical qubit by means of several physical qubits. It is constructed in such a way that if one of the physical qubits is perturbed, for example if it gets entangled with an unknown…
Though the theory of quantum error correction is intimately related to the classical coding theory, in particular, one can construct quantum error correction codes (QECCs) from classical codes with the dual containing property, this does…
General semiclassical expression for quantum fidelity (Loschmidt echo) of arbitrary pure and mixed states is derived. It expresses fidelity as an interference sum of dephasing trajectories weighed by the Wigner function of the initial…
Polar codes provably achieve the symmetric capacity of a memoryless channel while having an explicit construction. This work aims to increase the throughput of polar decoder hardware by an order of magnitude relative to the state of the art…
An overview is given of different approaches to describing the process of deconfinement in quantum chromodynamics. The analysis of the known approaches demonstrates that the detailed picture of how deconfinement really occurs has not yet…
In tasks, where multipartite entanglement plays a central role, state purification is, due to inevitable noise, a crucial part of the procedure. We consider a scenario exploiting the multipartite entanglement in a straightforward…
This paper proposes a definition of what it means for one system description language to encode another one, thereby enabling an ordering of system description languages with respect to expressive power. I compare the proposed definition…
A general procedure for constructing coherent states, which are eigenstates of annihilation operators, related to quantum mechanical potential problems, is presented. These coherent states, by construction are not potential specific and…
We prove the existence of entire functions that achieve universal approximations on certain countable sequences of translation operators .
We have presented a theoretical extended version of dense coding protocol using entangled position state of two particles shared between two parties. A representation of Bell states and the required unitary operators are shown utilizing…
We present here an overview of our work concerning entanglement properties of composite quantum systems. The characterization of entanglement, i.e. the possibility to assert if a given quantum state is entangled with others and how much…
Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed…
The sending station being the classical device can be eavesdropped by classical means. Dense coding and quantum nature of wave function give the additional resource to raise the safety of the quantum channel as a whole.
We present an improved protocol for entanglement purification of bipartite mixed states using several states at a time rather than two at a time as in the traditional recurrence method. We also present a generalization of the hashing method…
We consider the problem of optimal asymptotically faithful compression for ensembles of mixed quantum states. Although the optimal rate is unknown, we prove upper and lower bounds and describe a series of illustrative examples of…
We introduce a general method for the construction of quasiprobability representations for arbitrary notions of quantum coherence. Our technique yields a nonnegative probability distribution for the decomposition of any classical state.…
We initiate a study of locally decodable codes with randomized encoding. Standard locally decodable codes are error correcting codes with a deterministic encoding function and a randomized decoding function, such that any desired message…