Publications
- Bill Rosgen. Computational distinguishability of degradable and antidegradable channels. Quantum Information and Computation, to appear, 2010.
- Bill Rosgen. Testing non-isometry is QMA-complete. to appear, TQC 2010.
- Bill Rosgen. Computational Distinguishability of Quantum Channels. Ph.D. Thesis, University of Waterloo, 2009.
- Bill Rosgen. Additivity and Distinguishability of Random Unitary Channels. Journal of Mathematical Physics, 49, 102107, 2008.
- Bill Rosgen. Distinguishing Short Quantum Computations. Proceedings of the 25th STACS, pages 597-608, 2008.
- Bill Rosgen and Lorna Stewart. Complexity results on graphs with few cliques. Discrete Mathematics & Theoretical Computer Science, 9(1), pages 127-136, 2007.
- Bill Rosgen. Set Representations of Graphs. M.Sc. Thesis, University of Alberta, 2005.
- Bill Rosgen and John Watrous. On the hardness of distinguishing mixed-state quantum computations. Proceedings of the 20th Conference on Computational Complexity, pages 344-354, 2005. A preliminary version appeared arXiv.org e-Print cs.CC/0407056.