Homological stabilizer codes

In this paper we define homological stabilizer codes on qubits which encompass codes such as Kitaev’s toric code and the topological color codes. These codes are defined solely by the graphs they reside on. This feature allows us to use properties of topological graph theory to determine the graphs which are suitable as homological stabilizer codes. We then show that all toric codes are equivalent to homological stabilizer codes on 4-valent graphs. We show that the topological color codes and toric codes correspond to two distinct classes of graphs. We define the notion of label set equivalencies and show that under a small set of constraints the only homological stabilizer codes without local logical operators are equivalent to Kitaev’s toric code or to the topological color codes.     

Structure of 2D Topological Stabilizer Codes

We provide a detailed study of the general structure of translationally invariant two-dimensional topological stabilizer quantum error correcting codes, including subsystem codes. We show that they can be understood in terms of the homology of string operators that carry a certain topological charge. In subsystem codes, two dual kinds of charges appear. We prove that two non-chiral codes are equivalent under local transformations iff they have isomorphic topological charges. Our approach emphasizes local properties over global ones.     

Quantum Secret Sharing with Error Correction

We investigate in this work a quantum error correction on a five-qubits graph state used for secret sharing through five noisy channels. We describe the procedure for the five, seven and nine qubits codes. It is known that the three codes always allow error recovery if only one among the sent qubits is disturbed in the transmitting channel. However, if two qubits and more are disturbed, then the correction will depend on the used code. We compare in this paper the three codes by computing the average fidelity between the sent secret and that measured by the receivers. We will treat the case where, at most, two qubits are affected in each one of five depolarizing channels.     

Quantum Secret Sharing with Error Correction

We investigate in this work a quantum error correction on a five-qubits graph state used for secret sharing through five noisy channels. We describe the procedure for the five, seven and nine qubits codes. It is known that the three codes always allow error recovery if only one among the sent qubits is disturbed in the transmitting channel. However, if two qubits and more are disturbed, then the correction will depend on the used code. We compare in this paper the three codes by computing the average fidelity between the sent secret and that measured by the receivers. We will treat the case where, at most, two qubits are affected in each one of five depolarizing channels.     

On the Existence of XOR-Based Codes for Private Information Retrieval with Private Side Information

We consider the problem of Private Information Retrieval with Private Side Information (PIR-PSI), wherein the privacy of the demand and the side information are jointly preserved. Although the capacity of the PIR-PSI setting is known, we observe that the underlying capacity-achieving code construction uses Maximum Distance Separable (MDS) codes therefore contributing to high computational complexity when retrieving the demand. Pointing at this drawback of MDS-based PIR-PSI codes, we propose XOR-based PIR-PSI codes for a simple yet non-trivial setting of two non-colluding databases and two side information files at the user. Although our codes offer substantial reduction in complexity when compared to MDS-based codes, the code-rate marginally falls short of the capacity of the PIR-PSI setting. Nevertheless, we show that our code-rate is strictly higher than that of XOR-based codes for PIR with no side information. As a result, our codes can be useful when privately downloading a file especially after having downloaded a few other messages privately from the same database at an earlier time-instant.     

Encrypted optical memory system using three-dimensional keys in the Fresnel domain

An encrypted optical memory system using double random phase codes in the Fresnel domain is proposed. In this system, two random phase codes and their positions form three-dimensional keys for encryption of images and are used as keys to recover the original data. The third dimension is the positions of the codes, which can have as many as three degrees of freedom. Original images encrypted by use of the two phase codes located in the Fresnel domain are stored holographically in a photorefractive material. We demonstrate in preliminary experiments encryption and decryption of optical memory in a LiNbO(3) :Fe photorefractive crystal by use of angular multiplexing.     

Non-Malleable Code in the Split-State Model

Non-malleable codes are a natural relaxation of error correction and error detection codes applicable in scenarios where error-correction or error-detection is impossible. Over the last decade, non-malleable codes have been studied for a wide variety of tampering families. Among the most well studied of these is the split-state family of tampering channels, where the codeword is split into two or more parts and each part is tampered with independently. We survey various constructions and applications of non-malleable codes in the split-state model.     

Performance characteristics and weight distribution analysis of turbo product code with Reed-Muller component codes

In this paper, we present simulation results for Reed-Muller (RM) turbo codes over AWGN and Rayleigh fading channels. We also compare the simulation results of turbo product codes and block turbo codes with RM component codes over an AWGN channel. We show that minimum distance is not important as far as the BER performance of long codes is concerned. The weight distribution of RM codes of different lengths and turbo product codes with first-order RM component codes are obtained and analyzed for their good performance. We show that the weight distribution asymptotically approaches that of random coding as the code length increases.     

Design of two-dimensional zero reference codes with a genetic algorithm

In mask-alignment systems a reference signal is needed to align the mask with the silicon wafers. The optical reference signal is the autocorrelation of two two-dimensional (2D) codes with binary transmittance. For a long time, one-dimensional codes have been used in grating-measurement systems to obtain a reference signal. The design of this type of code has needed a great computational effort, which limits the size of the code to about 100 elements. Recently, we have applied genetic algorithms to design codes with arbitrary length. We propose the application of these algorithms to design 2D codes to generate 2D optical signals used in mask-alignment systems.     

A family of codes between some Markov and Bernoulli schemes

We construct a family of almost continuous codes between a mixing one-step Markov process with two symbols and a Bernoulli scheme.     

Many polarized radiative transfer models

