Abstract
A quantum computational logic is constructed by employing density operators on spaces of qubits and quantum gates represented by unitary operators. It is shown that this quantum computational logic is isomorphic to the basic sequential effect algebra [0, 1].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cattaneo, G., Dalla Chiara, M., Giuntini, R., and Leporini, R. (in press). An unsharp logic from quantum computation. International Journal of Theoretical Physics.
Dvurečenskij, A. and Pulmannová, S. (2000). New Trends in Quantum Structures, Kluwer, Dordrecht.
Foulis, D. J. and Bennett, M. K. (1994). Effect algebras and unsharp quantum logics. Foundations of Physics 24, 1325-1346.
Giuntini, R. and Greuling, H. (1989). Toward a formal language for unsharp properties. Foundations of Physics 19, 931-945.
Gudder, S. and Greechie, R. (2002). Sequential products on effect algebras. Rep. Math. Phys. 49, 87-111.
Gudder, S. and Greechie, R. (in press-b). Uniqueness and Order in Sequential Effect Algebras.
Kôpka, F. and Chovanec, F. (1994). D-Posets. Math. Slovaca 44, 21-34.
Nielsen, M. and Chuang, I. (2000). Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, England.
Pittenger, A. (2001). An Introduction to Quantum Computing Algorithms, Birkhäuser, Boston.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gudder, S. Quantum Computational Logic. International Journal of Theoretical Physics 42, 39–47 (2003). https://doi.org/10.1023/A:1023327005274
Issue Date:
DOI: https://doi.org/10.1023/A:1023327005274