Logical structures underlying quantum computing
classification
🪐 quant-ph
keywords
quantumstructuresadvancealgebraicalgorithmsaxiomatizationcapablecomputational
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.