Separable Operations, Graph Codes and the Location of Quantum Information
arXiv:1006.4888
Abstract
In the first part of this Dissertation, I study the differences between LOCC (local operations and classical communication) and the more general class of separable operations. I show that the two classes coincide for the case of pure bipartite state input, and derive a set of important consequences. Using similar techniques I also generalize the no-cloning theorem when restricted to separable operations and show that cloning becomes much more restrictive, by providing necessary (and sometimes sufficient) conditions. In the second part I investigate graph states and graph codes with carrier qudits of arbitrary dimensionality, and extend the notion of stabilizer to any dimension, not necessarily prime. I further study how and where information is located in the various subsets of the qudit carriers of arbitrary additive graph codes, and provide efficient techniques that can be used in deciding what types of information a subset contains.
106 pages, LaTeX. Carnegie Mellon University PhD Thesis, Quantum Information Theory
References in corpus (13)
- Codeword Stabilized Quantum Codes
- The structure of preserved information in quantum processes
- Local distinguishability with preservation of entanglement
- Graphs, Quadratic Forms, and Quantum Codes
- Graphical Nonbinary Quantum Error-Correcting Codes
- Quantum Error Correction of Observables
- Nonadditive quantum error-correcting code
- A simple family of nonadditive quantum codes
- Separable Operations on Pure States
- Graphical Quantum Error-Correcting Codes
- Types of quantum information
- Entanglement transformations using separable operations
- Construction of Equientangled Bases in Arbitrary Dimensions via Quadratic Gauss Sums and Graph States