11547 search results - page 53 / 2310 » Quantum computing and communication |
109
Voted
DM
2006
15 years 3 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...
176
click to vote
LOGCOM
2010
14 years 10 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...
129
click to vote
ICALP
2003
Springer
15 years 9 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...
119
click to vote
CF
2007
ACM
15 years 7 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...
146
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...