Sciweavers

587 search results - page 35 / 118
» Quantum computation and quantum information
Sort
View
IPL
2006
104views more  IPL 2006»
13 years 10 months ago
The communication complexity of the Hamming distance problem
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
ISCA
2007
IEEE
94views Hardware» more  ISCA 2007»
13 years 10 months ago
Tailoring quantum architectures to implementation style: a quantum computer for mobile and persistent qubits
In recent years, quantum computing (QC) research has moved from the realm of theoretical physics and mathematics into real implementations [9]. With many different potential hardw...
Eric Chi, Stephen A. Lyon, Margaret Martonosi
CRYPTO
2009
Springer
150views Cryptology» more  CRYPTO 2009»
14 years 4 months ago
Improving the Security of Quantum Protocols via Commit-and-Open
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...
Ivan Damgård, Serge Fehr, Carolin Lunemann, ...
ICS
2010
Tsinghua U.
14 years 2 months ago
Bounds on the Quantum Satisfiability Threshold
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...
Sergey Bravyi, Cristopher Moore, Alexander Russell