This note is an introduction to the reprint of the 1991 JQSRT article “A new polarized atmospheric radiative transfer model” by K.F. Evans and G.L. Stephens. We discuss the significance of the article, how our two plane-parallel polarized radiative transfer codes came about, how our codes have been used, and more recent developments in polarized radiative transfer modeling.     

A Construction of Quantum Error-Locating Codes

We present the construction of quantum error-locating(QEL) codes based on classical error-locating(EL)codes. Similar to classical EL codes, QEL codes lie midway between quantum error-correcting codes and quantum errordetecting codes. Then QEL codes can locate qubit errors within one sub-block of the received qubit symbols but do not need to determine the exact locations of the erroneous qubits. We show that, an e-error-locating code derived from an arbitrary binary cyclic code with generator polynomial g(x), can lead to a QEL code with e error-locating abilities, only if g(x) does not contain the(1 + x)-factor.     

Optimal design of optical reference signals by use of a genetic algorithm

A new technique for the generation of optical reference signals with optimal properties is presented. In grating measurement systems a reference signal is needed to achieve an absolute measurement of the position. The optical signal is the autocorrelation of two codes with binary transmittance. For a long time, the design of this type of code has required great computational effort, which limits the size of the code to approximately 30 elements. Recently, the application of the dividing rectangles (DIRECT) algorithm has allowed the automatic design of codes up to 100 elements. Because of the binary nature of the problem and the parallel processing of the genetic algorithms, these algorithms are efficient tools for obtaining codes with particular autocorrelation properties. We design optimum zero reference codes with arbitrary length by means of a genetic algorithm enhanced with a restricted search operator.     

Optical encryption by double-random phase encoding in the fractional Fourier domain

We propose an optical architecture that encodes a primary image to stationary white noise by using two statistically independent random phase codes. The encoding is done in the fractional Fourier domain. The optical distribution in any two planes of a quadratic phase system (QPS) are related by fractional Fourier transform of the appropriately scaled distribution in the two input planes. Thus a QPS offers a continuum of planes in which encoding can be done. The six parameters that characterize the QPS in addition to the random phase codes form the key to the encrypted image. The proposed method has an enhanced security value compared with earlier methods. Experimental results in support of the proposed idea are presented.     

Theory of quantum error correction for general noise

A measure of quality of an error-correcting code is the maximum number of errors that it is able to correct. We show that a suitable notion of "number of errors" e makes sense for any quantum or classical system in the presence of arbitrary interactions. Thus, e-error-correcting codes protect information without requiring the usual assumptions of independence. We prove the existence of large codes for both quantum and classical information. By viewing error-correcting codes as subsystems, we relate codes to irreducible representations of operator algebras and show that noiseless subsystems are infinite-distance error-correcting codes.     

Universal Framework for Quantum Error-Correcting Codes

We present a universal framework for quantum error-correcting codes, i.e., a framework that applies to the most general quantum error-correcting codes. This framework is based on the group algebra, an algebraic notation associated with nice error bases of quantum systems. The nicest thing about this framework is that we can characterize the properties of quantum codes by the properties of the group algebra. We show how it characterizes the properties of quantum codes as well as generates some new results about quantum codes.     

Entanglement Transmission and Generation under Channel Uncertainty: Universal Quantum Channel Coding

We determine the optimal rates of universal quantum codes for entanglement transmission and generation under channel uncertainty. In the simplest scenario the sender and receiver are provided merely with the information that the channel they use belongs to a given set of channels, so that they are forced to use quantum codes that are reliable for the whole set of channels. This is precisely the quantum analog of the compound channel coding problem. We determine the entanglement transmission and entanglement-generating capacities of compound quantum channels and show that they are equal. Moreover, we investigate two variants of that basic scenario, namely the cases of informed decoder or informed encoder, and derive corresponding capacity results.     

Design of a Hybrid Fiber-Optic Network Using 3-D Optical Code Sequences

We present the design of a 3-dimensional (3-D) noncoherent optical hybrid network. We also report the design of a new family of 3-D codes for fiber optic hybrid networks. We show that the hybrid network allows for shorter bit times and a higher number of users, given a set chip rate, compared to previously conceived networks. These newly designed hybrid single-pulse-per-row (HSPR) codes have very low autocorrelation side-lobes and very small cross-correlation peaks. We compare the performance of our hybrid model using our codes with the Optical Orthogonal Codes (OOCs) and Temporal/Spatial (T/S) codes and show that the new network can support a greater number of users and higher data rates than those using OOCs and T/S codes.     

Design of a Hybrid Fiber-Optic Network Using 3-D Optical Code Sequences

We present the design of a 3-dimensional (3-D) noncoherent optical hybrid network. We also report the design of a new family of 3-D codes for fiber optic hybrid networks. We show that the hybrid network allows for shorter bit times and a higher number of users, given a set chip rate, compared to previously conceived networks. These newly designed hybrid single-pulse-per-row (HSPR) codes have very low autocorrelation side-lobes and very small cross-correlation peaks. We compare the performance of our hybrid model using our codes with the Optical Orthogonal Codes (OOCs) and Temporal/Spatial (T/S) codes and show that the new network can support a greater number of users and higher data rates than those using OOCs and T/S codes.     

CosmologicalN-body simulations

In this review we discuss cosmologicalN-body codes with a special emphasis on particle mesh codes. We present the mathematical model for each component ofN-body codes. We compare alternative methods for computing each quantity by calculating errors for each of the components. We suggest an optimum set of components that can be combined to reduce the overall errors inN-body codes.