8 search results - page 1 / 2 » Bounds on the Power of Constant-Depth Quantum Circuits |
FCT
2005
Springer
14 years 4 months ago
2005
Springer
CORR
2002
Springer
13 years 11 months ago
2002
Springer
We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denot...
EUROCRYPT
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
STOC
1993
ACM
14 years 3 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
ISAAC
2004
Springer
14 years 4 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...