Logical structures underlying quantum computing

7Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.

Abstract

In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms. We outline an algebraic axiomatization of these structures.

Cite

CITATION STYLE

APA

Holik, F., Sergioli, G., Freytes, H., & Plastino, A. (2019). Logical structures underlying quantum computing. Entropy, 21(1). https://doi.org/10.3390/e21010077

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free