相关论文: An algebra of automata which includes both classic…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
We show that quantum cellular automata naturally form the degree-zero part of a coarse homology theory. The recent result of Ji and Yang that the space of QCA forms an Omega-spectrum in the sense of algebraic topology is a direct…
In this paper, we investigate the classicality and quantumness of a quantum ensemble. We define a quantity called classicality to characterize how classical a quantum ensemble is. An ensemble of commuting states that can be manipulated…
We sketch a group-theoretical framework, based on the Heisenberg-Weyl group, encompassing both quantum and classical statistical descriptions of mechanical systems. We re-define in group-theoretical terms the kinematical arena and the…
We propose a categorical and algebraic study of quantale modules. The results and constructions presented are also applied to abstract algebraic logic and to image processing tasks.
We describe a general approach to modeling rational decision-making agents who adopt either quantum or classical mechanics based on the Quantum Bayesian (QBist) approach to quantum theory. With the additional ingredient of a scheme by which…
Instead of producing quantum languages that are fit for current quantum computers, we build a language from standard classical assembler and augment it with quantum capabilities so that quantum algorithms become a subset of it. This paves…
We review how an algebraic formulation for the dynamics of a physical system allows to describe a reduction procedure for both classical and quantum evolutions.
A consistent description of interactions between classical and quantum systems is relevant to quantum measurement theory, and to calculations in quantum chemistry and quantum gravity. A solution is offered here to this longstanding problem,…
We provide an overview of a canonical formalism that describes mixed quantum-classical systems in terms of statistical ensembles on configuration space, and discuss applications to measurement theory. It is shown that the formalism allows a…
In this paper we introduce a novel notion of probabilistic bisimulation for quantum processes and prove that it is congruent with respect to various process algebra combinators including parallel composition even when both classical and…
This work investigates the application of quantum machine learning techniques for classical and quantum communication across different qubit channel models. By employing parameterized quantum circuits and a flexible channel noise model, we…
This survey article is concerned with the modeling of the kinematical structure of quantum systems in an algebraic framework which eliminates certain conceptual and computational difficulties of the conventional approaches. Relying on the…
We define a language CQP (Communicating Quantum Processes) for modelling systems which combine quantum and classical communication and computation. CQP combines the communication primitives of the pi-calculus with primitives for measurement…
Quantum algorithms are demonstrated to outperform classical algorithms for certain problems and thus are promising candidates for efficient information processing. Herein we aim to provide a brief and popular introduction to quantum…
Scientists have demonstrated that quantum computing has presented novel approaches to address computational challenges, each varying in complexity. Adapting problem-solving strategies is crucial to harness the full potential of quantum…
We consider a class of simple quasi one-dimensional classically non-integrable systems which capture the essence of the periodic orbit structure of general hyperbolic nonintegrable dynamical systems. Their behavior is simple enough to allow…
In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms. We outline an algebraic axiomatization of these structures.
Quantum cellular automata (QCA) are reviewed, including early and more recent proposals. QCA are a generalization of (classical) cellular automata (CA) and in particular of reversible CA. The latter are reviewed shortly. An overview is…
In complete analogy with the classical situation (which is briefly reviewed) it is possible to define bi-Hamiltonian descriptions for Quantum systems. We also analyze compatible Hermitian structures in full analogy with compatible Poisson…