On the hardness of distinguishing mixed-state quantum computations - Bill Rosgen; John Watrous (CoRR, 2004)

On the Hardness of Distinguishing Mixed-State Quantum Computations. - Bill Rosgen (CCC, 2005)

Complexity Results on Graphs with Few Cliques. - Bill Rosgen; Lorna Stewart (Discret. Math. Theor. Comput. Sci., 2007)

Distinguishing Short Quantum Computations. - Bill Rosgen (STACS, 2008)

Computational Distinguishability of Quantum Channels - Bill Rosgen (CoRR, 2009)

Testing Non-isometry Is QMA-Complete. - Bill Rosgen (TQC, 2010)

The overlap number of a graph - Bill Rosgen; Lorna Stewart (CoRR, 2010)

Computational distinguishability of degradable and antidegradable channels. - Bill Rosgen (Quantum Inf. Comput., 2010)

Testing Quantum Circuits and Detecting Insecure Encryption. - Bill Rosgen (TQC, 2012)

Quantum commitments from complexity assumptions. - André Chailloux; Iordanis Kerenidis; Bill Rosgen (Comput. Complex., 2016)