152 search results - page 1 / 31 » Why is quantum physics based on complex numbers |
FFA
2006
13 years 4 months ago
2006
ENTCS
2011
12 years 11 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
STOC
2009
ACM
14 years 5 months 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...
AIEDAM
2008
13 years 4 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
ENGL
2008
13 years 4 months ago
2008
Quantum computer algorithms require an `oracle' as an integral part. An oracle is a reversible quantum Boolean circuit, where the inputs are kept unchanged at the outputs and ...