Sciweavers

2661 search results - page 7 / 533
» Quantum Complexity Classes
Sort
View
105
Voted
ALGORITHMICA
2002
121views more  ALGORITHMICA 2002»
15 years 13 days ago
Sharp Quantum versus Classical Query Complexity Separations
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
J. Niel de Beaudrap, Richard Cleve, John Watrous
EJC
2010
15 years 20 days ago
On the equivalence between real mutually unbiased bases and a certain class of association schemes
Mutually unbiased bases (MUBs) in complex vector spaces play several important roles in quantum information theory. At present, even the most elementary questions concerning the m...
Nicholas LeCompte, William J. Martin, William Owen...
123
Voted
SIAMCOMP
2002
153views more  SIAMCOMP 2002»
15 years 7 days ago
A Decision Procedure for Unitary Linear Quantum Cellular Automata
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quan...
Christoph Dürr, Miklos Santha
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
15 years 7 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
109
Voted
DAGSTUHL
2006
15 years 2 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum