508 search results - page 32 / 102 » Quantum Computers |
APN
2007
Springer
15 years 6 months ago
2007
Springer
We shall describe connections between Petri nets, quantum physics and category theory. The view of Net theory as a kind of discrete physics has been consistently emphasized by Carl...
COCOON
2006
Springer
15 years 3 months ago
2006
Springer
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
STACS
2005
Springer
15 years 5 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 ...
109
click to vote
STACS
2009
Springer
15 years 6 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
110
click to vote
STOC
2003
ACM
16 years 3 days ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...