Related papers: Computational Complexity of Quantum Satisfiability
Quantum logic has been introduced by Birkhoff and von Neumann as an attempt to base the logical primitives, the propositions and the relations and operations among them, on quantum theoretical entities, and thus on the related empirical…
Generalised Satisfiability Problems (or Boolean Constraint Satisfaction Problems), introduced by Schaefer in 1978, are a general class of problem which allow the systematic study of the complexity of satisfiability problems with different…
Linear logic was conceived in 1987 by Girard and, in contrast to classical logic, restricts the usage of the structural inference rules of weakening and contraction. With this, atoms of the logic are no longer interpreted as truth, but as…
The (meta)logic underlying classical theory of computation is Boolean (two-valued) logic. Quantum logic was proposed by Birkhoff and von Neumann as a logic of quantum mechanics more than sixty years ago. The major difference between Boolean…
We begin by discussing the history of quantum logic, dividing it into three eras or lives. The first life has to do with Birkhoff and von Neumann's algebraic approach in the 1930's. The second life has to do with attempt to understand…
The quantum logic program originated in a 1936 article by G. Birkhoff and J. von Neumann. This program is generally disregarded due to no-go theorems restricting the existence of the tensor product of elementary quantum logics and, above…
It is shown how all the major conceptual difficulties of standard (textbook) quantum mechanics, including the two measurement problems and the (supposed) nonlocality that conflicts with special relativity, are resolved in the consistent or…
In this paper, we are dealing with the fundamental concepts of Bi-logic proposed by Chilean psychoanalyst Ignacio Matte Blanco in the context of quantum logic, founded by Gareth Birkhoff and John Von Neumann. The main purpose of this paper…
A first-order logic with quantum variables is needed as an assertion language for specifying and reasoning about various properties (e.g. correctness) of quantum programs. Surprisingly, such a logic is missing in the literature, and the…
Using an algebraic framework we solve a problem posed in [5] and [7] about the axiomatizability of a quantum computational type logic related to fuzzy logic. A Hilbert-style calculus is developed obtaining an algebraic strong completeness…
Theoretical complexity is a vital subfield of computer science that enables us to mathematically investigate computation and answer many interesting queries about the nature of computational problems. It provides theoretical tools to assess…
Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm…
In mathematical aspect, we introduce quantum algorithm and the mathematical structure of quantum computer. Quantum algorithm is expressed by linear algebra on a finite dimensional complex inner product space. The mathematical formulations…
The topical quantum computation paradigm is a transposition of the Turing machine into the quantum framework. Implementations based on this paradigm have limitations as to the number of: qubits, computation steps, efficient quantum…
Quantum theory and functional analysis were created and put into essentially their final form during similar periods ending around 1930. Each was also a key outcome of the major revolutions that both physics and mathematics as a whole…
The (consistent or decoherent) histories interpretation provides a consistent realistic ontology for quantum mechanics, based on two main ideas. First, a logic (system of reasoning) is employed which is compatible with the Hilbert-space…
Classical programming languages cannot model essential elements of complex systems such as true random number generation. This paper develops a formal programming language called the lambda-q calculus that addresses the fundamental…
Since the pioneering work of Birkhoff and von Neumann, quantum logic has been interpreted as the logic of (closed) subspaces of a Hilbert space. There is a progression from the usual Boolean logic of subsets to the "quantum logic" of…
Knuth (1990) introduced the class of nested formulas and showed that their satisfiability can be decided in polynomial time. We show that, parameterized by the size of a smallest strong backdoor set to the target class of nested formulas,…
As has already been pointed out by Birkhoff and von Neumann, quantum logic can be formulated in terms of projective geometry. In three-dimensional Hilbert space, elementary logical propositions are associated with one-dimensional subspaces,…