A formal system for quantum communication environments

• Anderson de Araújo USP
• Marcelo Finger USP

Resumo

The present paper provides a complete first-order system for quantum communication environments. These environments are static reliable synchronous systems of quantum communication among agents and the formal system defined combines probability and knowledge operators to describe them.

Referências

Baltag, A. and Smets, S. (2010). Correlated knowledge: an epistemic-logic view on quantum entanglement. International Journal of Theoretical Physhics, 49:3005–3021.

Baltazar, P., Chadha, R., and Mateus, P. (2008). Quantum computation tree logic - model checking and complete calculus. International Journal of Quantum Information, 6(2):219–236.

Bravyi, S. (2006). Efficient algorithm for a quantum analogue of 2-sat. ArXiv Quantum Physics e-prints.

Brázdil, T., Forejt, V., and Kucera, J. K. A. (2008). The satisfiability problem for probabilistic ctl. In LICS 2008, volume 1043-6871/08 of IEEE Computer Science Society, pages 391–402.

Carnielli, W. and Pizzi, C. (2008). Modalities and Multimodalities. Logic, Epistemology, and the Unity of Science. Springer Verlag, Berlin.

Cohen-Tannoudji, C., Diu, B., and Laloë, F. (1977). Quantum Mechanics. Wiley, New York.

Denchev, V. and Pandurangan, G. (2008). Distributed quantum computing: A new frontier in distributed systems or science fiction? ACM SIGACT News, 39(3):77–95.

Georgakopoulos, G., Kavvadias, D., and Papadimitriou, C. H. (1988). Probabilistic satisfiability. Journal of Complexity, 4(1):1–11.

Hodges, W. (2005). Model Theory. Encyclopedia of Mathematics and Applications. Cambridge University Press, Cambridge.

K. Engesser, D. M. G. and Lehmann, D. (2009). Handbook of quantum logic and quantum structures. North-Holland. Elsevier, Amsterdan.

Landauer, R. (1995). Is quantum mechanics useful? Philosophical Transactions: Physical Sciences and Engineering, 353(1703):367–376.

Landauer, R. (1996). The physical nature of information. Physics Letters A, 217:188–193.

Mateus, P. and Sernadas, A. (2006). Weakly complete axiomatization of exogenous quantum propositional logic. Information and Computation, 204:771–794.

Mayers, D. (2001). Unconditional security in quantum cryptography. Journal of the ACM, 48(3):351–406.

Nielson, M. A. and Chuang, I. L. (2000). Quantum Computation and Quantum Information. Cambridge University Press, Cambridge.

Preskill, J. (1998). Quantum computing: Pro and con. In Quantum Coherence and Decoherence, volume 454 of Mathematical, Physical and Engineering Sciences, pages 469–486. The Royal Society.

Shor, P. (1994). Algorithms for quantum computation: Discrete log and factoring. In Goldwasser, S., editor, Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 124–134. IEEE Computer Society Press, Los Alamitos.

Tarski, A. (1951). A Decision Method for Elementary Algebra and Geometry. 2nd ed. University of California Press, Berkeley.

van der Meyden, R. and Patra, M. (2003a). Knowledge in quantum systems. In Tennenholtz, M., editor, Theoretical Aspects of Rationality and Knowledge, volume 6433, pages 104–117. ACM.

van der Meyden, R. and Patra, M. (2003b). A logic for probability in quantum systems. In Baaz, M. and Makowsky, J., editors, Computer Science Logic, volume 2803 of Lecture Notes in Computer Science, pages 427–440, Berlin. Springer.

Yimsiriwattana, A. and Lomonaco, S. J. (2004). Distributed quantum computing: A distributed shor algorithm. In Donkor, E., Pirich, A. R., and Brandt, H. E., editors, Quantum Information and Computation II, volume 5436 of MSPIE, pages 360–372.

Ying, M. (2010). Quantum computation, quantum theory and ai. Artificial Intelligence, 174:162–176.