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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barenco, A., Bennett, C.H., Cleve, R, DiVincenzo, D.P., Margolus, N., Shor, P., Sleater, T., Smolin, J., Weinfurter, H.: Phys. Rev. A 52, (1995) 3457.
Boneh, D., and Lipton, R.J.: Quantum cryptanalysis of hidden linear functions (Extended abstract). Lecture Notes on Computer Science 963 (1995) 424–437
Cleve, R., Ekert, E., Macchiavello, C., and Mosca, M.: Quantum Algorithms Revisited, Proc. Roy. Soc. Lond. A, 454, (1998) 339–354.
Deutsch, D.: Quantum Theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. Lond. A, 400, (1985) 97–117.
Ekert, A., Mosca, M.: (note in preparation, 1998).
Griffiths, R.B. and Niu, C.-S.: Semi-classical Fourier Transform for Quantum Computation, Phys. Rev. Lett. 76 (1996) 3228–3231.
Grigoriev, D. Y.: Testing the shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. Theoretical Computer Science, 180 (1997) 217–228.
HØyer, P.: Conjugated Operators in Quantum Algorithms. preprint, (1997).
Jozsa, R.: Quantum Algorithms and the Fourier Transform, Proc. Roy. Soc. Lond. A, 454, (1998) 323–337.
Kitaev, A. Y.: Quantum measurements and the Abelian stabiliser problem. eprint quant-ph/9511026 (1995)
Lenstra, H. W. Jr., and Pomerance, C.: A Rigorous Time Bound For Factoring Integers, Journal of the AMS, Volume 5, Number 2, (1992) 483–516.
Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography, C.R.C. Press, 1997.
Shor, P.: Algorithms for quantum computation: Discrete logarithms and factoring. Proc. 35th Ann. Symp. on Foundations of Comp. Sci. (1994) 124–134
Simon, D.: On the Power of Quantum Computation. Proc. 35th Ann. Symp. on Foundations of Comp. Sci. (1994) 116–123
Turchette, Q.A., Hood C.J., Lange W., Mabuchi H., and Kimble H.J.: Measurement of conditional phase shifts for quantum logic. Phys. Rev. Lett., 76, 3108 (1996).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mosca, M., Ekert, A. (1999). The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer. In: Williams, C.P. (eds) Quantum Computing and Quantum Communications. QCQC 1998. Lecture Notes in Computer Science, vol 1509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49208-9_15
Download citation
DOI: https://doi.org/10.1007/3-540-49208-9_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65514-5
Online ISBN: 978-3-540-49208-5
eBook Packages: Springer Book Archive