11547 search results - page 38 / 2310 » Quantum computing and communication |
161
click to vote
IAJIT
2010
15 years 5 months ago
2010
: In this paper, a quantum-inspired differential evolution algorithm for solving the N-queens problem is presented. The N-queens problem aims at placing N queens on an NxN chessboa...
171
click to vote
CRYPTO
2009
Springer
16 years 1 months ago
2009
Springer
We consider two-party quantum protocols starting with a transmission of some random BB84 qubits followed by classical messages. We show a general “compiler” improving the secur...
165
click to vote
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
165
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a uniformly random bit [Blu81]. Quantum information allows for ...
164
click to vote
COMPUTER
2002
15 years 6 months ago
2002
wever, by using a simple model of abstract building blocks: quantum bits, gates, and algorithms, and the available implementation technologies--in all their imperfections.7 The bas...