Quantum stabilizer codes and beyond

The importance of quantum error correction in paving the way to build a practical quantum computer is no longer in doubt. This dissertation makes a threefold contribution to the mathematical theory of quantum error-correcting codes. Firstly, it extends the framework of an important class of quantum codes -- nonbinary stabilizer codes. It clarifies the connections of stabilizer codes to classical codes over quadratic extension fields, provides many new constructions of quantum codes, and develops further the theory of optimal quantum codes and punctured quantum codes. Secondly, it contributes to the theory of operator quantum error correcting codes also called as subsystem codes. These codes are expected to have efficient error recovery schemes than stabilizer codes. This dissertation develops a framework for study and analysis of subsystem codes using character theoretic methods. In particular, this work establishes a close link between subsystem codes and classical codes showing that the subsystem codes can be constructed from arbitrary classical codes. Thirdly, it seeks to exploit the knowledge of noise to design efficient quantum codes and considers more realistic channels than the commonly studied depolarizing channel. It gives systematic constructions of asymmetric quantum stabilizer codes that exploit the asymmetry of errors in certain quantum channels.Comment: Ph.D. Dissertation, Texas A&M University, 200

Asymmetric Quantum Codes: New Codes from Old

In this paper we extend to asymmetric quantum error-correcting codes (AQECC) the construction methods, namely: puncturing, extending, expanding, direct sum and the (u|u + v) construction. By applying these methods, several families of asymmetric quantum codes can be constructed. Consequently, as an example of application of quantum code expansion developed here, new families of asymmetric quantum codes derived from generalized Reed-Muller (GRM) codes, quadratic residue (QR), Bose-Chaudhuri-Hocquenghem (BCH), character codes and affine-invariant codes are constructed.Comment: Accepted for publication Quantum Information Processin

Holographic Cone of Average Entropies

The holographic entropy cone identifies entanglement entropies of field theory regions, which are consistent with representing semiclassical spacetimes under gauge/gravity duality; it is currently known up to 5 regions. We point out that average entropies of p-partite subsystems can be similarly analyzed for arbitrarily many regions. We conjecture that the holographic cone of average entropies is simplicial and specify all its bounding inequalities. Its extreme rays combine features of bipartite and perfect tensor entanglement, and correspond to stages of unitary evaporation of old black holes.Comment: v2: updated and improved explanations and interpretations of results; 5+5 pages, 8 figure

Universal Leakage Elimination

``Leakage'' errors are particularly serious errors which couple states within a code subspace to states outside of that subspace thus destroying the error protection benefit afforded by an encoded state. We generalize an earlier method for producing leakage elimination decoupling operations and examine the effects of the leakage eliminating operations on decoherence-free or noiseless subsystems which encode one logical, or protected qubit into three or four qubits. We find that by eliminating the large class of leakage errors, under some circumstances, we can create the conditions for a decoherence free evolution. In other cases we identify a combination decoherence-free and quantum error correcting code which could eliminate errors in solid-state qubits with anisotropic exchange interaction Hamiltonians and enable universal quantum computing with only these interactions.Comment: 14 pages, no figures, new version has references updated/fixe