Related papers: A Process Algebra Approach to Quantum Mechanics
This article presents a simplified version of the author's previous work. We first construct a causal growth process (CGP). We then form path Hilbert spaces using paths of varying lengths in the CGP. A sequence of positive operators on…
The quasilinearization method (QLM) of solving nonlinear differential equations is applied to the quantum mechanics by casting the Schr\"{o}dinger equation in the nonlinear Riccati form. The method, whose mathematical basis in physics was…
A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science.…
Quantum annealing allows for quantum fluctuations to be used used to assist in finding the solution to some of the worlds most challenging computational problems. Recently, this field has attracted much interest because of the construction…
We describe the "Feynman diagram" approach to nonrelativistic quantum mechanics on R^n, with magnetic and potential terms. In particular, for each classical path \gamma connecting points q_0 and q_1 in time t, we define a formal power…
In recent years we have witnessed a concentrated effort to make sense of thermodynamics for small-scale systems. One of the main difficulties is to capture a suitable notion of work that models realistically the purpose of quantum machines,…
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms.…
This paper presents a simple model that mimics quantum mechanics (QM) results without using complex wavefunctions or non-localities. The proposed model only uses integer-valued quantities and arithmetic operations, in particular assuming a…
Quantum process tomography (QPT) plays a central role in characterizing quantum gates and circuits, diagnosing quantum devices, calibrating hardware, and supporting quantum error correction. However, conventional QPT methods face challenges…
This paper concerns the relation between imperative process algebra and rely/guarantee logic. An imperative process algebra is complemented by a rely/guarantee logic that can be used to reason about how data change in the course of a…
This work is an extended version of the paper arXiv:0803.2669v1[math-ph], in which the main results were announced. We consider certain classical diffusion process for a wave function on the phase space. It is shown that at the time of…
Formal languages are essential for computer programming and are constructed to be easily processed by computers. In contrast, natural languages are much more challenging and instigated the field of Natural Language Processing (NLP). One…
In this work is discussed possibility and actuality of Lagrangian approach to quantum computations. Finite-dimensional Hilbert spaces used in this area provide some challenge for such consideration. The model discussed here can be…
Machine learning algorithms based on parametrized quantum circuits are prime candidates for near-term applications on noisy quantum computers. In this direction, various types of quantum machine learning models have been introduced and…
This paper proposes a general quantum algorithm that can be applied to any classical computer program. Each computational step is written using reversible operators, but the operators remain classical in that the qubits take on values of…
We develop a (co)algebraic framework to study a family of process calculi with monadic branching structures and recursion operators. Our framework features a uniform semantics of process terms and a complete axiomatisation of semantic…
The Geneva-Brussels approach to quantum mechanics (QM) and the semantic realism (SR) nonstandard interpretation of QM exhibit some common features and some deep conceptual differences. We discuss in this paper two elementary models provided…
Quantum computing has shown great potential to revolutionize traditional computing and can provide an exponential speedup for a wide range of possible applications, attracting various stakeholders. However, understanding fundamental quantum…
Carrying the insights of conditional probability to the quantum realm is notoriously difficult due to the non-commutative nature of quantum observables. Nevertheless, conditional expectations on von Neumann algebras have played a…
A "minimal" generalization of Quantum Mechanics is proposed, where the Lagrangian or the action functional is a mapping from the (classical) states of a system to the Lie algebra of a general compact Lie group, and the wave function takes…