Stabilized Distance Measures and Quantum Error Correction
Quantum information theory is a quickly-growing area of research that presents no shortage of mathematical challenges. In this thesis, two basic analytic and algebraic problems of interest in quantum information are considered. The first problem considered is that of computing a crucial distance measure for linear maps on finite-dimensional Hilbert space, given by the the diamond and completely bounded norms of differences of quantum operations. Based on the theory of completely bounded maps, an algorithm to compute the diamond and completely bounded norms of arbitrary linear maps is formulated and presented. The algorithm is applied to derive a new proof and formula for the distance between arbitrary unitary maps. Finally, an implementation of the algorithm via MATLAB is presented, and its efficiency is discussed. Attention is next turned to quantum error correction, where a new algebraic characterization of error-correcting codes is derived. These results are used to explicitly compute a correction operation, and a new characterization of correctable subsystems in terms of representation theory is obtained.
- Nathaniel Johnston
- Local copy of thesis – PDF, zip file containing TeX source and figures
- Official thesis from Theses Canada (PDF only)
- Defence presentation slideshow – PDF, zip file containing TeX source and figures
- N. Johnston. Stabilized Distance Measures and Quantum Error Correction. Master’s thesis, University of Guelph, 2008.
- Computing Stabilized Norms for Quantum Operations – the algorithm for bounding the completely bounded and diamond norms was originally presented here
- The Multiplicative Domain in Quantum Error Correction – most of the error correction results were originally proved here