Related papers: An algebra of automata which includes both classic…
We show a representation of Quantum Computers defines Quantum Turing Machines with associated Quantum Grammars. We then create examples of Quantum Grammars. Lastly we develop an algebraic approach to high level Quantum Languages using…
The formalism of classical and quantum mechanics on phase space leads to symplectic and Heisenberg group representations, respectively. The Wigner functions give a representation of the quantum system using classical variables. The…
This is an introduction to quantum algebra, from a geometric perspective. The classical spaces $X$, such as the Lie groups, homogeneous spaces, or more general manifolds, are described by various algebras $A$, defined over various fields…
The concept of a quantum algebra is made easy through the investigation of the prototype algebras $u_{qp}(2)$, $su_q(2)$ and $u_{qp}(1,1)$. The latter quantum algebras are introduced as deformations of the corresponding Lie algebras~; this…
Physical systems, characterized by an ensemble of interacting elementary constituents, can be represented and studied by different algebras of observables or operators. For example, a fully polarized electronic system can be investigated by…
The theory of computation is based on abstract computing automata which can be classified into a three-class hierarchy: Finite Automata (FA), Push-down Automata (PDA) and the Turing Machines (TM). Each class corresponds to grammar/language…
In the following pages we discuss infinite sequences defined on a finite alphabet, and more specially those which are generated by finite automata. We have divided our paper into seven parts which are more or less self-contained. Needless…
We aim to explore if inside a quantum vertex algebras, we can find the right notion of a quantum conformal algebra.
This paper combines the classical model of labeled transition systems with the epistemic model for reasoning about knowledge. The result is a unifying framework for modeling and analyzing multi-agent, knowledge-based, dynamic systems. On…
Alongside the development of quantum algorithms and quantum complexity theory in recent years, quantum techniques have also proved instrumental in obtaining results in classical (non-quantum) areas. In this paper we survey these results and…
For the classical mind, quantum mechanics is boggling enough; nevertheless more bizarre behavior could be imagined, thereby concentrating on propositional structures (empirical logics) that transcend the quantum domain. One can also…
We show that one can formulate an algebra with lattice ordering so as to contain one quantum and five classical operations as opposed to the standard formulation of the Hilbert space subspace algebra. The standard orthomodular lattice is…
The algebra of polynomials in operators that represent generalized coordinate and momentum and depend on the Planck constant is defined. The Planck constant is treated as the parameter taking values between zero and some nonvanishing $h_0$.…
Quantum baker`s map is a model of chaotic system. We study quantum dynamics for the quantum baker's map. We use the Schack and Caves symbolic description of the quantum baker`s map. We find an exact expression for the expectation value of…
The investigation of quantum-classical correspondence may lead to gain a deeper understanding of the classical limit of quantum theory. We develop a quantum formalism on the basis of a linear-invariant theorem, which gives an exact…
In this paper we present a unified algebraic framework to discuss the reduction of classical and quantum systems. The underlying algebraic structure is a Lie-Jordan algebra supplemented, in the quantum case, with a Banach structure. We…
Validation of a presumably universal theory, such as quantum mechanics, requires a quantum mechanical description of systems that carry out theoretical calculations and experiments. The description of quantum computers is under active…
Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as…
Quantum physics has revealed many interesting formal properties associated with the algebra of two operators, A and B, satisfying the partial commutation relation AB-BA=1. This study surveys the relationships between classical combinatorial…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…