Quantum effects in algorithms

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

Volumn 1509, Issue , 1999, Pages 103-112

  Jozsa, Richard ^a  

^a UNIVERSITY OF PLYMOUTH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DECISION THEORY; MEASUREMENT THEORY; NASA; QUANTUM COMPUTERS; QUANTUM ENTANGLEMENT; QUANTUM OPTICS;

DECISION PROBLEMS; ENTANGLED QUANTUM SYSTEMS; NON-TRIVIAL; ON/OFF SWITCH; QUANTUM ALGORITHMS; QUANTUM EFFECTS; QUANTUM MEASUREMENT THEORIES; QUANTUM PHYSICS;

QUANTUM COMMUNICATION;

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

References (22)

1. Jozsa, R., Proc. Roy. Soc. Lond. A 454, 323-337 (1998)
2. Jozsa, R., "Entanglement and Quantum Computation" in The Geometric Universe ed. S. Huggett, L. Mason, K. P. Tod, S. T. Tsou and N. Woodhouse. Oxford University Press. (Also available at http://xxx.lanl.govasquant-ph/9707034.)
3. Steane, A., Proc. Roy. Soc. Lond. A 452, 2551 (1996)
4. Calderbank, A. R. and Shor, P. W., Phys. Rev. A 54, 1098 (1996)
5. Gottesmann, D., Phys. Rev. A 54, 1862 (1996)
6. Ekert, A. and Jozsa, R., "Quantum Algorithms: Entanglement Enhanced Information Processing" appearing in Phil. Trans. Roy. Soc. Lond. (1998). (Also available at http://xxx.lanl.govasquant-ph/9803072)
7. Barenco, A., Berthiaume, A., Deutsch, D., Ekert, A., Jozsa, R. and Macchiavello, C., S.I.A.M. Journal on Computing 26, 1541-1557 (1997)
8. Deutsch, D., Proc. Roy. Soc. Lond. A 400, 97 (1985)
9. Holevo, A. S., Probl. Inf. Transm. 9, 177 (1973)
10. Deutsch, D. and Jozsa, R., Proc. Roy. Soc. Lond. A 439, 553-558 (1992)
11. Simon, D., Proc. of 35th Annual Symposium on the Foundations of Computer Science, (IEEE Computer Society, Los Alamitos), p. 116 (1994) (Extended Abstract). Full version of this paper appears in S. I. A. M. Journal on Computing 26, 1474 (1997).
12. Shor, P., Proc. of 35th Annual Symposium on the Foundations of Computer Science, (IEEE Computer Society, Los Alamitos), p 124 (1994) (Extended Abstract). Full version of this paper appears in S. I. A. M. Journal on Computing 26 (Oct 1997) and is also available at LANL quant-ph preprint archive 9508027.
13. Ekert, A. and Jozsa, R., Rev. Mod. Phys. 68, 733-753 (1996)
14. Maslen, D. K. and Rockmore, D. N., Generalised FFT’s - a Survey of Some Recent Results, in Proc. DIMACS Workshop on Groups and Computation - II (1995)
15. Grover, L. Proc. 28th Annual ACM Symposium on the Theory of Computing, (ACM Press, New York), p. 212-219 (1996)
16. Papadimitriou, C. H., Computational Complexity (Addison-Wesley, Reading, MA) (1994)
17. Hoyer, P., "Efficient Quantum Algorithms", preprint available a quant-ph/9702028 (1997)
18. Cleve, R., Ekert, A., Macchiavello, C. and Mosca, M., Proc. Roy. Soc. Lond. A 454, 339-354 (1998)
19. FAPP is an acronym introduced by J. S. Bell meaning "for all practical purposes".
20. Penrose, R.: Shadows of the Mind, Oxford University Press (1994)
21. Elitzur, A. C. and Vaidman, L., Found. of Phys. 23, 987-997 (1993)
22. Kwiat, P. G., Weinfurter, H., Herzog, T., Zeilinger, A. and Kasevich, M. A., Phys. Rev. Lett. 74, 4763-4766 (1995)