19 citations · 30 across the 8 of their papers we have counts for
6 papers · 1 filter
Testing quantum circuits and detecting insecure encryption
Bill Rosgen
We show that computational problem of testing the behaviour of quantum circuits is hard for the class of problems known as QMA that can be verified efficiently with a quantum compu…
Quantum Commitments from Complexity Assumptions
André Chailloux, Iordanis Kerenidis, Bill Rosgen
Bit commitment schemes are at the basis of modern cryptography. Since information-theoretic security is impossible both in the classical and the quantum regime, we need to look at…
Computational distinguishability of degradable and antidegradable channels
Bill Rosgen
A channel is degradable if there exists a second channel that maps the output state of the channel to the environment state. These channels satisfy the property that the output sta…
Testing non-isometry is QMA-complete
Bill Rosgen
Determining the worst-case uncertainty added by a quantum circuit is shown to be computationally intractable. This is the problem of detecting when a quantum channel implemented as…
Additivity and Distinguishability of Random Unitary Channels
Bill Rosgen
A random unitary channel is one that is given by a convex combination of unitary channels. It is shown that the conjectures on the additivity of the minimum output entropy and the…
Distinguishing Short Quantum Computations
Bill Rosgen
Distinguishing logarithmic depth quantum circuits on mixed states is shown to be complete for QIP, the class of problems having quantum interactive proof systems. Circuits in this…