Truly Concurrent Process Algebra to Unifying Quantum and Classical Computing

11/02/2018
by   Yong Wang, et al.
0

Based on our previous work on truly concurrent process algebra, we use it to unify quantum and classical computing for open and closed quantum systems. This resulted algebra can be used to verify the behaviors of quantum and classical computing mixed systems, with a flavor of true concurrency.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/02/2018

Truly Concurrent Process Algebra to Unifying Quantum and Classical Computing for Open Systems

Based on our previous work on truly concurrent process algebra, we use i...
research
10/04/2021

Verification of Distributed Quantum Protocols

Truly concurrent process algebras are generalizations to the traditional...
research
12/08/2022

The R-algebra of Quasiknowledge and Convex Optimization

This article develops a convex description of a classical or quantum lea...
research
01/06/2020

An extended quantum process algebra (eQPAlg) approach for distributed quantum systems

In this work, we have expounded the communication procedure of quantum s...
research
07/27/2021

A quantum complexity approach to the Kirchberg Embedding Problem

The Kirchberg Embedding Problem (KEP) asks if every C*-algebra embeds in...
research
04/12/2021

Actors – A Process Algebra Based Approach

We model actors based on truly concurrent process algebra, and capture t...
research
03/01/2020

Profinite congruences and unary algebras

Profinite congruences on profinite algebras determining profinite quotie...

Please sign up or login with your details

Forgot password? Click here to reset