{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T03:10:25Z","timestamp":1736046625217,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291077"},{"type":"electronic","value":"9783540320722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560647_28","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:04:06Z","timestamp":1129817046000},"page":"424-438","source":"Crossref","is-referenced-by-count":1,"title":["A Logic for Quantum Circuits and Protocols"],"prefix":"10.1007","author":[{"given":"Manas","family":"Patra","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Coecke, B.: A categorical semantics of quantum protocols. Research Report RR-04-02, Oxford University Computing Laboratory (2004)","DOI":"10.1109\/LICS.2004.1319636"},{"issue":"1","key":"28_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0022-0000(86)90029-2","volume":"32","author":"M. Ben-Or","year":"1986","unstructured":"Ben-Or, M., Kozen, D., Reif, J.H.: The complexity of elementary algebra and geometry. Journal of Computer and System Sciences\u00a032(1), 251\u2013264 (1986)","journal-title":"Journal of Computer and System Sciences"},{"key":"28_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05355-3","volume-title":"Algorithms in real algebraic geometry","author":"S. Basu","year":"2003","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: Algorithms in real algebraic geometry. Springer, Heidelberg (2003)"},{"key":"28_CR4","unstructured":"Baltag, A., Smets, S.: A logic for quantum programs. In: Proc. of QPL 2004, pp. 39\u201356 (2004)"},{"issue":"5","key":"28_CR5","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E. Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U.V.: Quantum complexity theory. SIAM. J. Computing\u00a026(5), 1411\u20131473 (1997)","journal-title":"SIAM. J. Computing"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Canny, J.F.: Some algebraic and geometric computations in PSPACE. In: Proc.\u00a020th ACM Symp. on Theory of Computing, pp. 460\u2013467 (1988)","DOI":"10.1145\/62212.62257"},{"issue":"1","key":"28_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1142\/S0219749905000372","volume":"3","author":"M.L. Chiara Dalla","year":"2005","unstructured":"Dalla Chiara, M.L., Guntini, R., Leporoni, R.: Quantum computational logics and fock space semantics. Int. Journal of quantum information\u00a03(1), 9\u201316 (2005)","journal-title":"Int. Journal of quantum information"},{"issue":"1\/2","key":"28_CR8","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/0890-5401(90)90060-U","volume":"87","author":"R. Fagin","year":"1990","unstructured":"Fagin, R., Halpern, J.Y., Megiddo, N.: A logic for reasoning about probabilities. Information and Computation\u00a087(1\/2), 78\u2013128 (1990)","journal-title":"Information and Computation"},{"key":"28_CR9","first-page":"210","volume-title":"Proc. 28th. annual ACM symposium on Theory of computing","author":"L. Grover","year":"1996","unstructured":"Grover, L.: A fast quantum mechanical algorithm for database search. In: Proc. 28th. annual ACM symposium on Theory of computing, pp. 210\u2013212. ACM, New York (1996)"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Immerman, N.: Descriptive and computational complexity. In: Computational complexity theory. In: Proc. Symp. App. Math., pp. 75\u201391. AMS (1989)","DOI":"10.1090\/psapm\/038\/1020810"},{"key":"28_CR11","volume-title":"Theoretical aspects of knowledge and rationality","author":"R. Meyden van der","year":"2003","unstructured":"van der Meyden, R., Patra, M.: Knowledge in quantum systems. In: Theoretical aspects of knowledge and rationality. ACM, Bloomington (2003)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-540-45220-1_34","volume-title":"Computer Science Logic","author":"R. Meyden van der","year":"2003","unstructured":"van der Meyden, R., Patra, M.: A logic for probability in quantum systems. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 427\u2013440. Springer, Heidelberg (2003)"},{"key":"28_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-30227-8_22","volume-title":"Logics in Artificial Intelligence","author":"P. Mateus","year":"2004","unstructured":"Mateus, P., Serandas, A.: Reasoning about quantum systems. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol.\u00a03229, pp. 239\u2013251. Springer, Heidelberg (2004)"},{"key":"28_CR14","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum computation and information. CUP (2001)"},{"issue":"2-3","key":"28_CR15","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/S0375-9601(02)01803-0","volume":"308","author":"M. Nielsen","year":"2003","unstructured":"Nielsen, M.: Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state. Physics Lett. A\u00a0308(2-3), 96\u2013100 (2003)","journal-title":"Physics Lett. A"},{"key":"28_CR16","unstructured":"Patra, M.: Logics for quantum computation and information, cse.unsw.edu.au\/db\/staff\/info\/mansp.html (2004)"},{"key":"28_CR17","volume-title":"Operational Quantum Physics","author":"M. Grabowski","year":"1995","unstructured":"Grabowski, M., Busch, P., Lathi, P.J.: Operational Quantum Physics. Springer, Berlin (1995)"},{"key":"28_CR18","volume-title":"Feynman Lectures on Physics","author":"R.B. Leighton","year":"1965","unstructured":"Leighton, R.B., Feynman, R.P., Sands, M.: Feynman Lectures on Physics, vol.\u00a0III. Addison-Wesely, Reading (1965)"},{"key":"28_CR19","volume-title":"Mathematical Logic","author":"J.R. Shoenfield","year":"1967","unstructured":"Shoenfield, J.R.: Mathematical Logic. Addison-Wesley, Reading (1967)"},{"key":"28_CR20","doi-asserted-by":"crossref","DOI":"10.1515\/9781400882007","volume-title":"Theory of Formal Systems","author":"R.M. Smullyan","year":"1961","unstructured":"Smullyan, R.M.: Theory of Formal Systems. Princeton University Press, Princeton (1961)"},{"key":"28_CR21","unstructured":"van Tonder, A.: A lambda calculus for quantum computation. arXiv e-Print (2003), http:\/\/arxiv.org\/abs\/quant-ph\/03071509"},{"key":"28_CR22","first-page":"352","volume-title":"Proc. 34th. Symp. on Foundations of computer science","author":"A.C.-C. Yao","year":"1993","unstructured":"Yao, A.C.-C.: Quantum circuit complexity. In: Proc. 34th. Symp. on Foundations of computer science, pp. 352\u2013360. IEEE, Los Alamitos (1993)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560647_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T02:41:35Z","timestamp":1736044895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560647_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291077","9783540320722"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11560647_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}