5 citations · 5 across the 4 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2019★ 5 cited
Stabilizer Circuits, Quadratic Forms, and Computing Matrix Rank
Chaowen Guan, Kenneth W. Regan
We show that a form of strong simulation for -qubit quantum stabilizer circuits is computable in time, where is the exponent of matrix multiplication. Solut…
cs.CC2014
Polynomials Modulo Composite Numbers: Ax-Katz type theorems for the structure of their solution sets
Robert L. Surowka, Kenneth W. Regan
We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significa…
cs.CC2012
Simulating Special but Natural Quantum Circuits
Richard J. Lipton, Kenneth W. Regan, Atri Rudra
We identify a sub-class of BQP that captures certain structural commonalities among many quantum algorithms including Shor's algorithms. This class does not contain all of BQP (e.g…