QUANTUM COMPUTING - Bio-Inspired and Nanoscale Integrated Computing - page 103

169. W. K. Wootters and W. H. Zurek. A single quantum cannot be cloned. Nature, 299:
p 802, 1982.
170. V. Buzek and M. Hillery. Universal optimal cloning of qubits and quantum registers.
QCQC 98, Feb 1998. (Online preprint quant-ph/9801009)
171. A. Ekert, S F. Huelga, C. Macchiavello, and J. I. Cirac. Distributed quantum
computation over noisy channels. 1998. (Online preprint quant-ph/9803017)
172. D. R. Simon. On the power of quantum computation. In: Proceedings of the 35th
Annual Symposium on Fundamentals of Computer Science. Piscataway, NJ: IEEE
Press, pp 116-123, Nov. 1994.
173. G. Brassard and P. Hoyer. An exact quantum polynomial-time algorithm for Simon's
problem. In: Proceedings of the Fifth Israeli Symposium on Theory of Computing and
Systems (ISTCS'97). (Online preprint quant-ph/9704027)
174. D. Coppersmith. An approximate fourier transform useful in quantum computing.
IBM Research Report RC19642: 1994.
175. R. B. Griffiths and C. Niu. Semiclassical Fourier transform for quantum computa-
tion. Physical Review Letters, 76: pp 3228-3231, 1996. (Online preprint quant-ph/
9511007)
176. P. Hoyer. Efficient quantum transforms. 1997. (Online preprint quant-ph/9702028)
177. R. Beals. Quantum computation of Fourier transforms over symmetric groups. In:
Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Comput-
ing, El Paso, Texas, May 4-6: pp 48-53, 1997.
178. M. Pueschel, M. Roetteler, and T. Bet. Fast quantum Fourier transforms for a class of
non-abelian groups. Universitaet Karlsruhe, 1998. (Online preprint quant-ph/

9807064)
179. V. Vedral, A. Barenco, and A. Ekert. Quantum networks for elementary arithmetic
operations. 1996. (Online preprint quant-ph/9511018)
180. D. Grigoriev. Testing shift-equivalence of polynomials by deterministic. probabilistic
and quantum machines, Theoretical Computer Science, 180(1-2): pp 217-228, June 1997.
181. P. W. Shor. Algorithms for quantum computation: discrete logarithms and factoring,
Proceedings of the 35th Annual Symposium on Foundations of Computer Science,
Santa Fe, New Mexico, Nov 1994.
182. P. W. Shor. Polynomial-Time Algorithms for Prime Factorization and Discrete
Logarithms on a Quantum Computer. SIAM Journal of Computing, 26: p 1484,
1997. (Online preprint quant-ph/9508027)
183. A. Ekert and R. Jozsa. Shor's quantum algorithm for factoring numbers. Review of
Modern Physics, 1996.
184. G. L. Miller. Reimann's hypothesis and test for primality. Journal of Computer
Systems Science, 12: pp 300-317, 1976.
185. C. Zalka. Fast versions of Shor's quantum factoring algorithm. 1998. (Online preprint
quant-ph/9806084)
186. D. Beckman, A. N. Chari, S. Devabhaktuni, and J. Preskill. Efficient networks for
quantum factoring. 1996. (Online preprint quant-ph/9602016)
187. K. Obenland and A. M. Despain. Simulation of factoring on a quantum computer
architecture. In: Proceedings of the 4th Workshop on Physics and Computation,
Boston, Massachusetts, Nov 1996. Boston: New England Complex Systems Institute.