15 citations · 81 across the 23 of their papers we have counts for
25 papers
Parallel Repetition in the Two-Player Quantum Cloning Game
Eli Coe Naig, Stephen A. Fenner
We study parallel repetition in the two-player quantum cloning game, a monogamy-of-entanglement game motivated by quantum position verification. Colisson Palais, Escolà-Farràs, and…
Implementing the quantum fanout operation with simple pairwise interactions
Stephen Fenner, Rabins Wosti
It has been shown that, for even , evolving qubits according to a Hamiltonian that is the sum of pairwise interactions between the particles, can be used to exactly implemen…
Depth-2 QAC circuits cannot simulate quantum parity
Daniel Padé, Stephen Fenner, Daniel Grier +1
We show that the quantum parity gate on qubits cannot be cleanly simulated by a quantum circuit with two layers of arbitrary C-SIGN gates of any arity and arbitrary 1-qubit…
A note on the entangling properties of the C-SIGN and related quantum gates
Stephen A. Fenner
We show that any essential application of an -qubit C-SIGN or related quantum gate leaves its qubits everywhere entangled, provided they were not everywhere entangled to beg…
Compression Complexity
Stephen Fenner, Lance Fortnow
The Kolmogorov complexity of x, denoted C(x), is the length of the shortest program that generates x. For such a simple definition, Kolmogorov complexity has a rich and deep theory…
Bipartite Perfect Matching is in quasi-NC
Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf
We show that the bipartite perfect matching problem is in quasi-NC. That is, it has uniform circuits of quasi-polynomial size , and depth. Previousl…