Related papers: Equidistant Polarizing Transforms
Parity measurement is a key step in many entanglement generation and quantum error correction schemes. We propose a protocol for non-destructive parity measurement of two remote qubits, i.e., macroscopically separated qubits with no direct…
The common approach of designing a communication device is to maximize a well-defined objective function, e.g., the channel capacity and the cut-off rate. We propose easy-to-implement solutions for Gaussian channels that approximate the…
The goal of the paper is to study specific properties of nonbinary low-density parity-check (NB LDPC) codes when used in coded modulation systems. The paper is focused on the practically important NB LDPC codes over extensions of the Galois…
Achieving information-theoretic security using explicit coding scheme in which unlimited computational power for eavesdropper is assumed, is one of the main topics is security consideration. It is shown that polar codes are capacity…
A new method is presented for modeling the transformation between two polarimetric pulse profiles in the Fourier domain. In practice, one is a well-determined standard with high signal-to-noise ratio and the other is an observation that is…
In this paper, we propose a new form of polarization reconfigurable antennas (PRAs) that can form linear, circular, and general elliptical polarizations assisted by phase shifters (PSs). With PRAs, polarforming is achieved, which enables…
We attract attention to the fact that the ultimate (shot-noise-limited) polarimetric sensitivity can be enhanced by orders of magnitude leaving the photon flux incident onto the photodetector on the same low level. This opportunity is of…
By limiting the resolution of quantum measurements, the measurement induced changes of the quantum state can be reduced, permitting subsequent measurements of variables that do not commute with the initially measured property. It is then…
Fast quantum data transmission faces several shortcomings such as the indistinguishability of some partly overlapping signals, the channel noises, and so on. Based on the encoded quantum data transmission protocol, an unconventional scheme…
This paper presents a new derivation method of converse bounds on the non-asymptotic achievable rate of discrete weakly symmetric memoryless channels. It is based on the finite blocklength statistics of the channel, where with the use of an…
We prove a one-shot "minimax" converse bound for quantum channel coding assisted by positive partial transpose channels between sender and receiver. The bound is similar in spirit to the converse by Polyanskiy, Poor, and Verdu [IEEE Trans.…
We present a rate-compatible polar coding scheme that achieves the capacity of any family of channels. Our solution generalizes the previous results [1], [2] that provide capacity-achieving rate-compatible polar codes for a degraded family…
We study relationships between worst-case and random-noise properties of error correcting codes. More concretely, we consider connections between minimum distance, list decoding radius, and block error probability on noisy channels. A…
Polarization maintenance is a key technology for free-space quantum communication. In this paper, we describe a polarization maintenance design of a transmitting antenna with an average polarization extinction ratio of 887 : 1 by a local…
We experimentally realize a nonlinear quantum protocol on single-photon qubits with linear optical elements and appropriate measurements. The quantum nonlinearity is induced by post-selecting the polarization qubit based on a measurement…
This work presents an analysis of the electronic and optical properties of InAs/GaAs columnar quantum dots (QDs) by performing multi-million-atom tight-binding simulations. The plots of the polarisation-dependent ground state optical…
We present an extension of known semidefinite and linear programming upper bounds for spherical codes. We apply the main result for the distance distribution of a spherical code and show that this method can work effectively In particular,…
This paper studies the performance of block coding on an additive white Gaussian noise channel under different power limitations at the transmitter. Lower bounds are presented for the minimum error probability of codes satisfying maximal…
We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the best known bounds for unbounded metric TSP problems. In…
A quantum internet connects remote quantum processors that need interact and exchange quantum signals over a long distance through photonic channels. However, these quantum nodes are usually composed of quantum systems with emitted photons…