1677 search results - page 10 / 336 » On the Completeness of Quantum Computation Models |
STOC
2009
ACM
16 years 8 days ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
91
Voted
STOC
1997
ACM
15 years 3 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
100
Voted
ISCA
2007
IEEE
14 years 11 months ago
2007
IEEE
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...
88
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...
STOC
2007
ACM
15 years 12 months ago
2007
ACM
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...