1677 search results - page 13 / 336 » On the Completeness of Quantum Computation Models |
142
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
169
click to vote
FOCS
2006
IEEE
15 years 12 months ago
2006
IEEE
We show that quantum circuits cannot be made faulttolerant against a depolarizing noise level of ˆθ = (6 − 2 √ 2)/7 ≈ 45%, thereby improving on a previous bound of 50% (du...
146
click to vote
CORR
2000
Springer
15 years 5 months ago
2000
Springer
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
155
click to vote
COMPUTER
2002
15 years 5 months ago
2002
wever, by using a simple model of abstract building blocks: quantum bits, gates, and algorithms, and the available implementation technologies--in all their imperfections.7 The bas...
161
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...