10 citations · 15 across the 5 of their papers we have counts for
6 papers
Universal Quantum Gate, Yang--Baxterization and Hamiltonian
Yong Zhang, Louis H. Kauffman, Mo-Lin Ge
It is fundamental to view unitary braiding operators describing topological entanglements as universal quantum gates for quantum computation. This paper derives a unitary solution…
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…
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…
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…