Quick Navigation
Topics
Quantum Machine Learning
Logical structures underlying quantum computing
arXiv
Authors: Federico Holik, Giuseppe Sergioli, Hector Freytes, Angelo Plastino
Year
2018
Paper ID
23293
Status
Preprint
Abstract Read
~2 min
Abstract Words
29
Citations
N/A
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.
Why This Paper Matters
- This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
- It adds a 2018 reference point for readers tracking recent quantum research.
- In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.