Sciweavers

3328 search results - page 8 / 666
» Topological Quantum Computation
Sort
View
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
14 years 2 months ago
Parallel Approximation of Non-interactive Zero-sum Quantum Games
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...
Rahul Jain, John Watrous
CORR
2000
Springer
95views Education» more  CORR 2000»
13 years 7 months ago
One Complexity Theorist's View of Quantum Computing
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...
Lance Fortnow
ENTCS
2006
136views more  ENTCS 2006»
13 years 7 months ago
Classically-controlled Quantum Computation
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...
Simon Perdrix, Philippe Jorrand
QCQC
1998
Springer
173views Communications» more  QCQC 1998»
13 years 11 months ago
Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits
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...
Amir Fijany, Colin P. Williams