# Truly Concurrent Process Algebra to Unifying Quantum and Classical Computing

@article{Wang2018TrulyCP, title={Truly Concurrent Process Algebra to Unifying Quantum and Classical Computing}, author={Yong Wang}, journal={ArXiv}, year={2018}, volume={abs/1811.01070} }

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.

## References

SHOWING 1-4 OF 4 REFERENCES

Probabilistic Process Algebra to Unifying Quantum and Classical Computing in Closed Systems

- Computer Science, MathematicsInternational Journal of Theoretical Physics
- 2019

This work unify quantum and classical computing with an assumption of closed systems under the framework of ACP-like probabilistic process algebra, which can be used widely in verification for quantum and Classical computing mixed systems, such as most quantum communication protocols.

Algebraic Laws for True Concurrency

- Mathematics, Computer ScienceArXiv
- 2016

A whole axiomatization for true concurrency is established called APTC (Algebra for Parallelism in True Concurrency), which has four modules: BATC, APTC, recursion and abstraction, and the applications and extensions of APTC.

An Axiomatization for Quantum Processes to Unifying Quantum and Classical Computing

- Computer Science, MathematicsInternational Journal of Theoretical Physics
- 2019

An axiomatization for quantum processes called qACP is designed, which involves not only quantum information, but also classical information and unifies quantum computing and classical computing.