Bill Rosgen
Former Research Fellow

Status: Alumnus (data might not be up-to-date)


  • B. Rosgen, Lorna Stewart. The overlap number of a graph.


  • Andre Chailloux, I. Kerenidis, B. Rosgen. (2011). Quantum Commitments from Complexity Assumptions. Proceedings of ICALP 73-85
  • B. Rosgen. (2010). Testing non-isometry is QMA-complete. Proceedings of TQC
  • B. Rosgen. (2010). Computational distinguishability of degradable and antidegradable channels. Quantum Information and Computation 10 735-746
  • B. Rosgen. (2008). Distinguishing Short Quantum Computations. Proceedings of STACS 597-608
  • B. Rosgen. (2008). Additivity and Distinguishability of Random Unitary Channels. J. Math. Phys. 49 102107
  • B. Rosgen, L. Stewart. (2007). Complexity results on graphs with few cliques. Discrete Mathematics & Theoretical Computer Science 9 127-136
  • B. Rosgen, J. Watrous. (2005). On the hardness of distinguishing mixed-state quantum computations. Proc. IEEE CCC 344-354