515 search results - page 41 / 103 » Classically-controlled Quantum Computation |
DM
2006
14 years 9 months ago
2006
We conjecture new sufficient conditions for a digraph to have a Hamilton cycle. In view of applications, the conjecture is of interest in the areas where unitary matrices are of i...
119
click to vote
LOGCOM
2010
14 years 4 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
100
click to vote
CRYPTO
2011
Springer
13 years 9 months ago
2011
Springer
Very few public-key cryptosystems are known that can encrypt and decrypt in time b2+o(1) with conjectured security level 2b against conventional computers and quantum computers. Th...
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
CF
2007
ACM
15 years 1 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...