We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
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...
Key idea of this work is to appropriately extend one prominent generic agent architecture, namely InteRRap [8], to the case of a quantum pattern matching (QPM) based type-I quantu...
Abstract. A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and hidden ...
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...