Logical structures underlying quantum computing
arXiv:1811.06808 · doi:10.3390/e21010077
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.
References in corpus (13)
- Contextuality supplies the magic for quantum computation
- Building logical qubits in a superconducting quantum computing system
- Contextuality in Measurement-based Quantum Computation
- Concepts and Their Dynamics: A Quantum-Theoretic Modeling of Human Thought
- Computational power of correlations
- Contextuality and Wigner function negativity in qubit quantum computation
- Entanglement and Open Systems in Algebraic Quantum Field Theory
- Kochen-Specker theorem for von Neumann algebras
- "Social Laser": Action Amplification by Stimulated Emission of Social Energy
- Quantum information as a non-Kolmogorovian generalization of Shannon's theory
- On the lattice structure of probability spaces in quantum mechanics
- A quantum logical and geometrical approach to the study of improper mixtures
- Convex Quantum Logic