Sciweavers

Share
QCQC
1998
Springer

The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer

11 years 2 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 or unknown subgroups of Abelian groups. It is already known how to phrase the first four problems as the estimation of eigenvalues of certain unitary operators. Here we show how the solution to the more general Abelian hidden subgroup problem can also be described and analysed as such. We then point out how certain instances of these problems can be solved with only one control qubit, or flying qubits, instead of entire registers of control qubits.
Michele Mosca, Artur Ekert
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1998
Where QCQC
Authors Michele Mosca, Artur Ekert
Comments (0)
books