next up previous contents
Next: List of Tables Up: A Procedural Formalism for Previous: Shor's Algorithm for Quantum   Contents

Bibliography

1
Paul Benioff 1997 Models of Quantum Turing Machines, LANL Archive quant-ph/9708054

2
J.I. Cirac, P. Zoller 1995 Quantum Computations with Cold trapped Ions, Phys. Rev. Lett. 74, 1995 , 4091

3
D. Deutsch, 1985 Proceedings of the Royal Society London A 400, 97-117

4
J. Gruska, 1998 Foundations of Computing, chap. 12: ``Frontiers - Quantum Computing''

5
R. W. Keyes 1988 IBM J. Res. Develop. 32, 24

6
D. Deutsch 1989 Quantum computational networks. Proceedings of the Royal Society London A 439, 553-558

7
D. Coppersmith 1994 An Approximate Fourier Transform Useful in Quantum Factoring, IBM Research Report No. RC19642

8
C. H. Bennet 1973 IBM J. Res. Develop. 17, 525

9
C. H. Bennet 1989 SIAM J.Comput. 18, 766

10
Johannes Buchmann 1996 Faktorisierung großer Zahlen. Spektrum der Wissenschaft 9/96, 80-88

11
P.W. Shor. 1994 Algorithms for quantum computation: Discrete logarithms and factoring

12
Samuel L. Braunstein 1995 Quantum computation: a tutorial

13
David Beckman et al. 1996 Efficient networks for quantum factoring

14
Artur Ekert and Richard Jozsa. 1996 Shor's Quantum Algorithm for Factoring Numbers, Rev. Modern Physics 68 (3), 733-753

15
G.H. Hardy and E.M. Wright 1965 An Introduction to the Theory of Numbers (4th edition OUP)

16
W. Kummer and R. Trausmuth 1988 Skriptum zur Vorlesung 131.869 - Quantentheorie

17
B. Oemer 1996 Simulation of Quantum Computers [unpublished]




(c) Bernhard Ömer - oemer@tph.tuwien.ac.at - http://tph.tuwien.ac.at/~oemer/