2661 search results - page 32 / 533 » Quantum Complexity Classes |
87
Voted
CORR
2008
Springer
15 years 22 days ago
2008
Springer
It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of nonorthomodular and thus non-distributive lattices that properly...
103
Voted
CORR
2004
Springer
15 years 15 days ago
2004
Springer
Turbo coding is a powerful class of error correcting codes, which can achieve performances close to the Shannon limit. The turbo principle can be applied to the problem of side-in...
89
Voted
COCOON
2006
Springer
15 years 4 months ago
2006
Springer
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...
42
Voted
CORR
2010
Springer
15 years 22 days ago
2010
Springer
This chapter derives the properties of light from the properties of processing, including its ability to be both a wave and a particle, to detect objects it doesn't touch, to...