217 citations · 398 across the 3 of their papers we have counts for
3 papers
Efficient Distributed Quantum Computing
Robert Beals, Stephen Brierley, Oliver Gray +5
We provide algorithms for efficiently addressing quantum memory in parallel. These imply that the standard circuit model can be simulated with low overhead by the more realistic mo…
Polynomials with a common composite
Robert M. Beals, Joseph L. Wetherell, Michael E. Zieve
Let f and g be nonconstant polynomials over an arbitrary field K. In this paper we study the intersection of the polynomial rings K[f] and K[g], and in particular we ask whether th…
Quantum Lower Bounds by Polynomials
Robert Beals, Harry Buhrman, Richard Cleve +2
We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the…