Quantum logics close to Boolean algebras
- URL: http://arxiv.org/abs/2101.05501v1
- Date: Thu, 14 Jan 2021 08:48:44 GMT
- Title: Quantum logics close to Boolean algebras
- Authors: Mirko Navara and Pavel Pt\'ak
- Abstract summary: We consider orthomodular posets endowed with a symmetric difference.
We consider quantum logics with an XOR-type connective.
Let us only note that the orthomodular posets pursued here have a potential for an arbitrarily high degree of non-compatibility.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We consider orthomodular posets endowed with a symmetric difference. We call
them ODPs. Expressed in the quantum logic language, we consider quantum logics
with an XOR-type connective. We study three classes of "almost Boolean" ODPs,
two of them defined by requiring rather specific behaviour of infima and the
third by a Boolean-like behaviour of Frink ideals. We establish a (rather
surprising) inclusion between the three classes, shadding thus light on their
intrinsic properties. (More details can be found in the Introduction that
follows.) Let us only note that the orthomodular posets pursued here, though
close to Boolean algebras (i.e., close to standard quantum logics), still have
a potential for an arbitrarily high degree of non-compatibility and hence they
may enrich the studies of mathematical foundations of quantum mechanics.
Related papers
- Projection-algebras and quantum logic [1.930852251165745]
P-algebras are a non-commutative, non-associative generalization of Boolean algebras.
A substructural logic of sequents is proved to be sound and complete for the logic of P-algebras.
arXiv Detail & Related papers (2024-02-10T20:52:50Z) - Non-Clifford and parallelizable fault-tolerant logical gates on constant
and almost-constant rate homological quantum LDPC codes via higher symmetries [1.3194391758295114]
We study fault-tolerant quantum computing for families of homological quantum low-density parity-check codes defined on 3-manifolds with constant or almost-constant encoding rate.
We have developed a generic formalism to compute the triple intersection invariants for 3-manifolds.
arXiv Detail & Related papers (2023-10-25T20:33:59Z) - A Quantum SMT Solver for Bit-Vector Theory [2.1401240672387574]
We develop a quantum SMT solver for the bit-vector theory.
With the characteristic of superposition in quantum system, our solver is able to consider all the inputs simultaneously.
arXiv Detail & Related papers (2023-03-16T14:32:50Z) - A substructural logic for quantum measurements [1.8782750537161614]
This paper presents a substructural logic of sequents with very restricted exchange and weakening rules.
It is sound with respect to sequences of measurements of a quantic system.
arXiv Detail & Related papers (2022-12-06T09:11:42Z) - Birkhoff-von Neumann Quantum Logic as an Assertion Language for Quantum
Programs [1.1878820609988696]
A first-order logic with quantum variables is needed as an assertion language for specifying and reasoning about various properties of quantum programs.
In this paper, we introduce a first-order extension of Birkhoff-von Neumann quantum logic with universal and existential quantifiers over quantum variables.
arXiv Detail & Related papers (2022-05-04T08:57:44Z) - LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits [58.720142291102135]
We introduce the LOv-calculus, a graphical language for reasoning about linear optical quantum circuits.
Two LOv-circuits represent the same quantum process if and only if one can be transformed into the other with the rules of the LOv-calculus.
arXiv Detail & Related papers (2022-04-25T16:59:26Z) - The Logic of Quantum Programs [77.34726150561087]
We present a logical calculus for reasoning about information flow in quantum programs.
In particular we introduce a dynamic logic that is capable of dealing with quantum measurements, unitary evolutions and entanglements in compound quantum systems.
arXiv Detail & Related papers (2021-09-14T16:08:37Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - The principle of majorization: application to random quantum circuits [68.8204255655161]
Three classes of circuits were considered: (i) universal, (ii) classically simulatable, and (iii) neither universal nor classically simulatable.
We verified that all the families of circuits satisfy on average the principle of majorization.
Clear differences appear in the fluctuations of the Lorenz curves associated to states.
arXiv Detail & Related papers (2021-02-19T16:07:09Z) - Sub-bosonic (deformed) ladder operators [62.997667081978825]
We present a class of deformed creation and annihilation operators that originates from a rigorous notion of fuzziness.
This leads to deformed, sub-bosonic commutation relations inducing a simple algebraic structure with modified eigenenergies and Fock states.
In addition, we investigate possible consequences of the introduced formalism in quantum field theories, as for instance, deviations from linearity in the dispersion relation for free quasibosons.
arXiv Detail & Related papers (2020-09-10T20:53:58Z) - PBS-Calculus: A Graphical Language for Coherent Control of Quantum
Computations [77.34726150561087]
We introduce the PBS-calculus to represent and reason on quantum computations involving coherent control of quantum operations.
We equip the language with an equational theory, which is proved to be sound and complete.
We consider applications like the implementation of controlled permutations and the unrolling of loops.
arXiv Detail & Related papers (2020-02-21T16:15:58Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.