Publications
- Bill Rosgen Testing quantum circuits and detecting insecure encryption. Manuscript, 2011. arXiv:1108.1052 [quant-ph]
- André Chailloux, Iordanis Kerenidis, and Bill Rosgen. Quantum Commitments from Complexity Assumptions. Proceedings of the 37th ICALP, part 1, pages 73-85, 2011. arXiv:1010.2793 [quant-ph]
- Bill Rosgen and Lorna Stewart. The overlap number of a graph. Manuscript, 2010. arXiv:1008.2170 [cs.DM]
- Bill Rosgen. Testing non-isometry is QMA-complete. Proceedings of TQC 2010, pages 63-76, 2011. arXiv:0910.3740 [quant-ph]
- Bill Rosgen. Computational distinguishability of degradable and antidegradable channels. Quantum Information & Computation, 10(9&10), pages 735-746, 2010. arXiv:0911.2109 [quant-ph]
- Bill Rosgen. Computational Distinguishability of Quantum Channels. Ph.D. Thesis, University of Waterloo, 2009. arXiv:0909.3930 [quant-ph]
- Bill Rosgen. Additivity and Distinguishability of Random Unitary Channels. Journal of Mathematical Physics, 49, 102107, 2008. arXiv:0804.1936 [quant-ph]
- Bill Rosgen. Distinguishing Short Quantum Computations. Proceedings of the 25th STACS, pages 597-608, 2008. arXiv:0712.2595 [quant-ph]
- 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. arXiv:cs/0407056 [cs.CC]