Sciweavers

11547 search results - page 12 / 2310
» Quantum computing and communication
Sort
View
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
15 years 7 months ago
On the Power of Quantum Proofs
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 ...
Ran Raz, Amir Shpilka
SIAMCOMP
2002
153views more  SIAMCOMP 2002»
15 years 1 months 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
107
Voted
ATAL
2007
Springer
15 years 8 months ago
Programming and simulation of quantum search agents
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...
Matthias Klusch, René Schubotz
QCQC
1998
Springer
110views Communications» more  QCQC 1998»
15 years 6 months ago
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
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 ...
Michele Mosca, Artur Ekert
ACMSE
2006
ACM
15 years 5 months ago
Revisiting a limit on efficient quantum computation
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...
Tarsem S. Purewal Jr.