相关论文: QL(C^n) determines n

Based on an identified quantum relativity symmetry the contraction of which gives the Newtonian approximation of Galilean relativity, a quantum model of the physical space can be formulated with the Newtonian space seen in a way as the…

In this article, we review the use of numerical techniques to obtain solutions for the quantum Hamiltonian constraint in loop quantum cosmology (LQC). First, we summarize the basic features of LQC, and describe features of the constraint…

We introduce and investigate a weighted propositional configuration logic over commutative semirings. Our logic is intended to serve as a specification language for software architectures with quantitative features. We prove an efficient…

Scholars have wondered for a long time whether the language of quantum mechanics introduces a quantum notion of truth which is formalized by quantum logic (QL) and is incompatible with the classical (Tarskian) notion. We show that QL can be…

A formulation of quantum mechanics based on replacing the general unitary group by finite groups is considered. To solve problems arising in the context of this formulation, we use computer algebra and computational group theory methods.

One advantage of paraconsistent logic is that it can deal with inconsistencies without making the system trivial. However, unlike classical propositional calculus, its deductive system is limited, and the meaning of paraconsistent negation…

We give explicit, uniform formulas for the graded characters and total ranks of the Lie algebra homology of finite-dimensional representations in all classical types. In many cases, these compute the Tor groups of finite length modules over…

We describe a categorical model of MALL (Multiplicative Additive Linear Logic) inspired by the Heisenberg-Schr\"odinger duality of finite-dimensional quantum theory. Proofs of formulas with positive logical polarity correspond to CPTP…

A causal, non-Hermitian, renormalizable, local, unitary and Lorentz convariant formulation of Quantum Theory (QT) (= Quantum Mechanics (QM) and Quantum Field Theory (QFT)) is developed which is free of formalistic problems we face in the…

In the past few years it has been shown that universal quantum computation can be obtained by projective measurements alone, with no need for unitary gates. This suggests that the underlying logic of quantum computing may be an algebra of…

We provide a full characterisation of quantum differentiability (in the sense of Connes) on quantum tori. We also prove a quantum integration formula which differs substantially from the commutative case.

There are many different semantics for general logic programs (i.e. programs that use negation in the bodies of clauses). Most of these semantics are Turing complete (in a sense that can be made precise), implying that they are undecidable.…

We study a quantum version of the sequential game illustrating problems connected with making rational decisions. We compare the results that the two models (quantum and classical) yield. In the quantum model intransitivity gains importance…

We will show that if there exists a quantum query algorithm that exactly computes some total Boolean function f by making T queries, then there is a classical deterministic algorithm A that exactly computes f making O(T^3) queries. The best…

The concrete schemes to realize three types of basic quantum logical gates using linear quadripartite cluster states of optical continuous variables are proposed. The influences of noises and finite squeezing on the computation precision…

Buchholz and Grundling (Comm. Math. Phys., 272, 699--750, 2007) introduced a C$^\ast$-algebra called the resolvent algebra as a canonical quantisation of a symplectic vector space, and demonstrated that this algebra has several desirable…

The emphasis is made on the juxtaposition of (quantum~theorem) proving versus quantum (theorem~proving). The logical contents of verification of the statements concerning quantum systems is outlined. The Zittereingang (trembling input)…

For the first time it is shown that the logic of quantum mechanics can be derived from Classical Physics. An orthomodular lattice of propositions, characteristic of quantum logic, is constructed for manifolds in Einstein's theory of general…

It is shown that quantum mechanics on noncommutative spaces (NQM) can be obtained by the canonical quantization of some underlying second class constrained system formulated in extended configuration space. It leads, in particular, to an…

This paper relates the well-known Linear Temporal Logic with the logic of propositional schemata introduced by the authors. We prove that LTL is equivalent to a class of schemata in the sense that polynomial-time reductions exist from one…