Kitaev presents a polynomial quantum algorithm for the Abelian stabilizer problem based on measuring eigenvalues of unitary operators, generalizing Shor's factoring and discrete-log algorithms.
Machines de Turing reversibles. Recursi ve insolubilite en nǫN de l’equation u =θ n ou θ est un “isomorphism de codes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
1995 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Quantum measurements and the Abelian Stabilizer Problem
Kitaev presents a polynomial quantum algorithm for the Abelian stabilizer problem based on measuring eigenvalues of unitary operators, generalizing Shor's factoring and discrete-log algorithms.