1677 search results - page 15 / 336 » On the Completeness of Quantum Computation Models |
109
click to vote
STOC
2003
ACM
15 years 12 months 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...
CF
2007
ACM
15 years 3 months ago
2007
ACM
We present a computer-aided design flow for quantum circuits, complete with automatic layout and control logic extraction. To motivate automated layout for quantum circuits, we in...
ENTCS
2011
14 years 6 months ago
2011
Abstract—We present elements of quantum circuits translations from the (standard) network or circuit model to the one-way one. We present a translation scheme, give an account of...
CIE
2007
Springer
15 years 5 months ago
2007
Springer
The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of co...
123
click to vote
COCO
2009
Springer
15 years 6 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...