8 search results - page 2 / 2 » Bounds on the Power of Constant-Depth Quantum Circuits |
STOC
1998
ACM
13 years 9 months ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
ECCC
2011
13 years 7 days ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
ATS
2005
IEEE
13 years 7 months ago
2005
IEEE
Reversibility is of interest in achieving extremely low power dissipation; it is also an inherent design requirement of quantum computation. Logical fault models for conventional ...