Quantum Computing and Communications: An Engineering Approach

Quantum Computing and Communications: An Engineering Approach

Volumn , Issue , 2013, Pages 1-283

  Imre, Sándor ^a   Balázs, Ferenc ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER HARDWARE; MOBILE TELECOMMUNICATION SYSTEMS; MULTIUSER DETECTION; QUANTUM COMPUTERS; QUANTUM CRYPTOGRAPHY; QUANTUM OPTICS; SEARCH ENGINES; STUDENTS;

COMMUNICATIONS EQUIPMENT; CONVENTIONAL COMPUTERS; DATABASE SEARCHING; ENGINEERING PRACTICES; GRADUATE STUDENTS; IP-BASED NETWORKS; KEY DISTRIBUTION; QUANTUM COMPUTING;

QUANTUM COMMUNICATION;

EID: 84948735217     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470869048     Document Type: Book

References (161)

1. A. Ahuja, S. Kapoor. A quantum algorithm for finding the maximum. 1999. e-print quant-ph/9911082.
2. A. Aspect, J. Dalibard, G. Roger. Experimental test of Bell's inequalities using time-varying analyzers. Phys. Rev. Lett., 49:1804-1807, 1982.
3. A. Bell, T. J. Sejnowski. An information-maximisation approach to blind separation and blind deconvolution. Neural Computation, 7:1129-1159, 1995.
4. B. Podolsky, A. Einstein, N. Rosen. Can quantum-mechanical description of physical reality be considered complete? Phys. Rev., 47:777-780, 1935.
5. A. Engelhart, W. Teich, J. Lindner, G. Jeney, S. Imre, L. Pap. A survey of multiuser/multisubchannel detection schemes based on recurrent neural networks. Wireless Communications and Mobile Computing, 2(3):269-284, 2002. Special issue on Advances in 3G Wireless Networks.
6. A. G. Fowler, L. C. L. Hollenberg. Robustness of Shor's algorithm with finite rotation control. 2003. e-print quant-ph/0306018.
7. A. Hyvärinen, J. Karhunen, E. Oja. Independent Component Analysis. Adaptive and Learning Systems for Signal Processing, Communication and Control. J. Wiley & Sons, Inc., New York, 2001.
8. A. J. Menezes, P. C. van Oorschot, S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 5th edition, 2001. e-print www.cacr.math.uwaterloo.ca/hac/.
9. A. K. Ekert, P. Hayden, H. Inamori. Basic concepts in quantum computation. Lectures given at les Houches Summer School on "Coherent Matter Waves", July-August 1999. e-print quant-ph/0011013.
10. A. K. Lenstra, H. W. Lenstra, editors. The Development of the Number Field Sieve, volume 1554 of Lecture Notes in Mathematics. Springer Verlag, Berlin, 1993.
11. A. K. Pati, S. L. Braunstein. Deutsch-Jozsa algorithmfor continuous variables. In A. K. Pati, S. L. Braunstein, editors, Quantum Information with Continuous Variables. Kluwer, April 2003.
12. A. Klappenecker, M. Rötteler. Discrete cosine transforms on quantum computers. Proceedings of IEEE of International Symposia on Image and Signal Processing and Analysis (ISPA'01), June 19-21, 2001. e-print quantph/0111038.
13. A. Muller, H. Zbinden, N. Gisin. Underwater quantum coding. Nature, 378:449-449, 1995.
14. A. Muller, H. Zbinden, N. Gisin. Quantum cryptography over 23 km in installed under-lake telecom fibre. Europhysics Lett., 33:335-339, 1996.
15. A. Muller, J. Breguet, N. Gisin. Experimental demonstration of quantum cryptography using polarized photons in optical fiber over more than 1 km. Europhysics Lett., 23:383-388, 1993.
16. A. Muthukrishnan, C. R. Stroud. Quantum fast Fourier transform using multilevel atoms. J. Mod. Opt., 49:2115-2127, 2002. e-print quantph/0112017.
17. A. Peres, W. K.Wooters. Optimal detection of quantum information. Phys. Rev. Lett., 66:1119-1122, 1991.
18. A. R. Kessel, N. M. Yakovleva. Schemes of implementation in NMR of quantum processors and Deutsch-Jozsa algorithm by using virtual spin representation. 2002. e-print quant-ph/0206106.
19. A. Saito, K. Kioi, Y. Akagi, N. Hashizume, K. Ohta. Actual computational time-cost of the quantum Fourier transform in a quantum computer using nuclear spins. 2000. e-print quant-ph/0001113.
20. A. Schönhage, V. Strassen. Schnelle multiplication grosser zahlen. Computing, 7:281-292, 1971.
21. A. Stefanov, O. Guinnard, L. Guinnard, H. Zbinden, N. Gisin. Optical quantum random number generator. J. Modern Optics, 47:595-598, 2000. e-print quantph/9907006.
22. A. Zeilinger. Quantum teleportation. Scientific American, 285(4):32-41, 2000. e-print http://www.quantum.univie.ac.at/links/sci am/teleportation.pdf.
23. E. S. Abers. Quantum Mechanics. Pearson Education Inc., New Jersey, USA, 2004.
24. B. Aazhang, B.-P. Paris, G. C. Orsak. Neural networks for multiuser detection in code-division multiple-access communications. IEEE Trans. on Communications, 40(7):1212-1222, July 1992.
25. B. C. Travaglione, G. J. Milburn. Generation of eigenstates using the phase-estimation algorithm. Phys. Rev. A, 63(03230), 2001. e-print quantph/0008053.
26. B. C. Travaglione, G. J. Milburn, T. C. Ralph. Phase estimation as a quantum nondemolition measurement. 2002. e-print quant-ph/0203130.
27. B. Huttner, J. D. Gautier, A. Muller, H. Zbinden, N. Gisin. Unambiguous quantum measurement of non-orthogonal states. Phys. Rev. A, 54:3783-3789, 1996.
28. B. Jakobs, J. Franson. Quantum cryptography in free space. Rev. Sci. Inst., 71:1675-1680, 1996. e-print quant-ph/9912118.
29. J. S. Bell. On the problem of hidden variables in quantum mechanics. Review of Modern Phys., 38:447-452, 1964.
30. C. H. Bennett. Quantum cryptography using any two nonorthogonal states. Phys. Rev. Lett., 68:3121-3124, 1992. e-print http://www.research.ibm.com/people/b/bennetc/qc2nos.pdf.
31. D. Bruss. Optimal eavesdropping in quantum cryptography with six states. Phys. Rev. A, 81:3018-3021, 1998. e-print quant-ph/9805019.
32. C. Dürr, P. Hoyer. A quantum algorithmfor finding the minimum. 1996. e-print quant-ph/9607014.
33. C. H. Bennett, E. Bernstein, G. Brassard, U. Vazirani. Strengths and weakness of quantum computing. SIAM Journal on Computing, 26(5):1510-1523, 1997. e-print quant-ph/9701001.
34. C. H. Bennett, F. Bessette, L. Salvail, J. Smolin. Experimental quantum cryptography. Journal of Cryptology, 5:210-229, 1992.
35. C. H. Bennett, G. Brassard. Quantum cryptography: Public key distribution and coin tossing. Int. conf. Computers, Systems & Signal Processing, pages 175-179, Bangalore, India, December 10-12 1984. e-print http://www.research.ibm.com/people/b/bennetc/bennettc198469790513.pdf.
36. C. H. Bennett, G. Brassard. Quantum public key distribution system. IBM Tehnical Disclosure Bulletin, 28:3153-3163, 1985.
37. C. H. Bennett, G. Brassard , C. Crépeau, U. M. Maurer. Generalized privacy amplification. IEEE Transaction on Information Theory, 41:1915-1923, 1995.
38. C. H. Bennett, G. Brassard, A. Ekert. Quantum cryptography. Scientific American, 267(4):50-57, 1992.
39. C. H. Bennett, G. Brassard, J.-M. Robert. Privacy amplification by public discussion. SIAM Journal on Computing, 17:210-229, 1988.
40. C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, W. K. Wootters. Teleporting an unknown quantumstate via dual classic and Einstein-Podolsky-Rosen channels. Phys. Rev. Lett., 70:1895-1899, 1993. e-print http://www.research.ibm.com/quantuminfo/teleportation/teleportation.html.
41. C. H. Bennett, S. J.Wiesner. Communication via 1- and 2-particle operators on Einstein-Podolsky-Rosen states. Phys. Rev. Lett., 69:2881-2884, 1992. e-print http://www.research.ibm.com/people/b/bennetc/bennettc19926c731103.pdf.
42. R. Cleve. A note on computing Fourier transforms by quantum programs. Technical report, 1994. e-print http://pages.cpsc.ucalgary.ca/cleve.papers.html.
43. C. Cocks. Technical report, Communications-Electronics Security Group, 1973.
44. D. Coppersmith. An approximate Fourier transform useful in quantum factoring, IBM research report. Technical Report RC 19642, IBM Research Division T.J. Watson Research Center, December 1994. e-print quantph/0201067.
45. L. M. Correia, editor.Wireless Flexible Personalised Communications. J.Wiley & Sons, 2001.
46. D. Biron, O. Biham, E. Biham, M. Grassl, D. A. Lidar. Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution, volume 1509 of Lecture Notes in Computer Science, pages 140-147. Springer, 1998. e-print quant-ph/9801066.
47. D. Bouwmeester, J.-W. Pan, K. Mattle, M. Eibl, H. Weinfurter, A. Zeilinger. Experimental quantum teleportation. Nature, (390):575, 1997.
48. D. Deutsch, A. Ekert, R. Lupacchini. Machines, logic and quantum physics. The Bulletin of Symbolic Logic, pages 265-283, 2000. e-print http://xxx.lanl.gov/abs/math.HO/9911150.
49. D. Deutsch, R. Jozsa. Rapid solution of problems by quantum computation. Proc. R. Soc. London, Ser. A, 439:553-558, 1992.
50. D. P. Chi, J. Kim, S. Lee. Quantum algorithm for generalized Deutsch-Jozsa problem. 2000. e-print quant-ph/0005059.
51. D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc., London, Ser. A, 400:97-117, 1985.
52. E. Biham, G. Brassard, D. Kenigsberg, T. Mor. Quantum computing without entanglement. Presented at FoCM'02 (Aug 2002), QIP'03 (Dec 2002), Qubit'03 (Apr 2003), 2003. e-print quant-ph/0306182.
53. E. Biham, O. Biham, D. Biron , M. Grassl, D. A. Lidar. Grover's Search Algorithm for an Arbitrary Initial Amplitude Distribution, volume 60, pages 2742-2745. 1999. e-print quant-ph/9807027.
54. E. Biham, O. Biham, D. Biron ,M. Grassl, D. A. Lidar, D. Shapira. Analysis of generalized Grover's search algorithms using recursion equations. Phys. Rev. A, 63, 2001. e-print quant-ph/0010077.
55. E. Brainis, L. P. Lamoureux, N. J. Cerf, Ph. Emplit, M. Haelterman and S. Massar. Fiber-optics implementation of Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms with three qbits. Phys. Rev. Lett., 90:157902/1-4, 2003. e-print quant-ph/0212142.
56. A. K. Ekert. Quantum cryptography based on Bell's theorem. Phys. Rev. Lett., (3):661-663, 1991.
57. T. ElGamal. Cryptography and Logarithms over Finite Fields. PhD thesis, Stanford University, 1984.
58. J. H. Ellis. Technical report, Communications-Electronics Security Group, 1970.
59. F. Chung, R. Graham, T. Leighton. Guessing secrets. Electronic Journal of Combinatorics, 8(R13), 2001. e-print http://www.combinatorics.org/Volume 8/Abstracts/v8i1213.html.
60. G. Brassard, P. Hoyer. An exact quantum polynomial-time algorithm for Simon's problem. Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems (ISTCS), July 1997. e-print quant-ph/9704027.
61. G. Brassard, P. Hoyer, A. Tapp. Quantum Counting, volume 1443 of Lecture Notes in Computer Science, pages 820-831. Springer, July 1998. Proceedings of the 25th International Colloquium on Automata, Languages, and Programming, e-print quant-ph/9805082.
62. G. Brassard, P. Hoyer, M. Mosca, A. Tapp. Quantum amplitude amplification and estimation. Quantum Computation & Quantum Information Science, AMS Contemporary Math Series, 2000. e-print quant-ph/0005055.
63. G. Constantini, F. Smeraldi. A generalization of Deutsch's example. 1997. e-print quant-ph/9702020.
64. G. Jeney, S. Imre, L. Pap, A. Engelhart, T. Dogan, W. G. Teich. Comparison of different multiuser detectors based on recurrent neural networks. COST 262 Workshop on Multiuser Detection in Spread Spectrum Communication, Schloss Reisensburg, Germany, pages 61-70, January 2001.
65. G. L. Long, C. C. Tu, Y. S. Li, W. L. Zang and L. Niu. A novel so(3) picture for quantum searching. 1999. e-print quant-ph/9911004.
66. G. L. Long, L. Xiao, Y. Sun. General phase matching condition for quantum searching. 2001. e-print quant-ph/0107013.
67. G. L. Long, Y. S. Li, W. L. Zang, L. Niu. Phase matching in quantum searching. Phys. Lett. A, 262:27-34, 1999. e-print quant-ph/9906020.
68. L. K. Grover. Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett., 79(2):325-328, July 1997. e-print quant-ph/9706033.
69. L. K. Grover. Quantum computers can search rapidly by using almost any transformation. Phys. Rev. Lett, 80(19):4329-4332, 1998. e-print quantph/9712011.
70. L. K. Grover. A fast quantum mechanical algorithm for database search. Proceedings, 28th Annual ACMSymposium on the Theory of Computing, pages 212-219, May 1996. e-print quant-ph/9605043.
71. L. K. Grover. Tradeoffs in the quantum search algorithm. 2002. e-print quantph/0201152.
72. H. Bechmann-Pasquinucci, N. Gisin. Incoherent and coherent eavesdropping in the 6-state protocol of quantum cryptography. Phys. Rev. A, 59:4238-4248, 1999. e-print quant-ph/9807041.
73. F. Hillebrand, editor. GSM and UMTS: The Creation of Global Mobile Communication. Wiley & Sons, 2002.
74. P. Hoyer. Arbitrary phases in quantum amplitude amplification. Phys. Lett. A, 62(052304), 2000. e-print quant-ph/0006031.
75. http://www.cipherwar.com/news/01/dera satellites.htm.
76. http://www.gapoptique.unige.ch.
77. http://www.idQuantique.com.
78. http://www.magiqtech.com/products/index.php.
79. http://www.mysteriesmegasite.com/main/bigsearch/teleportation.html.
80. http://www.qubit.org/library/intros/gmn/gmn.html.
81. I. L. Chuang, N. Gershenfeld, M. Kubinec. Experimental implementation of fast quantum searching. Phys. Rev. Lett., 18(15):3408-3411, 1998. e-print http://feynman.media.mit.edu/ike/homepage/papers/QC-chuanggershenfeld-kubin ec-nmrqc-grover-alg-prl-13apr98.pdf.
82. J. A. Jones, M. Mosca. Implementation of a quantum algorithm to solve Deutsch's problem on a nuclear magnetic resonance quantum computer. Journal of Chemical Physics, 109(5):1648-1653, August 1998. e-print quantph/9801027.
83. J. F. Clauser, M. A. Horne, A. Shimony, R. A. Holt. Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett., 23:880-884, 1969.
84. J. Garriga, A. Vilenkin. Many worlds in one. Phys. Rev. D., 64(043511):043511, 2001. e-print arXiv.org/abs/gr-qc/0102010.
85. J. Siewert, R. Fazio. Implementation of the Deutsch-Jozsa algorithm with Josephson charge qbits. J. of Mod. Opt., 90, 2002. e-print quant-ph/0112135.
86. J. W. Cooley, J. Tukey. An algorithm for the machine calculation of complex Fourier series. Mathematics for Computation, 19(90):297-301, 1965.
87. J-Y. Hsieh, C-M. Li. A general su(2) formulation for quantum searching with certainty. Phys. Rev. A, 65(052322), 2002. e-print quant-ph/0112035.
88. J. A. Jones, M. Mosca, R. H. Hansen. Implementation of a quantum search algorithm on a nuclear magnetic resonance quantum computer. Nature, (393):344-346, 1998. e-print quant-ph/9805069.
89. R. Jozsa. Quantum algorithms and the Fourier transform. Proc. Roy. Soc. London Ser. A, 454:323-337, July 1998. e-print quant-ph/9707033.
90. K. Dorai, D. Suter. Efficient implementations of the quantum Fourier transform: An experimental perspective. 2002. e-print quant-ph/0211030.
91. A. Yu. Kitaev. Quantum measurements and the Abelian stabilizer problem. 1995. e-print quant-ph/9511026.
92. D. E. Knuth. The Art of Computer Programming, Vol. 3. (Sorting and searching). Addison-Wesley, 1973.
93. L. M. Duan, G. C. Guo. Probabilistic cloning and identification of linearly independent quantum states. Phys. Rev. Lett., 80:4999-5002, 1998. e-print quant-ph/9804064.
94. F. M. Lev. An integral version of Shor's factoring algorithm. 2001. e-print quant-ph/0109103.
95. L. F. Wei, F. Nori. Quantum phase estimation algorithms with delays: How to avoid dynamical phase errors. 2003. e-print quant-ph/0305038.
96. L. F. Wei, X. Li, X. Hu, F. Nori. Phase-matching approach to eliminate the dynamical phase error in Shor's factoring algorithm. 2003. e-print quantph/0305039.
97. L. M. K. Vandersypen, M. Steffen, G. Breyta, C. S. Yanonni,M. H. Sherwood, I. L. Chuang. Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance. Nature, (414):883-887, December 2001. e-print quant-ph/0112176.
98. L. M. K. Vandersypen, M. Steffen, G. Breyta, C. S. Yanonni, R. Cleve, I. L. Chuang. Experimental realization of an order-finding algorithm with an NMR quantum computer. Phys. Rev. Lett, 85(25):5452-5455, December 2000. e-print quant-ph/0007017.
99. G. L. Long. Grover algorithm with zero theoretical failure rate. Phys. Rev. A, 64(022307), 2001. e-print quant-ph/0106071.
100. L. R. Hales. The Quantum Fourier Transform and Extensions of the Abelian Hidden Subgroup Problem. PhD Thesis, University of California at Berkeley, 2002. e-print quant-ph/0212002.
101. W.W. Lu. BroadbandWireless Mobile: 3G and Beyond. J.Wiley & Sons, 2002.
102. E. Knill, M. A. Nielsen, R. Laamme. Complete quantum teleportation using nuclear magnetic resonance. Nature, 396:52-55, 1998.
103. M. Ban, K. Kurukowa, R. Momose, O. Hirota. Optimum measurements for discrimination among symmetric quantum states and parameter estimation. Int. J. Theor. Phys., 36:1269-1288, 1997.
104. M. Boyer, G. Brassard, P. Hoyer, A. Tapp. Tight bounds on quantum searching. Proceedings 4thWorkshop on Physics and Computation, 46(4-5):36-43, 1996. Also in Fortschritte der Physik, Vol. 46, No. 4-5, 1998, pp. 493-505 quantph/9605034.
105. M. Clarke, R. B. M. A. Chefles, S. M. Barnett, E. Riis. Experimental demonstration of optimal unambiguous state discrimination. Phys. Rev. A, 63:040305, 2001. e-print quant-ph/0007063.
106. M. Dušek, V. Bužek. Quantum multimeters: A programmable state discriminator. Phys. Rev. A., 66(1-5):022112, 2002. e-print quant-ph/0201097.
107. M. Mosca, A. Ekert. The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer, volume 1509 of Lecture Notes in Computer Science, pages 174-188. Springer, 1998. e-print quant-ph/9903071.
108. M. Mosca, C. Zalka. Exact quantum Fourier transforms and discrete logarithms. 2003. e-print quant-ph/0301093.
109. M. Varnashi, B. Aazhang. Multistage detection for asynchronous code-division multiple access communication. IEEE Trans. on Communication, 38(4):509-519, April 1990.
110. J. Mullins. Making unbreakable code. IEEE Spectrum, 39(5):40-45, 2002.
111. N. Alon, V. Gurushwami, T. Kaufman, M. Sudan. Guessing secrets efficiently via list decoding. Proceedings of the 13th Annual ACM-SIAM SODA, pages 254-262, 2002. e-print http://www.math.tau.ac.il/~nogaa/PDFS/guessproc2.pdf.
112. N. Bhattacharya, H. B. van Linden van den Heuvell, R. J. C. Spreeuw. Implementation of quantum search algorithm using classical Fourier optics. Phys. Rev. Lett., 88(137901), 2002. e-print quant-ph/0110034v3.
113. N. Gisin, G. Ribordy, W. Tittel, H. Zbinden. Quantum cryptography. 2001. e-print quant-ph/0101098.
114. M. Nathanson. Quantum guessing via Deutsch-Jozsa. 2003. e-print quantph/0301025.
115. M. A. Nielsen. Rules for a complex quantum world. Scientific American, 287(5):49-57, 2002.
116. P. Hausladen, R. Jozsa, M. Westmoreland, W. K. Wooters. Classical information capacity of a quantum channel. Phys. Rev. A., 54:1869-1876, 1996.
117. P. Hausladen, W. K. Wooters. A 'pretty good' measurement for distingushing quantum states. J. Mod. Opt., 41:2385-2390, 1994.
118. J. D. Parsons. The Mobile Radio Propagation Channel. J. Wiley & Sons, 2nd edition, 2001.
119. A. Peres. How to differentiate between two non-orthogonal states. Phys. Lett. A, 128(19), 1988.
120. A. Peres. Neumark's theorem and quantum inseparability. Found. Phys., 20(12):1441-1453, 2000.
121. I. Peterson. Guessing secrets - applying mathematics to the efficient delivery of Internet content. Science News, 161(14):216, 2002. e-print http://63.240.200.111/articles/20020406/bob8.asp.
122. P. W. Shor. Algorithms for quantum computation: Discrete logarithms and factoring. Proc. 35th Annual Symposium on Foundations of Computer Science, Santa Fe, pages 124-134, November 20-22 1994.
123. R. B. Griffiths, C. S. Niu. Semiclassical Fourier transform for quantum computation. Phys. Rev. Lett., 76(17):3228-3231, 1996. e-print quantph/9511007.
124. R. Cleve, A. Ekert, C. Macciavello, M. Mosca. Quantum algorithms revisited. Proc. R. Soc. London, Ser. A, 454:339-354, 1998. e-print quant-ph/9708016.
125. R. Cleve, J. Watrous. Fast parallel circuits for the quantum Fourier transform. 2000. e-print quant-ph/0006004.
126. R. J. Hughes, J. E. Nordholt, D. Derkacs, C. G. Peterson. Practical free-space quantum key distribution over 10 km in daylight and at night. New Journal of Physics, 43(4), 2002. e-print quant-ph/0206092.
127. R. L. Rivest, A. Shamir, L. M. Adlemann. New directions in cryptography. IEEE Transactions on Information Theory, 22:644-654, 1976.
128. R. L. Rivest, A. Shamir, L. M. Adlemann. A method of obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21:120-126, 1978.
129. S.-I. Amari, A. Cichocki. Adaptive blind signal processing-neural network approaches. Proc. IEEE, 86(10), October 1998.
130. S. Imre, F. Balázs. Positive operation valued measurement based multiuser detection in DS-CDMA systems. IX. Int. Conference on Software Telecommunications and Computer Networks (SoftCOM'01), 1:421-429, October 09-12 2001. e-print quant-ph/0201039.
131. S. Imre, F. Balázs. Non-coherentmulti-user detection based on quantumsearch. IEEE International Conference on Communication (ICC), New York, USA, April 28 - May 2 2002.
132. S. Imre, F. Balázs. Performance evaluation of quantum based multi-user detector. IEEE International Symposium on Spread Spectrum Techniques and Applications (ISSTA'02), pages 722-725, September 2-5 2002.
133. S. Imre, F. Balázs. A tight bound for probability of error for quantum counting based multiuser detection. IEEE International Symposium on Information Theory (ISIT'02), page 43, June 30 - July 5 2002. e-print quant-ph/0205138.
134. S. J. Lomonaco JR, L. H. Kauffman. A continuous variable Shor algorithm. 2002. e-print quant-ph/0210141.
135. E. Schrödinger. Die gegenwartige situation in der quantenmechanik. Naturwissenschaftern., 23:807-812; 823-823, 844-849, 1935.
136. John D. Trimmer, Proceedings of the American Philosophical Society, 124:323-38 (1980), Reprinted in Quantum Theory and Measurement, p. 152 (1983).
137. C. E. Shannon. Communication theory of secrecy systems. Bell System Technical Journal, 28:656-715, 1949.
138. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484-1509, October 1997. e-print quant-ph/9508027.
139. P. W. Shor. Quantum computing. Documenta Mathematica, 1998. Extra Volume ICM 1998.
140. P. W. Shor. Introduction to quantum algorithms. AMS PSAPM, 58:143-159, May 2002. e-print quant-ph/0005003.
141. D. R. Simon. On the power of quantum computation. Proceedings of the 35th Annual IEEE Symposium on the Foundations of Computer Science, pages 116-123, 1994. Also in SIAM Journal on Computing, 26:1474-1483.
142. S. L. Braunstein, H. J. Kimble. A posteriori teleportation. Nature 394:840-841, 1998. e-print http://www-users.cs.york.ac.uk/~schmuel/papers/bkB98.pdf.
143. S. L. Braunstein, H. J. Kimble. Teleportation of continuous quantum variables. Phys. Rev. Lett., 80:869-872, 1998. e-print http://wwwusers. cs.york.ac.uk/~schmuel/papers/bk98.pdf.
144. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein. Introduction to Algorithms. The MIT Press/McGraw Hill, 4th edition, 2003.
145. K. Tachikawa, editor. W-CDMA Mobile Communications System. J. Wiley & Sons, 2002.
146. M. Tegmark. Parallel universes. Scientific American, 288(5):30-41, 2003.
147. S. Verdu. Multiuser Detection. Cambridge University Press, 1998.
148. G. Vermes. The Dead Sea Scrolls. Penguin USA, 1998.
149. G. S. Vernam. Cipher printing telegraph systems for secret wire and radio telegraphic communications. Journal of American Institute of Electrical Engineers, 45:109-115, 1926.
150. I. V. Volovich. Quantum computing and Shor's factoring algorithm. 2001. e-print quant-ph/0109004.
151. W. T. Buttler, R. J. Hughes, P. G. Kwiat, S. K. Lamoreaux, G. G. Luther, G. L. Morgan, J. E. Nordholt, C. G. Peterson, C. Simmons. Practical free-space quantum key distribution over 1 km. Phys. Rev. Lett., 81:3283-3286, 1998. e-print quant-ph/9805071.
152. W. Tittel, J. Brendel, H. Zbinden, N. Gisin. Violation of Bell inequalities by photons more than 10 km apart. Phys. Rev. Lett., 81:3563-3566, 1998. e-print quant-ph/9806043.
153. www.research.ibm.com/quantuminfo/teleportation/.
154. Y. C. Eldar, A. V. Oppenheim. Quantum signal processing. IEEE Signal Processing, 19(6):12-32, 2002.
155. Y. C. Eldar, G. D. Forney. On quantum detection and the square-root measurement. IEEE Trans. Inform. Theory, 47(3):858-872, 2001. e-print quant-ph/0005132.
156. Y. H. Shih, C. O. Alley. Phys. Rev. Lett., p. 2921.
157. Y. S. Weinstein, S. Lloyd, D. G. Cory. Implementation of the quantum Fourier transform. Phys. Rev. Lett., 86:1889-1891, 2001. e-print quant-ph/9906059.
158. Z. Y. Ou, L. Mandel. Violation of Bell's inequality and classical probability in a two-photon correlation experiment.Phys. Rev. Lett., 61:50-53, 1988.
159. C. Zalka. Fast versions of Shor's quantum factoring algorithm. 1998. e-print quant-ph/9806084.
160. C. Zalka. Simulating quantum systems on a quantum computer. Phys. Rev. A., 454:313-322, 1998.
161. C. Zalka. Grover's quantum searching algorithm is optimal. e-print quantph/9711070v2, 1999.