相关论文: An algebra of automata which includes both classic…

A classical local cellular automaton can describe an interacting quantum field theory for fermions. We construct a simple classical automaton for a particular version of the Thirring model with imaginary coupling. This interacting fermionic…

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…

A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…

Quantum correlations can be naturally formulated in a classical statistical system of infinitely many degrees of freedom. This realizes the underlying non-commutative structure in a classical statistical setting. We argue that the quantum…

The states of the physical algebra, namely the algebra generated by the operators involved in encoding and processing qubits, are considered instead of those of the whole system-algebra. If the physical algebra commutes with the interaction…

We present the quantum programming language cQPL which is an extended version of QPL [P. Selinger, Math. Struct. in Comp. Sci. 14(4):527-586, 2004]. It is capable of quantum communication and it can be used to formulate all possible quantum…

Although the suspicion that quantum mechanics is emergent has been lingering for a long time, only now we begin to understand how a bridge between classical and quantum mechanics might be squared with Bell's inequalities and other…

A method of quantization of classical soliton cellular automata (QSCA) is put forward that provides a description of their time evolution operator by means of quantum circuits that involve quantum gates from which the associated Hamiltonian…

We construct quantum stochastic integrals for the integrator being a martingale in a von Neumann algebra, and the integrand -- a suitable process with values in the same algebra, as densely defined operators affiliated with the algebra. In…

Some formulas and speculations are presented relative to integrable systems and quantum mechanics.

Automata admitting at most one accepting run per structure, known as unambiguous automata, find applications in verification of reactive systems as they extend the class of deterministic automata whilst maintaining some of their desirable…

A simple probabilistic cellular automaton is shown to be equivalent to a relativistic fermionic quantum field theory with interactions. Occupation numbers for fermions are classical bits or Ising spins. The automaton acts deterministically…

The mathematical formalism of quantum mechanics has been successfully employed in the last years to model situations in which the use of classical structures gives rise to problematical situations, and where typically quantum effects, such…

Circuit algebras are a symmetric analogue of Jones's planar algebras introduced to study finite-type invariants of virtual knotted objects. Circuit algebra structures appear, in different forms, across mathematics. This paper provides a…

We give a general construction for the classical limit of a quantum system defined in terms of generators of an arbitrary compact semisimple Lie algebra, generalizing known results for the $\mathfrak{su}_2$ and $\mathfrak{su}_3$ cases. The…

In the study of open quantum systems modeled by a unitary evolution of a bipartite Hilbert space, we address the question of which parts of the environment can be said to have a "classical action" on the system, in the sense of acting as a…

This note shows how quantum entanglement may be simulated in classical computing. The simulated entanglement protocol is implemented using oblivious transfer in the simplest case and other many-to-one mappings in more general cases. For the…

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…

An algebraic formalism for the study of a system of charged particles interacting with an external quantum field is developed. The notion of monoidal categories with duality is used for the description of composite systems and corresponding…

In this work we aim at applying automata techniques to problems studied in Dynamic Epistemic Logic, such as epistemic planning. To do so, we first remark that repeatedly executing ad infinitum a propositional event model from an initial…