Bill Rosgen

According to our database, Bill Rosgen authored at least 10 papers between 2004 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Quantum commitments from complexity assumptions.

André Chailloux, Iordanis Kerenidis, Bill Rosgen

Comput. Complex., 2016

2012

Testing Quantum Circuits and Detecting Insecure Encryption.

Bill Rosgen

Proceedings of the Theory of Quantum Computation, 2012

2010

Computational distinguishability of degradable and antidegradable channels.

Bill Rosgen

Quantum Inf. Comput., 2010

The overlap number of a graph

Bill Rosgen, Lorna Stewart

CoRR, 2010

Testing Non-isometry Is QMA-Complete.

Bill Rosgen

Proceedings of the Theory of Quantum Computation, Communication, and Cryptography, 2010

2009

Computational Distinguishability of Quantum Channels

Bill Rosgen

CoRR, 2009

2008

Distinguishing Short Quantum Computations.

Bill Rosgen

Proceedings of the STACS 2008, 2008

2007

Complexity Results on Graphs with Few Cliques.

Bill Rosgen, Lorna Stewart

Discret. Math. Theor. Comput. Sci., 2007

2005

On the Hardness of Distinguishing Mixed-State Quantum Computations.

Bill Rosgen

Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004

On the hardness of distinguishing mixed-state quantum computations

Bill Rosgen, John Watrous

CoRR, 2004