ARC Colloquium: Ken Regan, University at Buffalo
Primary tabs
Abstract:
We present variations on a polynomial construction used by Dawson et al. [2004] to simplify the proof that BQP is a subclass of PP, and by Gerdt and Severyanov [2006] to simulate quantum circuits. The constructions map additively into rings Z_m as well as multiplicatively into fields. Polynomial-time classical simulation of classes of quantum circuits thus reduces to whether certain highly-restricted subcases of the general #P-complete problem of counting solutions to polynomial equations belong to P. Ideas are given for relating BQP to the polynomial hierarchy, for quantifying multi-partite entanglement, and for algebraic complexity.
This is joint work in progress with Amlan Chakrabarti, University of Calcutta.
Groups
Status
Categories
- No categories were selected.
Keywords
- No keywords were submitted.