Next: About this document ...
Up: Final Report for the
Previous: Final Report for the
- 1
- R. Beals, H. Buhrman, R. Cleve, M. Mosca and R. de Wolf. Quantum Lower bounds
by polynomials,
Journal of the ACM 48, pp. 778-797, (2001)
- 2
- E. Farhi, J. Goldstone, S. Gutmann, M. Sniper. Limit on the speed of of quantum
computation in determining parity,
Phys. Rev. Lett. 81, p. 5442, (1998)
- 3
- J. M. Myers, A. F. Fahmy, S. J. Glaser, R. Marx.
Rapid solution of problems by nuclear-magnetic-resonance quantum computation,
Phys. Rev. A 63
p. 032302, (2001)
- 4
- L. Spector, H. Barnum, H. Bernstein, and N. Swamy. Quantum Computing Applications of Genetic Programming,
in Advances in Genetic Programming, L. Spector, U.-M. O'Reilly, W. Langdon and P. Angeline, eds., vol. 3, pp. 135-160, MIT
Press, Cambridge, MA, USA, 1999
- 5
- D. R. Simon. On the Power of Quantum Computation,
SIAM J. Comput. Vol. 26, No. 5,
pp. 1474-1483, (1997)
- 6
- D. Chi, J. Kim, S. Lee. Function-dependent Phase Transform in Quantum Computing,
eprint arXiv: quant-ph/0006039
- 7
- D. P. Chi, J. Kim and S. Lee. Initialization-free generalized Deutsch-Jozsa algorithm,
J. Phys. A: Math. Gen. 34, p. 5251
- 8
- D. Deutsch and R. Jozsa. Rapid solution of problems by quantum computation,
Proc. R. Soc. London A, 439, pp. 553-558, 1992
- 9
- R. Stadelhofer, D. Suter and W. Banzhaf. Quantum and Classical Parallelism in Parity Algorithms for
Ensemble Quantum Computers.
Submitted to Phys. Rev. A
- 10
- C. Williams and A. Gray. Automated Design of Quantum Circuits.
QCQC98, Lecture Notes on Compu. Sci., v. 1509, pp. 113-125, Springer-Verlag, 1999.
- 11
- H. Barnum, H. J. Bernstein, L. Spector. Quantum Circuits for OR and AND of ORs,
J. Phys. A: Math. Gen. 33, pp. 8047-8057, (2000)
Ralf Stadelhofer
2004-11-18