508 search results - page 7 / 102 » Poly-locality in quantum computing |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or t...
ENTCS
2006
13 years 7 months ago
2006
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
QCQC
1998
Springer
13 years 11 months ago
1998
Springer
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...
AIEDAM
2008
13 years 7 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 ...