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...
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...
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...
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...
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...