15 citations · 81 across the 23 of their papers we have counts for
13 papers · 1 filter
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…
Quantum algorithms for a set of group theoretic problems
Stephen Fenner, Yong Zhang
We study two group theoretic problems, GROUP INTERSECTION and DOUBLE COSET MEMBERSHIP, in the setting of black-box groups, where DOUBLE COSET MEMBERSHIP generalizes a set of proble…
Implementing fanout, parity, and Mod gates via spin exchange interactions
Stephen A. Fenner, Yong Zhang
We show that, for any n > 0, the Heisenberg interaction among 2n qubits (as spin-1/2 particles) can be used to exactly implement an n-qubit parity gate, which is equivalent in cons…
A note on the classical lower bound for a quantum walk algorithm
Stephen A. Fenner, Yong Zhang
A recent paper on quantum walks by Childs et al. [STOC'03] provides an example of a black-box problem for which there is a quantum algorithm with exponential speedup over the best…
Bounds on the Power of Constant-Depth Quantum Circuits
Stephen Fenner, Frederic Green, Steven Homer +1
We show that if a language is recognized within certain error bounds by constant-depth quantum circuits over a finite family of gates, then it is computable in (classical) polynomi…
Quantum Lower Bounds for Fanout
Maosen Fang, Stephen Fenner, Frederic Green +2
We prove several new lower bounds for constant depth quantum circuits. The main result is that parity (and hence fanout) requires log depth circuits, when the circuits are composed…
Implementing the fanout gate by a Hamiltonian
Stephen A. Fenner
We show that, for even n, evolving n qubits according to a simple Hamiltonian can be used to exactly implement an (n+1)-qubit parity gate, which is equivalent in constant depth to…
Universal quantum computation with two- and three-qubit projective measurements
Stephen A. Fenner, Yong Zhang
We present a finite set of projective measurements that, together with quantum memory and preparation of the |0> state, suffice for universal quantum computation. This extends work…
An intuitive Hamiltonian for quantum search
Stephen A. Fenner
We present new intuition behind Grover's quantum search algorithm by means of a Hamiltonian. Given a black-box Boolean function f mapping strings of length n into {0,1} such that f…
Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy
Stephen Fenner, Frederic Green, Steven Homer +1
It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also a…