{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T21:40:18Z","timestamp":1737582018329,"version":"3.33.0"},"publisher-location":"Dordrecht","reference-count":76,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9781402056895"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-1-4020-5690-1_3","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T02:56:17Z","timestamp":1195872977000},"page":"43-62","source":"Crossref","is-referenced-by-count":0,"title":["Quantum Computation and Information"],"prefix":"10.1007","author":[{"given":"Am\u00edlcar","family":"Sernadas","sequence":"first","affiliation":[]},{"given":"Paulo","family":"Mateus","sequence":"additional","affiliation":[]},{"given":"Yasser","family":"Omar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"Abadi M, Gordon AD. \u201cA calculus for cryptographic protocols: The Spi Calculus\u201d, Information and Computation, vol. 148 no. 1, pp. 1\u201370, 1999. Full version available as SRC Research Report 149, January 1998.","journal-title":"Information and Computation"},{"key":"3_CR2","unstructured":"Ad\u00e3o P, Bana G, Herzog J, Scedrov A. \u201cSoundness and completeness of formal encryption: The cases of key-cycles and partial information leakage\u201d, Preprint, CLC, Department of Mathematics, Instituto Superior T\u00e9cnico, 1049-001 Lisboa, Portugal, 2005. Submitted for publication."},{"key":"3_CR3","unstructured":"Ad\u00e3o P, Bana G, Herzog J, Scedrov A. \u201cSoundness of formal encryption in the presence of key-cycles\u201d, S. D. C. di Vimercati, P. Syverson, and D. Gollmann (eds.), Proceedings of the 10th European Symposium on Research in Computer Security (ESORICS), vol. 3679 of Lecture Notes in Computer Science, Springer-Verlag, 2005, pp. 374\u2013396."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Ad\u00e3o P, Bana G, Scedrov A. \u201cComputational and information-theoretic soundness and completeness of formal encryption\u201d, Proceedings of the 18th IEEE Computer Security Foundations Workshop (CSFW), IEEE Computer Society Press, 2005, pp. 170\u2013184.","DOI":"10.1109\/CSFW.2005.13"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Ad\u00e3o P, Fournet C. \u201cCryptographically sound implementations for communicating processes\u201d, Preprint, CLC, Department of Mathematics, Instituto Superior T\u00e9cnico, 1049-001 Lisboa, Portugal, 2006. Submitted for publication.","DOI":"10.1007\/11787006_8"},{"key":"3_CR6","unstructured":"Ad\u00e3o P, Mateus P. \u201cA process algebra for reasoning about quantum security\u201d, Electronic Notes in Theoretical Computer Science, to appear. Preliminary version presented at 3rd International Workshop on Quantum Programming Languages, June 30\u2013July 1, 2005, Chicago, Affiliated Workshop of LICS 2005."},{"key":"3_CR7","unstructured":"Ad\u00e3o P, Mateus P, Reis T, Vigan\u00f2 L. \u201cTowards a quantitave analysis of security protocols\u201d, Preprint, CLC, Department of Mathematics, Instituto Superior T\u00e9cnico, 1049-001 Lisboa, Portugal, 2006. Submitted for publication."},{"issue":"2","key":"3_CR8","doi-asserted-by":"crossref","first-page":"781","DOI":"10.4007\/annals.2004.160.781","volume":"160","author":"M. Agrawal","year":"2004","unstructured":"Agrawal M, Kayal N, Saxena N. \u201cPRIMES is in P\u201d, Annals of Mathematics, vol. 160 no. 2, pp. 781\u2013793, 2004.","journal-title":"Annals of Mathematics"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Aharonov D, van Dam W, Kempe J, Landau Z, Lloyd S, Regev O. \u201cAdiabatic quantum computation is equivalent to standard quantum computation\u201d, FOCS\u2019 04: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201904), IEEE Computer Society, 2004, pp. 42\u201351.","DOI":"10.1109\/FOCS.2004.8"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1103\/PhysRevLett.47.460","volume":"47","author":"A. Aspect","year":"1981","unstructured":"Aspect A, Grangier P, Roger G. \u201cExperimental tests of realistic local theories via Bell\u2019s theorem\u201d, Physical Review Letters, vol. 47, pp. 460, 1981.","journal-title":"Physical Review Letters"},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1103\/PhysicsPhysiqueFizika.1.195","volume":"1","author":"JS. \u201c. Bell","year":"1964","unstructured":"Bell JS. \u201cOn the Einstein-Podolsky-Rosen paradox\u201d, Physics, vol. 1, pp.195, 1964.","journal-title":"Physics"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/BF01011339","volume":"22","author":"P. \u201c. Benioff","year":"1980","unstructured":"Benioff P. \u201cThe computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines\u201d, Journal of Statistical Physics, vol. 22, pp.563\u2013591, 1980.","journal-title":"Journal of Statistical Physics"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1103\/PhysRevLett.48.1581","volume":"48","author":"P. \u201c. Benioff","year":"1982","unstructured":"Benioff P. \u201cQuantum mechanical models of Turing machines that dissipate no energy\u201d, Physical Review Letters, vol. 48, pp.1581\u20131585, 1982.","journal-title":"Physical Review Letters"},{"key":"3_CR14","unstructured":"Bennett CH, Brassard G. \u201cQuantum cryptography: Public key distribution and coin tossing\u201d, Proceedings of IEEE international Conference on Computers, Systems and Signal Processing, IEEE Press, 1984, pp.175\u2013179."},{"issue":"13","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.1103\/PhysRevLett.70.1895","volume":"70","author":"C.H. Bennett","year":"1993","unstructured":"Bennett CH, Brassard G, Cr\u00e9peau C, Jozsa R, Peres A, Wootters W. \u201cTeleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels\u201d, Physical Review Letters, vol. 70 no. 13, pp.1895\u20131899, 1993.","journal-title":"Physical Review Letters"},{"issue":"20","key":"3_CR16","doi-asserted-by":"publisher","first-page":"2881","DOI":"10.1103\/PhysRevLett.69.2881","volume":"69","author":"C.H. Bennett","year":"1992","unstructured":"Bennett CH, Wiesner SJ. \u201cCommunication via one-and two-particle operators on Einstein-Podolsky-Rosen states\u201d, Physical Review Letters, vol. 69 no. 20, pp.2881\u20132884, 1992.","journal-title":"Physical Review Letters"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"823","DOI":"10.2307\/1968621","volume":"37","author":"G. Birkhoff","year":"1936","unstructured":"Birkhoff G, von Neumann J. \u201cThe logic of quantum mechanics\u201d, Annals of Mathematics, vol. 37 no. 4, pp.823\u2013843, 1936.","journal-title":"Annals of Mathematics"},{"issue":"1\u20135","key":"3_CR18","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M. Boyer","year":"1998","unstructured":"Boyer M, Brassard G, H\u00f8yer P, Tapp A. \u201cTight bounds on quantum searching\u201d, Fortschritte der Physik, vol. 46 no. 1\u20135, pp.493\u2013505, 1998.","journal-title":"Fortschritte der Physik"},{"key":"3_CR19","unstructured":"Caleiro C, Mateus P, Sernadas A, Sernadas C. \u201cQuantum institutions\u201d, Preprint, CLC, Department of Mathematics, Instituto Superior T\u00e9cnico, 1049-001 Lisboa, Portugal, 2005. Submitted for publication."},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2005.06.007","volume":"135","author":"C. Caleiro","year":"2005","unstructured":"Caleiro C, Vigan\u00f2 L, Basin D. \u201cDeconstructing Alice and Bob\u201d, Electronic Notes in Theoretical Computer Science, vol. 135 no. 1, pp.3\u201322, 2005. Preliminary version presented at ICALP\u201905 ARSPA Workshop.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.entcs.2004.05.020","volume":"125","author":"C. Caleiro","year":"2005","unstructured":"Caleiro C, Vigan\u00f2 L, Basin D. \u201cMetareasoning about security protocols using distributed temporal logic\u201d, Electronic Notes in Theoretical Computer Science, vol. 125 no. 1, pp.67\u201389, 2005. Preliminary version presented at IJCAR\u201904 ARSPA Workshop.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"3_CR22","unstructured":"Caleiro C, Vigan\u00f2 L, Basin D. \u201cOn the expresiveness of a message sequence formalism for security protocols\u201d, Preprint, CLC, Department of Mathematics, Instituto Superior T\u00e9cnico, 1049-001 Lisboa, Portugal, 2005. Submitted for publication."},{"issue":"6","key":"3_CR23","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1093\/jigpal\/jzi048","volume":"13","author":"C. Caleiro","year":"2005","unstructured":"Caleiro C, Vigan\u00f2 L, Basin D. \u201cRelating strand spaces and distributed temporal logic for security protocol analysis\u201d, Logic Journal of the IGPL, vol. 13 no. 6, pp.637\u2013664, 2005.","journal-title":"Logic Journal of the IGPL"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Canetti R. \u201cUniversally composable security: A new paradigm for cryptographic protocols\u201d, 42nd IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, 2001, pp.136\u2013145. Full version available at IACR ePrint Archive, Report 2000\/067.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Chadha R, Mateus P, Sernadas A. \u201cReasoning about states of probabilistic sequential programs\u201d, Preprint, CLC, Department of Mathematics, Instituto Superior T\u00e9cnico, 1049-001 Lisboa, Portugal, 2006. Submitted for publication.","DOI":"10.1007\/11874683_16"},{"key":"3_CR26","unstructured":"Chadha R, Mateus P, Sernadas A, Sernadas C. \u201cExtending classical logic for reasoning about quantum systems\u201d, Preprint, CLC, Department of Mathematics, Instituto Superior T\u00e9cnico, 1049-001 Lisboa, Portugal, 2005. Submitted for publication."},{"key":"3_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-0526-4","volume-title":"Reasoning in Quantum Theory","author":"M.L.D. Chiara","year":"2004","unstructured":"Chiara MLD, Giuntini R, Greechie R. Reasoning in Quantum Theory, Dordrecht, The Netherlands, Kluwer Academic Publishers, 2004."},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Childs AM, Cleve R, Deotto E, Farhi E, Gutmann S, Spielman DA. \u201cExponential algorithmic speedup by a quantum walk\u201d, STOC\u201903: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, ACM Press, 2003, pp.59\u201368.","DOI":"10.1145\/780542.780552"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Cook SA. \u201cThe complexity of theorem-proving procedures\u201d, STOC\u201971: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, ACM Press, 1971, pp.151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","volume":"7","author":"S.A. Cook","year":"1973","unstructured":"Cook SA, Reckhow RA. \u201cTime bounded random access machines\u201d, Journal of Computer and System Sciences, vol. 7 no. 4, pp.354\u2013375, 1973.","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR31","unstructured":"Costa Jr AT, Bose S, Omar Y. \u201cEntanglement of two impurities through electron scattering\u201d, Preprint, CFP, Department of Physics, Instituto Superior T\u00e9cnico, 1049-001 Lisboa, Portugal, 2005. Submitted for publication."},{"key":"3_CR32","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"400","author":"D. \u201c. Deutsch","year":"1985","unstructured":"Deutsch D. \u201cQuantum theory, the Church-Turing principle and the universal quantum computer\u201d, Proceedings of the Royal Society of London A, vol. 400, pp.97\u2013117, 1985.","journal-title":"Proceedings of the Royal Society of London A"},{"key":"3_CR33","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/TIT.2004.839515","volume":"51","author":"I. \u201c. Devetak","year":"2005","unstructured":"Devetak I. \u201cThe private classical capacity and quantum capacity of a quantum channel\u201d, IEEE Transactions on Information Theory, vol. 51, pp.44\u201355, 2005.","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR34","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1103\/PhysRevA.51.1015","volume":"51","author":"DP. \u201c. DiVincenzo","year":"1995","unstructured":"DiVincenzo DP. \u201cTwo-bit gates are universal for quantum computation\u201d, Physical Review A, vol. 51, pp.1015\u20131022, 1995.","journal-title":"Physical Review A"},{"issue":"6","key":"3_CR35","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1103\/PhysRevLett.67.661","volume":"67","author":"AK. \u201c. Ekert","year":"1991","unstructured":"Ekert AK. \u201cQuantum cryptography based on Bell\u2019s theorem\u201d, Physical Review Letters, vol. 67 no. 6, pp.661\u2013663, 1991.","journal-title":"Physical Review Letters"},{"key":"3_CR36","unstructured":"Farhi E, Goldstone J, Gutmann S, Sipser M. \u201cQuantum computation by adiabatic evolution\u201d, Technical Report quant-ph\/0001106, ArXiv, USA, 2000."},{"key":"3_CR37","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"RP. \u201c. Feynman","year":"1982","unstructured":"Feynman RP. \u201cSimulating Physics with computers\u201d, International Journal of Theoretical Physics, vol. 21, pp.467, 1982.","journal-title":"International Journal of Theoretical Physics"},{"key":"3_CR38","first-page":"1","volume":"7","author":"DJ. \u201c. Foulis","year":"1999","unstructured":"Foulis DJ. \u201cA half-century of quantum logic. What have we learned?\u201d, Quantum Structures and the Nature of Reality, vol. 7 of Einstein Meets Magritte, Kluwer Acad. Publ., 1999, pp.1\u201336.","journal-title":"Quantum Structures and the Nature of Reality"},{"issue":"19","key":"3_CR39","doi-asserted-by":"publisher","first-page":"3762","DOI":"10.1063\/1.1738173","volume":"84","author":"C. Gobby","year":"2004","unstructured":"Gobby C, Yuan ZL, Shields AJ. \u201cQuantum key distribution over 122 km of standard telecom fiber\u201d, Applied Physics Letters, vol. 84 no. 19, pp.3762\u20133764, 2004.","journal-title":"Applied Physics Letters"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"Grover LK. \u201cA fast quantum mechanical algorithm for database search\u201d, STOC\u201996: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, ACM Press, 1996, pp.212\u2013219.","DOI":"10.1145\/237814.237866"},{"issue":"2","key":"3_CR41","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"LK. \u201c. Grover","year":"1997","unstructured":"Grover LK. \u201cQuantum mechanics helps in searching for a needle in a haystack\u201d, Physical Review Letters, vol. 79 no. 2, pp.325\u2013328, 1997.","journal-title":"Physical Review Letters"},{"key":"3_CR42","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1038\/nature04279","volume":"438","author":"H. H\u00e4ffner","year":"2005","unstructured":"H\u00e4ffner H, H\u00e4nsel W, Roos CF, Benhelm J, Chekalkar D, Chwalla M, K\u00f6rber T, Rapol UD, Riebe M, Schmidt PO, Becher C, G\u00fchne O, D\u00fcr W, Blatt R. \u201cScalable multiparticle entanglement of trapped ions\u201d, Nature, vol. 438, pp.643\u2013646, 2005.","journal-title":"Nature"},{"key":"3_CR43","doi-asserted-by":"crossref","unstructured":"Hallgren S. \u201cPolynomial-time quantum algorithms for Pell\u2019s equation and the principal ideal problem\u201d, STOC\u201902: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, ACM Press, 2002, pp.653\u2013658.","DOI":"10.1145\/509907.510001"},{"key":"3_CR44","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0004-3702(90)90019-V","volume":"46","author":"JY. \u201c. Halpern","year":"1990","unstructured":"Halpern JY. \u201cAn analysis of first-order logics of probability\u201d, Artificial Intelligence, vol. 46, pp.311\u2013350, 1990.","journal-title":"Artificial Intelligence"},{"key":"3_CR45","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"6","author":"H. Hansson","year":"1995","unstructured":"Hansson H, Jonsson B. \u201cA logic for reasoning about time and reliability\u201d, Formal Aspects of Computing, vol. 6, pp.512\u2013535, 1995.","journal-title":"Formal Aspects of Computing"},{"key":"3_CR46","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1109\/18.651037","volume":"44","author":"AS. \u201c. Holevo","year":"1998","unstructured":"Holevo AS. \u201cThe capacity of quantum channel with general signal states\u201d, IEEE Transactions on Information Theory, vol. 44, pp.269, 1998.","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR47","series-title":"Technical Report","doi-asserted-by":"crossref","DOI":"10.2172\/366453","volume-title":"Conventions for quantum pseudocode","author":"E. \u201c. Knill","year":"1996","unstructured":"Knill E. \u201cConventions for quantum pseudocode\u201d, Technical Report LAUR-96-2724, Los Alamos National Laboratory, Los Alamos, USA, 1996."},{"key":"3_CR48","unstructured":"Mateus P, Mitchell J, Scedrov A. \u201cComposition of cryptographic protocols in a probabilistic polynomial-time process calculus\u201d, R. Amadio and D. Lugiez (eds.), CONCUR 2003 \u2014 Concurrency Theory, vol. 2761 of Lecture Notes in Computer Science, Springer, 2003, pp.327\u2013349."},{"key":"3_CR49","unstructured":"Mateus P, Omar Y. \u201cQuantum pattern matching\u201d, Preprint, CLC, Department of Mathematics, Instituto Superior T\u00e9cnico, 1049-001 Lisboa, Portugal, 2005. ArXiv quantph\/0508237. Full version of [50]."},{"key":"3_CR50","unstructured":"Mateus P, Omar Y. \u201cA quantum algorithm for closest pattern matching\u201d, D. Angelakis and M. Christandl (eds.), Proceedings of NATO ASI Quantum Computation and Information, IOS Press, in print. Short version of [49]."},{"key":"3_CR51","first-page":"141","volume-title":"Proceedings of CombLog\u201904, Workshop on Combination of Logics: Theory and Applications","author":"P. Mateus","year":"2004","unstructured":"Mateus P, Sernadas A. \u201cExogenous quantum logic\u201d, W. A. Carnielli, F. M. Dion\u00edsio, and P. Mateus (eds.), Proceedings of CombLog\u201904, Workshop on Combination of Logics: Theory and Applications, Departamento de Matem\u00e1tica, Instituto Superior T\u00e9cnico, Lisboa, 2004, pp.141\u2013149. Extended abstract."},{"key":"3_CR52","unstructured":"Mateus P, Sernadas A. \u201cReasoning about quantum systems\u201d, J. Alferes and J. Leite (eds.), Logics in Artificial Intelligence, Ninth European Conference, JELIA\u201904, vol. 3229 of Lecture Notes in Artificial Intelligence, Springer-Verlag, 2004, pp.239\u2013251."},{"key":"3_CR53","unstructured":"Mateus P, Sernadas A. \u201cComplete exogenous quantum propositional logic\u201d, Technical report, CLC, Department of Mathematics, Instituto Superior T\u00e9cnico, 1049-001 Lisboa, Portugal, 2005. Extended abstract. Short presentation at LICS 2005, Chicago, USA, June 26\u201329."},{"key":"3_CR54","unstructured":"Mateus P, Sernadas A. \u201cWeakly complete axiomatization of exogenous quantum propositional logic\u201d, Information and Computation, in print. ArXiv math.LO\/0503453."},{"key":"3_CR55","unstructured":"Mateus P, Sernadas A, Sernadas C. \u201cExogenous semantics approach to enriching logics\u201d, G. Sica (ed.), Essays on the Foundations of Mathematics and Logic, vol. 1 of Advanced Studies in Mathematics and Logic, Polimetrica, 2005, pp.165\u2013194."},{"key":"3_CR56","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1571-0661(04)80968-X","volume":"45","author":"J. Mitchell","year":"2001","unstructured":"Mitchell J, Ramanathan A, Scedrov A, Teague V. \u201cA probabilistic polynomial-time calculus for analysis of cryptographic protocols (Preliminary Report)\u201d, Electronic Notes in Theoretical Computer Science, vol. 45, pp.1\u201331, 2001.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"1\u20132","key":"3_CR57","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0304-3975(98)00191-1","volume":"237","author":"C. Moore","year":"2000","unstructured":"Moore C, Crutchfield JP. \u201cQuantum automata and quantum grammars\u201d, Theoretical Computer Science, vol. 237 no. 1\u20132, pp.275\u2013306, 2000.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"3_CR58","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. \u201c. Navarro","year":"2001","unstructured":"Navarro G. \u201cA guided tour to approximate string matching\u201d, ACM Computing Surveys, vol. 33 no. 1, pp.31\u201388, 2001.","journal-title":"ACM Computing Surveys"},{"key":"3_CR59","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen MA, Chuang IL. Quantum Computation and Quantum Information, Cambridge, UK, Cambridge University Press, 2000."},{"key":"3_CR60","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1080\/00107510500361274","volume":"46","author":"Y. \u201c. Omar","year":"2005","unstructured":"Omar Y. \u201cIndistinguishable particles in quantum mechanics: An introduction\u201d, Contemporary Physics, vol. 46, pp.437\u2013448, 2005.","journal-title":"Contemporary Physics"},{"issue":"1","key":"3_CR61","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1142\/S021974990500075X","volume":"3","author":"Y. \u201c. Omar","year":"2005","unstructured":"Omar Y. \u201cParticle statistics in quantum information processing\u201d, International Journal of Quantum Information, vol. 3 no. 1, pp.201\u2013205, 2005.","journal-title":"International Journal of Quantum Information"},{"key":"3_CR62","unstructured":"Omar Y, Paunkovic N, Sheridan L, Bose S. \u201cQuantum walk on a line with two entangled particles\u201d, Preprint, CFP, Department of Physics, Instituto Superior T\u00e9cnico, 1049-001 Lisboa, Portugal, 2004. Submitted for publication."},{"issue":"22","key":"3_CR63","doi-asserted-by":"publisher","first-page":"5188","DOI":"10.1103\/PhysRevLett.86.5188","volume":"86","author":"R. Raussendorf","year":"2001","unstructured":"Raussendorf R, Briegel HJ. \u201cA one-way quantum computer\u201d, Physical Review Letters, vol. 86 no. 22, pp.5188\u20135191, 2001.","journal-title":"Physical Review Letters"},{"key":"3_CR64","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/BF01491891","volume":"23","author":"E. \u201c. Schr\u00f6dinger","year":"1935","unstructured":"Schr\u00f6dinger E. \u201cDie gegenwartige Situation in der Quantenmechanik\u201d, Naturwissenschaften, vol. 23, pp.807\u2013812, 823\u2013823, 844\u2013849, 1935. English translation: John D Trimmer, Proceedings of the American Philosophical Society, 124, 323\u201338 (1980), Reprinted in Quantum Theory and Measurement, p. 152 (1983).","journal-title":"Naturwissenschaften"},{"key":"3_CR65","doi-asserted-by":"publisher","first-page":"2738","DOI":"10.1103\/PhysRevA.51.2738","volume":"51","author":"B. \u201c. Schumacher","year":"1995","unstructured":"Schumacher B. \u201cQuantum coding\u201d, Physical Review A, vol. 51, pp.2738\u20132747, 1995.","journal-title":"Physical Review A"},{"key":"3_CR66","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1103\/PhysRevA.56.131","volume":"56","author":"B. Schumacher","year":"1997","unstructured":"Schumacher B, Westmoreland M. \u201cSending classical information via noisy quantum channels\u201d, Physical Review A, vol. 56, pp.131\u2013138, 1997.","journal-title":"Physical Review A"},{"key":"3_CR67","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT. \u201c. Schwartz","year":"1980","unstructured":"Schwartz JT. \u201cFast probabilistic algorithms for verification of polynomial identities\u201d, Journal of the ACM, vol. 27 no. 4, pp.701\u2013717, 1980.","journal-title":"Journal of the ACM"},{"key":"3_CR68","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE. \u201c. Shannon","year":"1948","unstructured":"Shannon CE. \u201cA mathematical theory of communication\u201d, Bell System Technical Journal, vol. 27, pp.379, 623, 1948.","journal-title":"Bell System Technical Journal"},{"key":"3_CR69","doi-asserted-by":"crossref","unstructured":"Shor PW. \u201cAlgorithms for quantum computation: Discrete logarithms and factoring\u201d, S. Goldwasser (ed.), Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, IEEE Computer Society, 1994, pp.124\u2013134.","DOI":"10.1109\/SFCS.1994.365700"},{"key":"3_CR70","doi-asserted-by":"publisher","first-page":"R2493","DOI":"10.1103\/PhysRevA.52.R2493","volume":"52","author":"PW. \u201c. Shor","year":"1995","unstructured":"Shor PW. \u201cScheme for reducing decoherence in quantum computer memory\u201d, Physical Review A, vol. 52, pp.R2493, 1995.","journal-title":"Physical Review A"},{"issue":"5","key":"3_CR71","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW. \u201c. Shor","year":"1997","unstructured":"Shor PW. \u201cPolynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer\u201d, SIAM Journal on Computing, vol. 26 no. 5, pp.1484\u20131509, 1997. Presented at FOCS\u201994.","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"3_CR72","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1103\/PhysRevLett.77.793","volume":"77","author":"AM. \u201c. Steane","year":"1996","unstructured":"Steane AM. \u201cError correcting codes in quantum theory\u201d, Physical Review Letters, vol. 77 no. 5, pp.793\u2013797, 1996.","journal-title":"Physical Review Letters"},{"key":"3_CR73","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1038\/414883a","volume":"414","author":"L.M.K. Vandersypen","year":"2001","unstructured":"Vandersypen LMK, Steffen M, Breyta G, Yannoni CS, Sherwood MH, Chuang IL. \u201cExperimental realization of Shor\u2019s quantum factoring algorithm using nuclear magnetic resonance\u201d, Nature, vol. 414, pp.883\u2013887, 2001.","journal-title":"Nature"},{"issue":"1","key":"3_CR74","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S. \u201c. Wiesner","year":"1983","unstructured":"Wiesner S. \u201cConjugate coding\u201d, SIGACT News, vol. 15 no. 1, pp.78\u201388, 1983. Original manuscript written circa 1970.","journal-title":"SIGACT News"},{"key":"3_CR75","doi-asserted-by":"crossref","unstructured":"Yao AC. \u201cTheory and applications of trapdoor functions\u201d, 23rd IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society, 1982, pp.80\u201391.","DOI":"10.1109\/SFCS.1982.45"},{"key":"3_CR76","doi-asserted-by":"crossref","unstructured":"Zippel R. \u201cProbabilistic algorithms for sparse polynomials\u201d, EUROSAM\u2019 79: Proceedings of the International Symposiumon on Symbolic and Algebraic Computation, Springer-Verlag, 1979, pp.216\u2013226.","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["A Portrait of State-of-the-Art Research at the Technical University of Lisbon"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4020-5690-1_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T21:05:27Z","timestamp":1737579927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4020-5690-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9781402056895"],"references-count":76,"URL":"https:\/\/doi.org\/10.1007\/978-1-4020-5690-1_3","relation":{},"subject":[]}}