11547 search results - page 6 / 2310 » Quantum computing and communication |
114
Voted
QCQC
1998
Springer
15 years 6 months ago
1998
Springer
In order to design a quantum circuit that performs a desired quantum computation, it is necessary to find a decomposition of the unitary matrix that represents that computation in ...
106
click to vote
QCQC
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
119
click to vote
STACS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
139
Voted
ISCI
2008
15 years 1 months ago
2008
Most modern cryptographic studies design cryptosystems and algorithms using mathematical concepts. In designing and analyzing cryptosystems and protocols, mathematical concepts ar...
104
click to vote
COCO
2009
Springer
15 years 8 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...