Bill Rosgen

12 papers A 2Journal 7Unranked 3
YearRankTypeTitle / Venue / Authors
2016 J jnl
Quantum commitments from complexity assumptions.
Comput. Complex.
André Chailloux, Iordanis Kerenidis, Bill Rosgen
2012 — conf
Testing Quantum Circuits and Detecting Insecure Encryption.
TQC
Bill Rosgen
2011 — conf
Quantum Commitments from Complexity Assumptions.
ICALP (1)
André Chailloux, Iordanis Kerenidis, Bill Rosgen
2010 J jnl
Computational distinguishability of degradable and antidegradable channels.
Quantum Inf. Comput.
Bill Rosgen
2010 — conf
Testing Non-isometry Is QMA-Complete.
TQC
Bill Rosgen
2010 J jnl
The overlap number of a graph
CoRR
Bill Rosgen, Lorna Stewart
2009 J jnl
Computational Distinguishability of Quantum Channels
CoRR
Bill Rosgen
2008 A conf
Distinguishing Short Quantum Computations.
STACS
Bill Rosgen
2007 J jnl
Complexity Results on Graphs with Few Cliques.
Discret. Math. Theor. Comput. Sci.
Bill Rosgen, Lorna Stewart
2007 J jnl
Distinguishing Short Quantum Computations
CoRR
Bill Rosgen
2005 A conf
On the Hardness of Distinguishing Mixed-State Quantum Computations.
CCC
Bill Rosgen
2004 J jnl
On the hardness of distinguishing mixed-state quantum computations
CoRR
Bill Rosgen, John Watrous