Separable Operations, Graph Codes and the Location of Quantum Information

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

106 pages, LaTeX. Carnegie Mellon University PhD Thesis, Quantum Information Theory

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Separable Operations, Graph Codes and the Location of Quantum Information does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Separable Operations, Graph Codes and the Location of Quantum Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Separable Operations, Graph Codes and the Location of Quantum Information will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-309503

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.