The hidden subgroup problem and eigenvalue estimation on a quantum computer

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1509, Issue , 1999, Pages 174-188

  Mosca, Michele ^a   Ekert, Artur ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; GROUP THEORY; NASA; QUANTUM COMMUNICATION; QUANTUM OPTICS;

ABELIAN GROUP; COMPOSITE INTEGERS; DISCRETE LOGARITHMS; EIGENVALUE ESTIMATIONS; EIGENVALUES; FLYING QUBITS; HIDDEN SUBGROUP PROBLEM; UNITARY OPERATORS;

QUBITS;

EID: 84961385953     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49208-9_15     Document Type: Conference Paper

References (15)

1. 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.
2. Boneh, D., and Lipton, R.J.: Quantum cryptanalysis of hidden linear functions (Extended abstract). Lecture Notes on Computer Science 963 (1995) 424-437
3. Cleve, R., Ekert, E., Macchiavello, C., and Mosca, M.: Quantum Algorithms Revisited, Proc. Roy. Soc. Lond. A, 454, (1998) 339-354.
4. Deutsch, D.: Quantum Theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. Lond. A, 400, (1985) 97-117.
5. Ekert, A., Mosca, M.: (note in preparation, 1998).
6. Griffiths, R.B. and Niu, C.-S.: Semi-classical Fourier Transform for Quantum Computation, Phys. Rev. Lett. 76 (1996) 3228-3231.
7. Grigoriev, D. Y.: Testing the shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. Theoretical Computer Science, 180 (1997) 217-228.
8. Høyer, P.: Conjugated Operators in Quantum Algorithms. preprint, (1997).
9. Jozsa, R.: Quantum Algorithms and the Fourier Transform, Proc. Roy. Soc. Lond. A, 454, (1998) 323-337.
10. Kitaev, A. Y.: Quantum measurements and the Abelian stabiliser problem. eprint quant-ph/9511026 (1995)
11. 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.
12. Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography, C.R.C. Press, 1997.
13. Shor, P.: Algorithms for quantum computation: Discrete logarithms and factoring. Proc. 35th Ann. Symp. on Foundations of Comp. Sci. (1994) 124-134
14. Simon, D.: On the Power of Quantum Computation. Proc. 35th Ann. Symp. on Foundations of Comp. Sci. (1994) 116-123
15. 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).