David J. Rosenbaum

Learn More
This paper presents a new quantum array that can be used to control a single-qudit hermitian operator for an odd radix r > 2 by n controls using Θ ( n2 r+2 ) single-qudit controlled gates with one control and no ancilla qudits. This quantum array is more practical than existing quantum arrays of the same complexity because it does not require the use of(More)
We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G ∼= H . For several decades, the np n+O(1) generatorenumeration bound (where p is the smallest prime dividing the order of the group) has been the best worst-case result for general groups. In this work, we show the first(More)
In this work, we introduce bidirectional collision detection — a new algorithmic tool that applies to the collision problems that arise in many isomorphism problems. For the group isomorphism problem, we show that bidirectional collision detection yields a deterministic n logn+O(1) time algorithm whereas previously the n generator-enumeration algorithm was(More)
BACKGROUND AND OBJECTIVES Continuity of care is one of the presumed advantages of longitudinal residencies. However, it is not clear how well such residencies provide continuity of care, and, further, there is no recognized acceptable rate of good continuity. We compared traditional and longitudinal residencies to determine the extent to which the residents(More)
Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants (ESQUID) is a new algorithm for generating quantum arrays for the purpose of initializing a desired quantum superposition. The quantum arrays generated by this algorithm almost always use fewer gates than other algorithms and in the worst case use the same number of gates.(More)
We consider a generalization of the standard oracle model in which the oracle acts on the target with a permutation which is selected according to internal random coins. We show new exponential quantum speedups which may be obtained over classical algorithms in this oracle model. Even stronger, we describe several problems which are impossible to solve(More)